java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/inc4.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:20:42,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:20:42,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:20:42,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:20:42,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:20:42,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:20:42,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:20:42,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:20:42,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:20:42,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:20:42,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:20:42,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:20:42,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:20:42,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:20:42,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:20:42,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:20:42,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:20:42,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:20:42,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:20:42,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:20:42,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:20:42,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:20:42,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:20:42,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:20:42,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:20:42,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:20:42,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:20:42,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:20:42,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:20:42,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:20:42,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:20:42,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:20:42,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:20:42,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:20:42,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:20:42,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:20:42,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:20:42,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:20:42,986 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:20:42,986 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:20:42,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:20:42,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:20:42,988 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:20:42,988 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:20:42,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:20:42,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:20:42,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:20:42,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:20:42,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:20:42,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:20:42,994 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:20:42,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:20:42,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:20:42,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:20:42,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:20:42,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:20:42,995 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:20:42,996 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:20:42,996 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:20:43,059 INFO ]: Repository-Root is: /tmp [2018-06-24 21:20:43,081 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:20:43,089 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:20:43,090 INFO ]: Initializing SmtParser... [2018-06-24 21:20:43,090 INFO ]: SmtParser initialized [2018-06-24 21:20:43,091 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-24 21:20:43,092 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-24 21:20:43,185 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 unknown [2018-06-24 21:20:43,543 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-24 21:20:43,557 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:20:43,572 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:20:43,572 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:20:43,573 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:20:43,573 INFO ]: ChcToBoogie initialized [2018-06-24 21:20:43,576 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,627 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43 Unit [2018-06-24 21:20:43,627 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:20:43,628 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:20:43,628 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:20:43,628 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:20:43,643 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,643 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,649 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,650 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,658 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,661 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,663 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (1/1) ... [2018-06-24 21:20:43,666 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:20:43,667 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:20:43,667 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:20:43,667 INFO ]: RCFGBuilder initialized [2018-06-24 21:20:43,668 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (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-24 21:20:43,677 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:20:43,677 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:20:43,677 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:20:43,677 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:20:43,677 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:20:43,677 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-24 21:20:44,352 INFO ]: Using library mode [2018-06-24 21:20:44,353 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:20:44 BoogieIcfgContainer [2018-06-24 21:20:44,353 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:20:44,353 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:20:44,353 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:20:44,354 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:20:44,355 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:20:44" (1/1) ... [2018-06-24 21:20:44,386 INFO ]: Initial Icfg 70 locations, 110 edges [2018-06-24 21:20:44,387 INFO ]: Using Remove infeasible edges [2018-06-24 21:20:44,388 INFO ]: Using Maximize final states [2018-06-24 21:20:44,388 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:20:44,389 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:20:44,391 INFO ]: Using Remove sink states [2018-06-24 21:20:44,392 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:20:44,392 INFO ]: Using Use SBE [2018-06-24 21:20:44,425 INFO ]: SBE split 1 edges [2018-06-24 21:20:44,431 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:20:44,433 INFO ]: 0 new accepting states [2018-06-24 21:20:45,095 INFO ]: Removed 78 edges and 25 locations by large block encoding [2018-06-24 21:20:45,097 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:20:45,102 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-24 21:20:45,102 INFO ]: 0 new accepting states [2018-06-24 21:20:45,103 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:20:45,103 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:20:45,104 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:20:45,104 INFO ]: 0 new accepting states [2018-06-24 21:20:45,104 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:20:45,107 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:20:45,107 INFO ]: Encoded RCFG 43 locations, 84 edges [2018-06-24 21:20:45,108 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:20:45 BasicIcfg [2018-06-24 21:20:45,108 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:20:45,109 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:20:45,109 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:20:45,112 INFO ]: TraceAbstraction initialized [2018-06-24 21:20:45,112 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:20:43" (1/4) ... [2018-06-24 21:20:45,113 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a71a274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:20:45, skipping insertion in model container [2018-06-24 21:20:45,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:20:43" (2/4) ... [2018-06-24 21:20:45,113 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a71a274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:20:45, skipping insertion in model container [2018-06-24 21:20:45,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:20:44" (3/4) ... [2018-06-24 21:20:45,113 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a71a274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:20:45, skipping insertion in model container [2018-06-24 21:20:45,113 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:20:45" (4/4) ... [2018-06-24 21:20:45,115 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:20:45,121 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:20:45,127 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:20:45,170 INFO ]: Using default assertion order modulation [2018-06-24 21:20:45,170 INFO ]: Interprodecural is true [2018-06-24 21:20:45,170 INFO ]: Hoare is false [2018-06-24 21:20:45,170 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:20:45,170 INFO ]: Backedges is TWOTRACK [2018-06-24 21:20:45,170 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:20:45,170 INFO ]: Difference is false [2018-06-24 21:20:45,170 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:20:45,170 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:20:45,184 INFO ]: Start isEmpty. Operand 43 states. [2018-06-24 21:20:45,198 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:20:45,198 INFO ]: Found error trace [2018-06-24 21:20:45,199 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:20:45,200 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:45,203 INFO ]: Analyzing trace with hash 2785790, now seen corresponding path program 1 times [2018-06-24 21:20:45,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:45,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:45,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:45,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:45,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:45,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:45,351 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:20:45,354 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:20:45,354 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:20:45,356 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:45,371 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:45,371 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:45,375 INFO ]: Start difference. First operand 43 states. Second operand 3 states. [2018-06-24 21:20:46,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:46,342 INFO ]: Finished difference Result 60 states and 116 transitions. [2018-06-24 21:20:46,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:46,343 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:20:46,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:46,359 INFO ]: With dead ends: 60 [2018-06-24 21:20:46,359 INFO ]: Without dead ends: 60 [2018-06-24 21:20:46,361 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:46,382 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 21:20:46,432 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-24 21:20:46,434 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:20:46,439 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 116 transitions. [2018-06-24 21:20:46,440 INFO ]: Start accepts. Automaton has 60 states and 116 transitions. Word has length 4 [2018-06-24 21:20:46,441 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:46,441 INFO ]: Abstraction has 60 states and 116 transitions. [2018-06-24 21:20:46,441 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:46,441 INFO ]: Start isEmpty. Operand 60 states and 116 transitions. [2018-06-24 21:20:46,445 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:20:46,445 INFO ]: Found error trace [2018-06-24 21:20:46,445 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:20:46,445 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:46,446 INFO ]: Analyzing trace with hash 87123150, now seen corresponding path program 1 times [2018-06-24 21:20:46,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:46,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:46,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:46,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:46,503 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:20:46,503 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:20:46,503 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:20:46,505 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:46,505 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:46,505 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:46,505 INFO ]: Start difference. First operand 60 states and 116 transitions. Second operand 3 states. [2018-06-24 21:20:46,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:46,763 INFO ]: Finished difference Result 75 states and 152 transitions. [2018-06-24 21:20:46,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:46,763 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:20:46,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:46,769 INFO ]: With dead ends: 75 [2018-06-24 21:20:46,769 INFO ]: Without dead ends: 75 [2018-06-24 21:20:46,770 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:46,770 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 21:20:46,785 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-24 21:20:46,785 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:20:46,789 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2018-06-24 21:20:46,789 INFO ]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 5 [2018-06-24 21:20:46,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:46,789 INFO ]: Abstraction has 75 states and 152 transitions. [2018-06-24 21:20:46,789 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:46,790 INFO ]: Start isEmpty. Operand 75 states and 152 transitions. [2018-06-24 21:20:46,792 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:20:46,792 INFO ]: Found error trace [2018-06-24 21:20:46,792 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:20:46,793 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:46,793 INFO ]: Analyzing trace with hash 87212523, now seen corresponding path program 1 times [2018-06-24 21:20:46,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:46,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:46,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:46,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,806 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:46,860 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:20:46,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:20:46,861 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:20:46,861 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:46,861 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:46,861 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:46,861 INFO ]: Start difference. First operand 75 states and 152 transitions. Second operand 3 states. [2018-06-24 21:20:46,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:46,899 INFO ]: Finished difference Result 114 states and 218 transitions. [2018-06-24 21:20:46,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:46,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:20:46,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:46,912 INFO ]: With dead ends: 114 [2018-06-24 21:20:46,912 INFO ]: Without dead ends: 114 [2018-06-24 21:20:46,913 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:46,913 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-24 21:20:46,947 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 78. [2018-06-24 21:20:46,947 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:20:46,953 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2018-06-24 21:20:46,953 INFO ]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 5 [2018-06-24 21:20:46,953 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:46,953 INFO ]: Abstraction has 78 states and 158 transitions. [2018-06-24 21:20:46,954 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:46,954 INFO ]: Start isEmpty. Operand 78 states and 158 transitions. [2018-06-24 21:20:46,963 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:20:46,963 INFO ]: Found error trace [2018-06-24 21:20:46,963 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:20:46,963 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:46,963 INFO ]: Analyzing trace with hash 87033777, now seen corresponding path program 1 times [2018-06-24 21:20:46,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:46,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:46,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:46,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:46,979 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:47,065 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:20:47,066 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:20:47,066 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:20:47,066 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:47,066 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:47,066 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:47,066 INFO ]: Start difference. First operand 78 states and 158 transitions. Second operand 3 states. [2018-06-24 21:20:47,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:47,351 INFO ]: Finished difference Result 94 states and 198 transitions. [2018-06-24 21:20:47,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:47,352 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:20:47,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:47,354 INFO ]: With dead ends: 94 [2018-06-24 21:20:47,354 INFO ]: Without dead ends: 94 [2018-06-24 21:20:47,354 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:47,354 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-24 21:20:47,367 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-06-24 21:20:47,367 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-24 21:20:47,370 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 198 transitions. [2018-06-24 21:20:47,370 INFO ]: Start accepts. Automaton has 94 states and 198 transitions. Word has length 5 [2018-06-24 21:20:47,370 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:47,370 INFO ]: Abstraction has 94 states and 198 transitions. [2018-06-24 21:20:47,370 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:47,370 INFO ]: Start isEmpty. Operand 94 states and 198 transitions. [2018-06-24 21:20:47,377 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:20:47,377 INFO ]: Found error trace [2018-06-24 21:20:47,377 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:47,377 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:47,377 INFO ]: Analyzing trace with hash 1235641795, now seen corresponding path program 1 times [2018-06-24 21:20:47,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:47,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:47,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:47,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:47,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:47,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:47,468 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:20:47,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:47,468 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-24 21:20:47,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:47,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:47,533 INFO ]: Computing forward predicates... [2018-06-24 21:20:47,561 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:20:47,592 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:20:47,593 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:20:47,593 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:47,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:47,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:47,593 INFO ]: Start difference. First operand 94 states and 198 transitions. Second operand 3 states. [2018-06-24 21:20:47,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:47,657 INFO ]: Finished difference Result 138 states and 270 transitions. [2018-06-24 21:20:47,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:47,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 21:20:47,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:47,665 INFO ]: With dead ends: 138 [2018-06-24 21:20:47,665 INFO ]: Without dead ends: 138 [2018-06-24 21:20:47,665 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:47,665 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-24 21:20:47,694 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-06-24 21:20:47,694 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-24 21:20:47,699 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 202 transitions. [2018-06-24 21:20:47,699 INFO ]: Start accepts. Automaton has 98 states and 202 transitions. Word has length 16 [2018-06-24 21:20:47,699 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:47,699 INFO ]: Abstraction has 98 states and 202 transitions. [2018-06-24 21:20:47,699 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:47,699 INFO ]: Start isEmpty. Operand 98 states and 202 transitions. [2018-06-24 21:20:47,708 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:20:47,708 INFO ]: Found error trace [2018-06-24 21:20:47,708 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:47,708 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:47,708 INFO ]: Analyzing trace with hash -44221883, now seen corresponding path program 1 times [2018-06-24 21:20:47,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:47,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:47,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:47,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:48,059 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:20:48,059 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:48,059 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:20:48,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:20:48,124 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:48,126 INFO ]: Computing forward predicates... [2018-06-24 21:20:48,426 INFO ]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:20:48,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:20:48,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2018-06-24 21:20:48,460 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:20:48,460 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:20:48,460 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:20:48,461 INFO ]: Start difference. First operand 98 states and 202 transitions. Second operand 7 states. [2018-06-24 21:20:50,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:50,017 INFO ]: Finished difference Result 267 states and 583 transitions. [2018-06-24 21:20:50,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:20:50,018 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-24 21:20:50,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:50,036 INFO ]: With dead ends: 267 [2018-06-24 21:20:50,036 INFO ]: Without dead ends: 213 [2018-06-24 21:20:50,037 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:20:50,037 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-24 21:20:50,076 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 141. [2018-06-24 21:20:50,076 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-24 21:20:50,082 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 308 transitions. [2018-06-24 21:20:50,083 INFO ]: Start accepts. Automaton has 141 states and 308 transitions. Word has length 16 [2018-06-24 21:20:50,083 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:50,083 INFO ]: Abstraction has 141 states and 308 transitions. [2018-06-24 21:20:50,083 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:20:50,083 INFO ]: Start isEmpty. Operand 141 states and 308 transitions. [2018-06-24 21:20:50,093 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:20:50,094 INFO ]: Found error trace [2018-06-24 21:20:50,094 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:50,094 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:50,094 INFO ]: Analyzing trace with hash 1928373664, now seen corresponding path program 1 times [2018-06-24 21:20:50,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:50,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:50,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:50,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:50,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:50,132 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:50,190 INFO ]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:20:50,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:50,190 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-24 21:20:50,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:50,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:50,253 INFO ]: Computing forward predicates... [2018-06-24 21:20:50,261 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:20:50,295 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:20:50,295 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:20:50,295 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:50,295 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:50,295 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:50,296 INFO ]: Start difference. First operand 141 states and 308 transitions. Second operand 3 states. [2018-06-24 21:20:50,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:50,575 INFO ]: Finished difference Result 165 states and 345 transitions. [2018-06-24 21:20:50,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:50,575 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-24 21:20:50,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:50,582 INFO ]: With dead ends: 165 [2018-06-24 21:20:50,582 INFO ]: Without dead ends: 165 [2018-06-24 21:20:50,583 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:50,583 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-24 21:20:50,601 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 160. [2018-06-24 21:20:50,601 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-24 21:20:50,606 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 335 transitions. [2018-06-24 21:20:50,606 INFO ]: Start accepts. Automaton has 160 states and 335 transitions. Word has length 19 [2018-06-24 21:20:50,606 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:50,606 INFO ]: Abstraction has 160 states and 335 transitions. [2018-06-24 21:20:50,606 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:50,606 INFO ]: Start isEmpty. Operand 160 states and 335 transitions. [2018-06-24 21:20:50,618 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:20:50,618 INFO ]: Found error trace [2018-06-24 21:20:50,618 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:50,618 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:50,618 INFO ]: Analyzing trace with hash 101376379, now seen corresponding path program 1 times [2018-06-24 21:20:50,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:50,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:50,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:50,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:50,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:50,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:50,890 INFO ]: Checked inductivity of 43 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 21:20:50,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:50,890 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-24 21:20:50,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:50,955 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:50,959 INFO ]: Computing forward predicates... [2018-06-24 21:20:51,096 INFO ]: Checked inductivity of 43 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:20:51,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:20:51,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-24 21:20:51,118 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:20:51,118 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:20:51,118 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:20:51,118 INFO ]: Start difference. First operand 160 states and 335 transitions. Second operand 7 states. [2018-06-24 21:20:51,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:51,702 INFO ]: Finished difference Result 326 states and 689 transitions. [2018-06-24 21:20:51,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:20:51,702 INFO ]: Start accepts. Automaton has 7 states. Word has length 30 [2018-06-24 21:20:51,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:51,716 INFO ]: With dead ends: 326 [2018-06-24 21:20:51,716 INFO ]: Without dead ends: 326 [2018-06-24 21:20:51,717 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:20:51,717 INFO ]: Start minimizeSevpa. Operand 326 states. [2018-06-24 21:20:51,751 INFO ]: Finished minimizeSevpa. Reduced states from 326 to 206. [2018-06-24 21:20:51,751 INFO ]: Start removeUnreachable. Operand 206 states. [2018-06-24 21:20:51,755 INFO ]: Finished removeUnreachable. Reduced from 206 states to 206 states and 449 transitions. [2018-06-24 21:20:51,756 INFO ]: Start accepts. Automaton has 206 states and 449 transitions. Word has length 30 [2018-06-24 21:20:51,756 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:51,756 INFO ]: Abstraction has 206 states and 449 transitions. [2018-06-24 21:20:51,756 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:20:51,756 INFO ]: Start isEmpty. Operand 206 states and 449 transitions. [2018-06-24 21:20:51,772 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:20:51,772 INFO ]: Found error trace [2018-06-24 21:20:51,772 INFO ]: trace histogram [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:51,772 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:51,773 INFO ]: Analyzing trace with hash 917903975, now seen corresponding path program 1 times [2018-06-24 21:20:51,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:51,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:51,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:51,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:51,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:51,784 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:51,865 INFO ]: Checked inductivity of 80 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-24 21:20:51,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:51,865 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:20:51,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:20:51,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:51,966 INFO ]: Computing forward predicates... [2018-06-24 21:20:52,097 INFO ]: Checked inductivity of 80 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 21:20:52,134 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:20:52,134 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 7 [2018-06-24 21:20:52,135 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:20:52,135 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:20:52,135 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:20:52,135 INFO ]: Start difference. First operand 206 states and 449 transitions. Second operand 7 states. [2018-06-24 21:20:52,400 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 21:20:52,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:52,975 INFO ]: Finished difference Result 300 states and 633 transitions. [2018-06-24 21:20:52,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:20:52,976 INFO ]: Start accepts. Automaton has 7 states. Word has length 39 [2018-06-24 21:20:52,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:52,985 INFO ]: With dead ends: 300 [2018-06-24 21:20:52,985 INFO ]: Without dead ends: 300 [2018-06-24 21:20:52,985 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:20:52,985 INFO ]: Start minimizeSevpa. Operand 300 states. [2018-06-24 21:20:53,011 INFO ]: Finished minimizeSevpa. Reduced states from 300 to 226. [2018-06-24 21:20:53,011 INFO ]: Start removeUnreachable. Operand 226 states. [2018-06-24 21:20:53,015 INFO ]: Finished removeUnreachable. Reduced from 226 states to 226 states and 461 transitions. [2018-06-24 21:20:53,015 INFO ]: Start accepts. Automaton has 226 states and 461 transitions. Word has length 39 [2018-06-24 21:20:53,015 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:53,015 INFO ]: Abstraction has 226 states and 461 transitions. [2018-06-24 21:20:53,015 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:20:53,015 INFO ]: Start isEmpty. Operand 226 states and 461 transitions. [2018-06-24 21:20:53,027 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 21:20:53,027 INFO ]: Found error trace [2018-06-24 21:20:53,027 INFO ]: trace histogram [6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:53,027 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:53,028 INFO ]: Analyzing trace with hash -223665989, now seen corresponding path program 1 times [2018-06-24 21:20:53,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:53,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:53,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:53,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:53,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:53,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:53,234 INFO ]: Checked inductivity of 86 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-24 21:20:53,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:53,234 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-24 21:20:53,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:53,331 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:53,335 INFO ]: Computing forward predicates... [2018-06-24 21:20:53,437 INFO ]: Checked inductivity of 86 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 21:20:53,456 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:20:53,456 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-24 21:20:53,457 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:20:53,457 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:20:53,457 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:20:53,457 INFO ]: Start difference. First operand 226 states and 461 transitions. Second operand 11 states. [2018-06-24 21:20:54,219 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-24 21:20:57,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:57,116 INFO ]: Finished difference Result 757 states and 2213 transitions. [2018-06-24 21:20:57,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:20:57,116 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-24 21:20:57,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:57,152 INFO ]: With dead ends: 757 [2018-06-24 21:20:57,152 INFO ]: Without dead ends: 657 [2018-06-24 21:20:57,153 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:20:57,154 INFO ]: Start minimizeSevpa. Operand 657 states. [2018-06-24 21:20:57,253 INFO ]: Finished minimizeSevpa. Reduced states from 657 to 380. [2018-06-24 21:20:57,253 INFO ]: Start removeUnreachable. Operand 380 states. [2018-06-24 21:20:57,267 INFO ]: Finished removeUnreachable. Reduced from 380 states to 380 states and 848 transitions. [2018-06-24 21:20:57,268 INFO ]: Start accepts. Automaton has 380 states and 848 transitions. Word has length 41 [2018-06-24 21:20:57,268 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:57,268 INFO ]: Abstraction has 380 states and 848 transitions. [2018-06-24 21:20:57,268 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:20:57,268 INFO ]: Start isEmpty. Operand 380 states and 848 transitions. [2018-06-24 21:20:57,292 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-24 21:20:57,292 INFO ]: Found error trace [2018-06-24 21:20:57,292 INFO ]: trace histogram [8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:57,292 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:57,292 INFO ]: Analyzing trace with hash 128795603, now seen corresponding path program 1 times [2018-06-24 21:20:57,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:57,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:57,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:57,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:57,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:57,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:57,393 INFO ]: Checked inductivity of 192 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-24 21:20:57,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:57,393 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) [2018-06-24 21:20:57,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:20:57,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:57,520 INFO ]: Computing forward predicates... [2018-06-24 21:20:57,536 INFO ]: Checked inductivity of 192 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-06-24 21:20:57,567 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:20:57,567 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:20:57,567 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:20:57,568 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:20:57,568 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:57,568 INFO ]: Start difference. First operand 380 states and 848 transitions. Second operand 3 states. [2018-06-24 21:20:57,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:57,972 INFO ]: Finished difference Result 423 states and 948 transitions. [2018-06-24 21:20:57,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:20:57,972 INFO ]: Start accepts. Automaton has 3 states. Word has length 59 [2018-06-24 21:20:57,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:57,982 INFO ]: With dead ends: 423 [2018-06-24 21:20:57,982 INFO ]: Without dead ends: 400 [2018-06-24 21:20:57,983 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:20:57,983 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-24 21:20:58,026 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-06-24 21:20:58,026 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 21:20:58,033 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 890 transitions. [2018-06-24 21:20:58,033 INFO ]: Start accepts. Automaton has 400 states and 890 transitions. Word has length 59 [2018-06-24 21:20:58,034 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:58,034 INFO ]: Abstraction has 400 states and 890 transitions. [2018-06-24 21:20:58,034 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:20:58,034 INFO ]: Start isEmpty. Operand 400 states and 890 transitions. [2018-06-24 21:20:58,055 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-24 21:20:58,055 INFO ]: Found error trace [2018-06-24 21:20:58,055 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 3, 3, 3, 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-24 21:20:58,055 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:58,055 INFO ]: Analyzing trace with hash 877010801, now seen corresponding path program 1 times [2018-06-24 21:20:58,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:58,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:58,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:58,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:58,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:58,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:58,226 INFO ]: Checked inductivity of 506 backedges. 117 proven. 11 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-06-24 21:20:58,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:58,226 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) [2018-06-24 21:20:58,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:20:58,433 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:58,439 INFO ]: Computing forward predicates... [2018-06-24 21:20:58,505 INFO ]: Checked inductivity of 506 backedges. 184 proven. 5 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-06-24 21:20:58,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:20:58,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8] total 9 [2018-06-24 21:20:58,534 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:20:58,534 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:20:58,534 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:20:58,534 INFO ]: Start difference. First operand 400 states and 890 transitions. Second operand 9 states. [2018-06-24 21:20:59,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:20:59,440 INFO ]: Finished difference Result 671 states and 1935 transitions. [2018-06-24 21:20:59,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:20:59,440 INFO ]: Start accepts. Automaton has 9 states. Word has length 94 [2018-06-24 21:20:59,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:20:59,474 INFO ]: With dead ends: 671 [2018-06-24 21:20:59,474 INFO ]: Without dead ends: 652 [2018-06-24 21:20:59,474 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:20:59,474 INFO ]: Start minimizeSevpa. Operand 652 states. [2018-06-24 21:20:59,559 INFO ]: Finished minimizeSevpa. Reduced states from 652 to 457. [2018-06-24 21:20:59,559 INFO ]: Start removeUnreachable. Operand 457 states. [2018-06-24 21:20:59,569 INFO ]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1100 transitions. [2018-06-24 21:20:59,569 INFO ]: Start accepts. Automaton has 457 states and 1100 transitions. Word has length 94 [2018-06-24 21:20:59,569 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:20:59,569 INFO ]: Abstraction has 457 states and 1100 transitions. [2018-06-24 21:20:59,569 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:20:59,569 INFO ]: Start isEmpty. Operand 457 states and 1100 transitions. [2018-06-24 21:20:59,589 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-24 21:20:59,589 INFO ]: Found error trace [2018-06-24 21:20:59,589 INFO ]: trace histogram [12, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:20:59,589 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:20:59,589 INFO ]: Analyzing trace with hash -540217410, now seen corresponding path program 1 times [2018-06-24 21:20:59,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:20:59,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:20:59,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:59,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:20:59,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:20:59,606 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:59,767 INFO ]: Checked inductivity of 449 backedges. 99 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-06-24 21:20:59,767 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:20:59,767 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) [2018-06-24 21:20:59,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:20:59,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:20:59,931 INFO ]: Computing forward predicates... [2018-06-24 21:21:00,451 INFO ]: Checked inductivity of 449 backedges. 173 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-24 21:21:00,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:00,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 7 [2018-06-24 21:21:00,484 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:21:00,484 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:21:00,484 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:21:00,484 INFO ]: Start difference. First operand 457 states and 1100 transitions. Second operand 7 states. [2018-06-24 21:21:02,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:02,803 INFO ]: Finished difference Result 646 states and 1638 transitions. [2018-06-24 21:21:02,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:21:02,803 INFO ]: Start accepts. Automaton has 7 states. Word has length 88 [2018-06-24 21:21:02,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:02,825 INFO ]: With dead ends: 646 [2018-06-24 21:21:02,825 INFO ]: Without dead ends: 646 [2018-06-24 21:21:02,825 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:21:02,826 INFO ]: Start minimizeSevpa. Operand 646 states. [2018-06-24 21:21:02,894 INFO ]: Finished minimizeSevpa. Reduced states from 646 to 501. [2018-06-24 21:21:02,894 INFO ]: Start removeUnreachable. Operand 501 states. [2018-06-24 21:21:02,904 INFO ]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1199 transitions. [2018-06-24 21:21:02,904 INFO ]: Start accepts. Automaton has 501 states and 1199 transitions. Word has length 88 [2018-06-24 21:21:02,904 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:02,904 INFO ]: Abstraction has 501 states and 1199 transitions. [2018-06-24 21:21:02,904 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:21:02,904 INFO ]: Start isEmpty. Operand 501 states and 1199 transitions. [2018-06-24 21:21:02,926 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-24 21:21:02,926 INFO ]: Found error trace [2018-06-24 21:21:02,926 INFO ]: trace histogram [15, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1] [2018-06-24 21:21:02,926 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:02,926 INFO ]: Analyzing trace with hash 1423678324, now seen corresponding path program 1 times [2018-06-24 21:21:02,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:02,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:02,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:02,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:02,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:02,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:03,055 INFO ]: Checked inductivity of 596 backedges. 107 proven. 54 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-06-24 21:21:03,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:03,056 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) [2018-06-24 21:21:03,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:03,237 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:03,244 INFO ]: Computing forward predicates... [2018-06-24 21:21:03,265 INFO ]: Checked inductivity of 596 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-24 21:21:03,297 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:21:03,297 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:21:03,298 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:03,298 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:03,298 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:03,298 INFO ]: Start difference. First operand 501 states and 1199 transitions. Second operand 3 states. [2018-06-24 21:21:03,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:03,982 INFO ]: Finished difference Result 527 states and 1261 transitions. [2018-06-24 21:21:03,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:03,982 INFO ]: Start accepts. Automaton has 3 states. Word has length 100 [2018-06-24 21:21:03,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:03,998 INFO ]: With dead ends: 527 [2018-06-24 21:21:03,998 INFO ]: Without dead ends: 527 [2018-06-24 21:21:03,999 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:04,002 INFO ]: Start minimizeSevpa. Operand 527 states. [2018-06-24 21:21:04,062 INFO ]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-06-24 21:21:04,062 INFO ]: Start removeUnreachable. Operand 527 states. [2018-06-24 21:21:04,072 INFO ]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1261 transitions. [2018-06-24 21:21:04,072 INFO ]: Start accepts. Automaton has 527 states and 1261 transitions. Word has length 100 [2018-06-24 21:21:04,073 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:04,073 INFO ]: Abstraction has 527 states and 1261 transitions. [2018-06-24 21:21:04,073 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:04,073 INFO ]: Start isEmpty. Operand 527 states and 1261 transitions. [2018-06-24 21:21:04,088 INFO ]: Finished isEmpty. Found accepting run of length 129 [2018-06-24 21:21:04,088 INFO ]: Found error trace [2018-06-24 21:21:04,088 INFO ]: trace histogram [19, 8, 8, 8, 8, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:04,089 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:04,091 INFO ]: Analyzing trace with hash 1680127412, now seen corresponding path program 1 times [2018-06-24 21:21:04,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:04,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:04,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:04,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:04,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:04,112 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:04,310 INFO ]: Checked inductivity of 992 backedges. 147 proven. 105 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2018-06-24 21:21:04,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:04,310 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:04,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:04,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:04,548 INFO ]: Computing forward predicates... [2018-06-24 21:21:04,569 INFO ]: Checked inductivity of 992 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2018-06-24 21:21:04,602 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:21:04,603 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:21:04,603 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:04,603 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:04,603 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:04,603 INFO ]: Start difference. First operand 527 states and 1261 transitions. Second operand 3 states. [2018-06-24 21:21:05,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:05,310 INFO ]: Finished difference Result 553 states and 1318 transitions. [2018-06-24 21:21:05,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:05,310 INFO ]: Start accepts. Automaton has 3 states. Word has length 128 [2018-06-24 21:21:05,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:05,324 INFO ]: With dead ends: 553 [2018-06-24 21:21:05,324 INFO ]: Without dead ends: 553 [2018-06-24 21:21:05,325 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:05,325 INFO ]: Start minimizeSevpa. Operand 553 states. [2018-06-24 21:21:05,376 INFO ]: Finished minimizeSevpa. Reduced states from 553 to 522. [2018-06-24 21:21:05,376 INFO ]: Start removeUnreachable. Operand 522 states. [2018-06-24 21:21:05,384 INFO ]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1244 transitions. [2018-06-24 21:21:05,384 INFO ]: Start accepts. Automaton has 522 states and 1244 transitions. Word has length 128 [2018-06-24 21:21:05,384 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:05,384 INFO ]: Abstraction has 522 states and 1244 transitions. [2018-06-24 21:21:05,384 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:05,384 INFO ]: Start isEmpty. Operand 522 states and 1244 transitions. [2018-06-24 21:21:05,397 INFO ]: Finished isEmpty. Found accepting run of length 141 [2018-06-24 21:21:05,397 INFO ]: Found error trace [2018-06-24 21:21:05,397 INFO ]: trace histogram [21, 10, 10, 10, 10, 10, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:05,397 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:05,398 INFO ]: Analyzing trace with hash -1179153516, now seen corresponding path program 1 times [2018-06-24 21:21:05,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:05,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:05,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:05,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:05,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:05,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:05,986 INFO ]: Checked inductivity of 1194 backedges. 167 proven. 217 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2018-06-24 21:21:05,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:05,986 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-24 21:21:05,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:06,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:06,240 INFO ]: Computing forward predicates... [2018-06-24 21:21:06,466 INFO ]: Checked inductivity of 1194 backedges. 290 proven. 201 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-06-24 21:21:06,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:06,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 21:21:06,487 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:21:06,487 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:21:06,487 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:21:06,487 INFO ]: Start difference. First operand 522 states and 1244 transitions. Second operand 13 states. [2018-06-24 21:21:09,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:09,763 INFO ]: Finished difference Result 1358 states and 3406 transitions. [2018-06-24 21:21:09,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:21:09,763 INFO ]: Start accepts. Automaton has 13 states. Word has length 140 [2018-06-24 21:21:09,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:09,815 INFO ]: With dead ends: 1358 [2018-06-24 21:21:09,815 INFO ]: Without dead ends: 1160 [2018-06-24 21:21:09,815 INFO ]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:21:09,816 INFO ]: Start minimizeSevpa. Operand 1160 states. [2018-06-24 21:21:09,924 INFO ]: Finished minimizeSevpa. Reduced states from 1160 to 793. [2018-06-24 21:21:09,924 INFO ]: Start removeUnreachable. Operand 793 states. [2018-06-24 21:21:09,938 INFO ]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1948 transitions. [2018-06-24 21:21:09,938 INFO ]: Start accepts. Automaton has 793 states and 1948 transitions. Word has length 140 [2018-06-24 21:21:09,938 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:09,938 INFO ]: Abstraction has 793 states and 1948 transitions. [2018-06-24 21:21:09,938 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:21:09,938 INFO ]: Start isEmpty. Operand 793 states and 1948 transitions. [2018-06-24 21:21:09,971 INFO ]: Finished isEmpty. Found accepting run of length 385 [2018-06-24 21:21:09,971 INFO ]: Found error trace [2018-06-24 21:21:09,971 INFO ]: trace histogram [58, 27, 27, 27, 27, 27, 22, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:09,971 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:09,971 INFO ]: Analyzing trace with hash -252191945, now seen corresponding path program 1 times [2018-06-24 21:21:09,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:09,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:09,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:09,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:09,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:10,010 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:10,399 INFO ]: Checked inductivity of 9364 backedges. 632 proven. 240 refuted. 0 times theorem prover too weak. 8492 trivial. 0 not checked. [2018-06-24 21:21:10,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:10,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:21:10,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:11,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:11,073 INFO ]: Computing forward predicates... [2018-06-24 21:21:11,206 INFO ]: Checked inductivity of 9364 backedges. 4830 proven. 0 refuted. 0 times theorem prover too weak. 4534 trivial. 0 not checked. [2018-06-24 21:21:11,239 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:21:11,239 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:21:11,240 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:11,240 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:11,240 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:11,240 INFO ]: Start difference. First operand 793 states and 1948 transitions. Second operand 3 states. [2018-06-24 21:21:11,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:11,332 INFO ]: Finished difference Result 853 states and 2102 transitions. [2018-06-24 21:21:11,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:11,332 INFO ]: Start accepts. Automaton has 3 states. Word has length 384 [2018-06-24 21:21:11,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:11,353 INFO ]: With dead ends: 853 [2018-06-24 21:21:11,353 INFO ]: Without dead ends: 813 [2018-06-24 21:21:11,354 INFO ]: 0 DeclaredPredicates, 386 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:11,354 INFO ]: Start minimizeSevpa. Operand 813 states. [2018-06-24 21:21:11,428 INFO ]: Finished minimizeSevpa. Reduced states from 813 to 813. [2018-06-24 21:21:11,428 INFO ]: Start removeUnreachable. Operand 813 states. [2018-06-24 21:21:11,441 INFO ]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1994 transitions. [2018-06-24 21:21:11,441 INFO ]: Start accepts. Automaton has 813 states and 1994 transitions. Word has length 384 [2018-06-24 21:21:11,441 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:11,441 INFO ]: Abstraction has 813 states and 1994 transitions. [2018-06-24 21:21:11,441 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:11,442 INFO ]: Start isEmpty. Operand 813 states and 1994 transitions. [2018-06-24 21:21:11,476 INFO ]: Finished isEmpty. Found accepting run of length 531 [2018-06-24 21:21:11,476 INFO ]: Found error trace [2018-06-24 21:21:11,477 INFO ]: trace histogram [80, 35, 35, 35, 35, 35, 31, 12, 12, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:11,477 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:11,477 INFO ]: Analyzing trace with hash -653149332, now seen corresponding path program 1 times [2018-06-24 21:21:11,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:11,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:11,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:11,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:11,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:11,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:12,363 INFO ]: Checked inductivity of 17838 backedges. 610 proven. 113 refuted. 0 times theorem prover too weak. 17115 trivial. 0 not checked. [2018-06-24 21:21:12,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:12,363 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:12,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:13,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:13,149 INFO ]: Computing forward predicates... [2018-06-24 21:21:13,324 INFO ]: Checked inductivity of 17838 backedges. 1122 proven. 109 refuted. 0 times theorem prover too weak. 16607 trivial. 0 not checked. [2018-06-24 21:21:13,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:13,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-06-24 21:21:13,348 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:13,348 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:13,348 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:13,348 INFO ]: Start difference. First operand 813 states and 1994 transitions. Second operand 3 states. [2018-06-24 21:21:13,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:13,484 INFO ]: Finished difference Result 841 states and 2066 transitions. [2018-06-24 21:21:13,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:13,484 INFO ]: Start accepts. Automaton has 3 states. Word has length 530 [2018-06-24 21:21:13,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:13,501 INFO ]: With dead ends: 841 [2018-06-24 21:21:13,501 INFO ]: Without dead ends: 791 [2018-06-24 21:21:13,501 INFO ]: 0 DeclaredPredicates, 532 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:13,501 INFO ]: Start minimizeSevpa. Operand 791 states. [2018-06-24 21:21:13,572 INFO ]: Finished minimizeSevpa. Reduced states from 791 to 791. [2018-06-24 21:21:13,572 INFO ]: Start removeUnreachable. Operand 791 states. [2018-06-24 21:21:13,584 INFO ]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1944 transitions. [2018-06-24 21:21:13,584 INFO ]: Start accepts. Automaton has 791 states and 1944 transitions. Word has length 530 [2018-06-24 21:21:13,584 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:13,584 INFO ]: Abstraction has 791 states and 1944 transitions. [2018-06-24 21:21:13,584 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:13,584 INFO ]: Start isEmpty. Operand 791 states and 1944 transitions. [2018-06-24 21:21:13,637 INFO ]: Finished isEmpty. Found accepting run of length 865 [2018-06-24 21:21:13,637 INFO ]: Found error trace [2018-06-24 21:21:13,637 INFO ]: trace histogram [131, 57, 57, 57, 57, 57, 50, 20, 20, 20, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1] [2018-06-24 21:21:13,637 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:13,638 INFO ]: Analyzing trace with hash 1979108557, now seen corresponding path program 1 times [2018-06-24 21:21:13,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:13,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:13,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:13,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:13,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:14,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:15,203 INFO ]: Checked inductivity of 47724 backedges. 865 proven. 419 refuted. 0 times theorem prover too weak. 46440 trivial. 0 not checked. [2018-06-24 21:21:15,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:15,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:21:15,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:16,441 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:16,498 INFO ]: Computing forward predicates... [2018-06-24 21:21:17,038 INFO ]: Checked inductivity of 47724 backedges. 23443 proven. 109 refuted. 0 times theorem prover too weak. 24172 trivial. 0 not checked. [2018-06-24 21:21:17,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:17,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-06-24 21:21:17,079 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:17,079 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:17,079 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:17,079 INFO ]: Start difference. First operand 791 states and 1944 transitions. Second operand 3 states. [2018-06-24 21:21:18,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:18,094 INFO ]: Finished difference Result 779 states and 1762 transitions. [2018-06-24 21:21:18,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:18,094 INFO ]: Start accepts. Automaton has 3 states. Word has length 864 [2018-06-24 21:21:18,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:18,108 INFO ]: With dead ends: 779 [2018-06-24 21:21:18,108 INFO ]: Without dead ends: 753 [2018-06-24 21:21:18,109 INFO ]: 0 DeclaredPredicates, 866 GetRequests, 864 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:18,109 INFO ]: Start minimizeSevpa. Operand 753 states. [2018-06-24 21:21:18,171 INFO ]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-06-24 21:21:18,171 INFO ]: Start removeUnreachable. Operand 753 states. [2018-06-24 21:21:18,183 INFO ]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1704 transitions. [2018-06-24 21:21:18,183 INFO ]: Start accepts. Automaton has 753 states and 1704 transitions. Word has length 864 [2018-06-24 21:21:18,183 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:18,183 INFO ]: Abstraction has 753 states and 1704 transitions. [2018-06-24 21:21:18,183 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:18,184 INFO ]: Start isEmpty. Operand 753 states and 1704 transitions. [2018-06-24 21:21:18,211 INFO ]: Finished isEmpty. Found accepting run of length 845 [2018-06-24 21:21:18,211 INFO ]: Found error trace [2018-06-24 21:21:18,212 INFO ]: trace histogram [128, 57, 57, 57, 57, 57, 49, 21, 21, 21, 14, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:18,212 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:18,212 INFO ]: Analyzing trace with hash 1402471122, now seen corresponding path program 1 times [2018-06-24 21:21:18,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:18,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:18,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:18,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:18,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:18,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:19,460 INFO ]: Checked inductivity of 45607 backedges. 1298 proven. 366 refuted. 0 times theorem prover too weak. 43943 trivial. 0 not checked. [2018-06-24 21:21:19,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:19,461 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:19,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:20,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:20,884 INFO ]: Computing forward predicates... [2018-06-24 21:21:21,241 INFO ]: Checked inductivity of 45607 backedges. 22097 proven. 109 refuted. 0 times theorem prover too weak. 23401 trivial. 0 not checked. [2018-06-24 21:21:21,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:21,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-06-24 21:21:21,284 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:21:21,284 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:21:21,284 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:21,284 INFO ]: Start difference. First operand 753 states and 1704 transitions. Second operand 3 states. [2018-06-24 21:21:21,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:21,413 INFO ]: Finished difference Result 731 states and 1580 transitions. [2018-06-24 21:21:21,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:21:21,413 INFO ]: Start accepts. Automaton has 3 states. Word has length 844 [2018-06-24 21:21:21,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:21,427 INFO ]: With dead ends: 731 [2018-06-24 21:21:21,427 INFO ]: Without dead ends: 647 [2018-06-24 21:21:21,427 INFO ]: 0 DeclaredPredicates, 846 GetRequests, 844 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:21:21,428 INFO ]: Start minimizeSevpa. Operand 647 states. [2018-06-24 21:21:21,475 INFO ]: Finished minimizeSevpa. Reduced states from 647 to 647. [2018-06-24 21:21:21,475 INFO ]: Start removeUnreachable. Operand 647 states. [2018-06-24 21:21:21,484 INFO ]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1423 transitions. [2018-06-24 21:21:21,485 INFO ]: Start accepts. Automaton has 647 states and 1423 transitions. Word has length 844 [2018-06-24 21:21:21,485 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:21,485 INFO ]: Abstraction has 647 states and 1423 transitions. [2018-06-24 21:21:21,485 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:21:21,485 INFO ]: Start isEmpty. Operand 647 states and 1423 transitions. [2018-06-24 21:21:21,501 INFO ]: Finished isEmpty. Found accepting run of length 292 [2018-06-24 21:21:21,501 INFO ]: Found error trace [2018-06-24 21:21:21,502 INFO ]: trace histogram [44, 20, 20, 20, 20, 20, 17, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:21,502 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:21,502 INFO ]: Analyzing trace with hash -2039043747, now seen corresponding path program 1 times [2018-06-24 21:21:21,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:21,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:21,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:21,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:21,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:21,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:22,081 INFO ]: Checked inductivity of 5332 backedges. 688 proven. 502 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2018-06-24 21:21:22,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:22,081 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:22,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:22,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:22,465 INFO ]: Computing forward predicates... [2018-06-24 21:21:22,657 INFO ]: Checked inductivity of 5332 backedges. 969 proven. 217 refuted. 0 times theorem prover too weak. 4146 trivial. 0 not checked. [2018-06-24 21:21:22,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:21:22,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-24 21:21:22,680 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:21:22,680 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:21:22,680 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:21:22,680 INFO ]: Start difference. First operand 647 states and 1423 transitions. Second operand 20 states. [2018-06-24 21:21:34,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:21:34,002 INFO ]: Finished difference Result 3256 states and 10244 transitions. [2018-06-24 21:21:34,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-06-24 21:21:34,003 INFO ]: Start accepts. Automaton has 20 states. Word has length 291 [2018-06-24 21:21:34,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:21:34,072 INFO ]: With dead ends: 3256 [2018-06-24 21:21:34,072 INFO ]: Without dead ends: 2747 [2018-06-24 21:21:34,074 INFO ]: 0 DeclaredPredicates, 473 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1364, Invalid=12678, Unknown=0, NotChecked=0, Total=14042 [2018-06-24 21:21:34,075 INFO ]: Start minimizeSevpa. Operand 2747 states. [2018-06-24 21:21:34,332 INFO ]: Finished minimizeSevpa. Reduced states from 2747 to 1568. [2018-06-24 21:21:34,332 INFO ]: Start removeUnreachable. Operand 1568 states. [2018-06-24 21:21:34,363 INFO ]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4204 transitions. [2018-06-24 21:21:34,363 INFO ]: Start accepts. Automaton has 1568 states and 4204 transitions. Word has length 291 [2018-06-24 21:21:34,364 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:21:34,364 INFO ]: Abstraction has 1568 states and 4204 transitions. [2018-06-24 21:21:34,364 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:21:34,364 INFO ]: Start isEmpty. Operand 1568 states and 4204 transitions. [2018-06-24 21:21:34,424 INFO ]: Finished isEmpty. Found accepting run of length 1479 [2018-06-24 21:21:34,424 INFO ]: Found error trace [2018-06-24 21:21:34,424 INFO ]: trace histogram [213, 103, 103, 103, 103, 102, 92, 32, 32, 32, 24, 24, 24, 24, 19, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:21:34,424 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:21:34,425 INFO ]: Analyzing trace with hash 1918490166, now seen corresponding path program 1 times [2018-06-24 21:21:34,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:21:34,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:21:34,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:34,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:34,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:21:34,717 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 21:21:36,160 INFO ]: Checked inductivity of 139297 backedges. 2868 proven. 1218 refuted. 0 times theorem prover too weak. 135211 trivial. 0 not checked. [2018-06-24 21:21:36,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:21:36,160 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:36,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:21:38,143 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:21:38,219 INFO ]: Computing forward predicates... [2018-06-24 21:21:38,220 INFO ]: Timeout while computing interpolants [2018-06-24 21:21:38,422 WARN ]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:21:38,422 WARN ]: Verification canceled [2018-06-24 21:21:38,424 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:21:38,425 WARN ]: Timeout [2018-06-24 21:21:38,425 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:21:38 BasicIcfg [2018-06-24 21:21:38,425 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:21:38,425 INFO ]: Toolchain (without parser) took 54868.26 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 258.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 158.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,426 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:21:38,426 INFO ]: ChcToBoogie took 54.71 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,427 INFO ]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,427 INFO ]: RCFGBuilder took 686.07 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 229.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,428 INFO ]: BlockEncodingV2 took 754.54 ms. Allocated memory is still 308.8 MB. Free memory was 229.1 MB in the beginning and 207.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,428 INFO ]: TraceAbstraction took 53315.83 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 207.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 107.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:21:38,431 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 70 locations, 110 edges - StatisticsResult: Encoded RCFG 43 locations, 84 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.71 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 686.07 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 229.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 754.54 ms. Allocated memory is still 308.8 MB. Free memory was 229.1 MB in the beginning and 207.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53315.83 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 207.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 107.7 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 Cancelled while BasicCegarLoop was analyzing trace of length 1479 with TraceHistMax 213, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. TIMEOUT Result, 53.2s OverallTime, 22 OverallIterations, 213 TraceHistogramMax, 29.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2728 SDtfs, 1485 SDslu, 6679 SDs, 0 SdLazy, 25330 SolverSat, 6422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4056 GetRequests, 3801 SyntacticMatches, 3 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5147 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1568occurred in iteration=21, 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: 1.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 2541 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.7s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 7385 NumberOfCodeBlocks, 7385 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 7347 ConstructedInterpolants, 0 QuantifiedInterpolants, 4546261 SizeOfPredicates, 79 NumberOfNonLiveVariables, 42145 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 257141/260072 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/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-21-38-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-21-38-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-21-38-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-21-38-447.csv Completed graceful shutdown