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/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:44:45,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:44:45,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:44:45,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:44:45,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:44:45,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:44:45,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:44:45,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:44:45,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:44:45,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:44:45,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:44:45,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:44:45,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:44:45,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:44:45,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:44:45,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:44:45,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:44:45,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:44:45,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:44:45,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:44:45,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:44:45,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:44:45,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:44:45,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:44:45,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:44:45,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:44:45,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:44:45,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:44:45,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:44:45,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:44:45,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:44:45,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:44:45,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:44:45,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:44:45,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:44:45,261 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:44:45,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:44:45,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:44:45,284 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:44:45,286 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:44:45,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:44:45,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:44:45,288 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:44:45,288 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:44:45,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:44:45,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:44:45,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:44:45,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:44:45,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:44:45,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:44:45,289 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:44:45,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:44:45,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:44:45,291 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:44:45,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:44:45,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:44:45,291 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:44:45,292 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:44:45,293 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:44:45,338 INFO ]: Repository-Root is: /tmp [2018-06-24 20:44:45,355 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:44:45,362 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:44:45,363 INFO ]: Initializing SmtParser... [2018-06-24 20:44:45,363 INFO ]: SmtParser initialized [2018-06-24 20:44:45,364 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-24 20:44:45,364 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 20:44:45,438 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 unknown [2018-06-24 20:44:45,612 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-24 20:44:45,617 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:44:45,623 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:44:45,624 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:44:45,624 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:44:45,624 INFO ]: ChcToBoogie initialized [2018-06-24 20:44:45,627 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,686 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45 Unit [2018-06-24 20:44:45,686 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:44:45,687 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:44:45,687 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:44:45,687 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:44:45,707 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,707 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,714 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,714 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,717 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,719 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,720 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (1/1) ... [2018-06-24 20:44:45,722 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:44:45,723 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:44:45,723 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:44:45,723 INFO ]: RCFGBuilder initialized [2018-06-24 20:44:45,724 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (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 20:44:45,738 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:44:45,738 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:44:45,738 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:44:45,738 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:44:45,738 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:44:45,738 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 20:44:46,081 INFO ]: Using library mode [2018-06-24 20:44:46,082 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:44:46 BoogieIcfgContainer [2018-06-24 20:44:46,082 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:44:46,082 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:44:46,082 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:44:46,083 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:44:46,084 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:44:46" (1/1) ... [2018-06-24 20:44:46,099 INFO ]: Initial Icfg 13 locations, 18 edges [2018-06-24 20:44:46,100 INFO ]: Using Remove infeasible edges [2018-06-24 20:44:46,100 INFO ]: Using Maximize final states [2018-06-24 20:44:46,101 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:44:46,101 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:44:46,102 INFO ]: Using Remove sink states [2018-06-24 20:44:46,103 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:44:46,103 INFO ]: Using Use SBE [2018-06-24 20:44:46,135 INFO ]: SBE split 1 edges [2018-06-24 20:44:46,140 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:44:46,142 INFO ]: 0 new accepting states [2018-06-24 20:44:46,245 INFO ]: Removed 8 edges and 3 locations by large block encoding [2018-06-24 20:44:46,246 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:44:46,247 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:44:46,247 INFO ]: 0 new accepting states [2018-06-24 20:44:46,248 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:44:46,248 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:44:46,248 INFO ]: Encoded RCFG 8 locations, 14 edges [2018-06-24 20:44:46,249 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:44:46 BasicIcfg [2018-06-24 20:44:46,249 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:44:46,249 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:44:46,249 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:44:46,252 INFO ]: TraceAbstraction initialized [2018-06-24 20:44:46,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:44:45" (1/4) ... [2018-06-24 20:44:46,253 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19ed83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:44:46, skipping insertion in model container [2018-06-24 20:44:46,253 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:44:45" (2/4) ... [2018-06-24 20:44:46,253 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19ed83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:44:46, skipping insertion in model container [2018-06-24 20:44:46,253 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:44:46" (3/4) ... [2018-06-24 20:44:46,253 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19ed83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:44:46, skipping insertion in model container [2018-06-24 20:44:46,253 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:44:46" (4/4) ... [2018-06-24 20:44:46,255 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:44:46,263 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:44:46,272 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:44:46,317 INFO ]: Using default assertion order modulation [2018-06-24 20:44:46,317 INFO ]: Interprodecural is true [2018-06-24 20:44:46,317 INFO ]: Hoare is false [2018-06-24 20:44:46,317 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:44:46,317 INFO ]: Backedges is TWOTRACK [2018-06-24 20:44:46,317 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:44:46,317 INFO ]: Difference is false [2018-06-24 20:44:46,317 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:44:46,317 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:44:46,325 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:44:46,340 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:44:46,340 INFO ]: Found error trace [2018-06-24 20:44:46,341 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:46,341 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:46,346 INFO ]: Analyzing trace with hash -33242589, now seen corresponding path program 1 times [2018-06-24 20:44:46,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:46,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:46,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:46,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:46,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:46,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:46,559 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:46,561 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:44:46,561 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:44:46,562 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:44:46,575 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:44:46,576 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:44:46,578 INFO ]: Start difference. First operand 8 states. Second operand 5 states. [2018-06-24 20:44:46,906 WARN ]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 20:44:46,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:46,985 INFO ]: Finished difference Result 19 states and 36 transitions. [2018-06-24 20:44:46,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:44:46,986 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:44:46,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:46,996 INFO ]: With dead ends: 19 [2018-06-24 20:44:46,996 INFO ]: Without dead ends: 19 [2018-06-24 20:44:46,998 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:44:47,015 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:44:47,041 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-06-24 20:44:47,042 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:44:47,044 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-24 20:44:47,045 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 7 [2018-06-24 20:44:47,045 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:47,045 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-24 20:44:47,045 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:44:47,045 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-24 20:44:47,046 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:44:47,046 INFO ]: Found error trace [2018-06-24 20:44:47,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:47,046 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:47,046 INFO ]: Analyzing trace with hash -4613438, now seen corresponding path program 1 times [2018-06-24 20:44:47,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:47,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:47,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:47,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,066 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:47,320 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-24 20:44:47,407 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:47,407 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:44:47,407 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:44:47,409 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:44:47,409 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:44:47,409 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:44:47,409 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 5 states. [2018-06-24 20:44:47,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:47,754 INFO ]: Finished difference Result 20 states and 37 transitions. [2018-06-24 20:44:47,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:44:47,755 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:44:47,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:47,755 INFO ]: With dead ends: 20 [2018-06-24 20:44:47,755 INFO ]: Without dead ends: 20 [2018-06-24 20:44:47,756 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:44:47,756 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:44:47,758 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 10. [2018-06-24 20:44:47,758 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:44:47,759 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-06-24 20:44:47,759 INFO ]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-06-24 20:44:47,760 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:47,760 INFO ]: Abstraction has 10 states and 17 transitions. [2018-06-24 20:44:47,760 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:44:47,760 INFO ]: Start isEmpty. Operand 10 states and 17 transitions. [2018-06-24 20:44:47,760 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:44:47,760 INFO ]: Found error trace [2018-06-24 20:44:47,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:47,760 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:47,760 INFO ]: Analyzing trace with hash -973611654, now seen corresponding path program 1 times [2018-06-24 20:44:47,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:47,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:47,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:47,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,773 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:47,818 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:44:47,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:44:47,818 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:44:47,818 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:44:47,818 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:44:47,818 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:44:47,818 INFO ]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2018-06-24 20:44:47,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:47,860 INFO ]: Finished difference Result 13 states and 25 transitions. [2018-06-24 20:44:47,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:44:47,861 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 20:44:47,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:47,861 INFO ]: With dead ends: 13 [2018-06-24 20:44:47,861 INFO ]: Without dead ends: 13 [2018-06-24 20:44:47,862 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 20:44:47,862 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:44:47,863 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 20:44:47,863 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:44:47,864 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 20:44:47,864 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-24 20:44:47,864 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:47,864 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 20:44:47,864 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:44:47,864 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 20:44:47,864 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:44:47,864 INFO ]: Found error trace [2018-06-24 20:44:47,864 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:47,864 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:47,864 INFO ]: Analyzing trace with hash -944982503, now seen corresponding path program 1 times [2018-06-24 20:44:47,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:47,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:47,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:47,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:47,895 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:47,957 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:47,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:47,957 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 20:44:47,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:48,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:48,007 INFO ]: Computing forward predicates... [2018-06-24 20:44:48,057 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:48,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:48,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:44:48,077 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:44:48,077 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:44:48,078 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:44:48,078 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-06-24 20:44:48,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:48,456 INFO ]: Finished difference Result 19 states and 33 transitions. [2018-06-24 20:44:48,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:44:48,456 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:44:48,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:48,457 INFO ]: With dead ends: 19 [2018-06-24 20:44:48,457 INFO ]: Without dead ends: 19 [2018-06-24 20:44:48,457 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:44:48,457 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:44:48,459 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 20:44:48,459 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:44:48,459 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-06-24 20:44:48,459 INFO ]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-06-24 20:44:48,459 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:48,459 INFO ]: Abstraction has 14 states and 25 transitions. [2018-06-24 20:44:48,459 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:44:48,460 INFO ]: Start isEmpty. Operand 14 states and 25 transitions. [2018-06-24 20:44:48,460 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:44:48,460 INFO ]: Found error trace [2018-06-24 20:44:48,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:48,460 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:48,461 INFO ]: Analyzing trace with hash -143366275, now seen corresponding path program 1 times [2018-06-24 20:44:48,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:48,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:48,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:48,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:48,567 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:44:48,567 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:44:48,567 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:44:48,567 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:44:48,567 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:44:48,567 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:44:48,567 INFO ]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2018-06-24 20:44:48,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:48,617 INFO ]: Finished difference Result 24 states and 45 transitions. [2018-06-24 20:44:48,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:44:48,619 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 20:44:48,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:48,620 INFO ]: With dead ends: 24 [2018-06-24 20:44:48,620 INFO ]: Without dead ends: 24 [2018-06-24 20:44:48,620 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:44:48,620 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:44:48,623 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 14. [2018-06-24 20:44:48,623 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:44:48,624 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-06-24 20:44:48,624 INFO ]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-06-24 20:44:48,624 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:48,624 INFO ]: Abstraction has 14 states and 25 transitions. [2018-06-24 20:44:48,624 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:44:48,624 INFO ]: Start isEmpty. Operand 14 states and 25 transitions. [2018-06-24 20:44:48,624 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:44:48,624 INFO ]: Found error trace [2018-06-24 20:44:48,624 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:48,624 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:48,624 INFO ]: Analyzing trace with hash -57478822, now seen corresponding path program 1 times [2018-06-24 20:44:48,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:48,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:48,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:48,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,642 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:48,706 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:44:48,707 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:44:48,707 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:44:48,707 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:44:48,707 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:44:48,707 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:44:48,707 INFO ]: Start difference. First operand 14 states and 25 transitions. Second operand 5 states. [2018-06-24 20:44:48,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:48,772 INFO ]: Finished difference Result 27 states and 54 transitions. [2018-06-24 20:44:48,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:44:48,772 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:44:48,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:48,773 INFO ]: With dead ends: 27 [2018-06-24 20:44:48,773 INFO ]: Without dead ends: 24 [2018-06-24 20:44:48,773 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:44:48,773 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:44:48,775 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-06-24 20:44:48,775 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:44:48,776 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2018-06-24 20:44:48,776 INFO ]: Start accepts. Automaton has 16 states and 31 transitions. Word has length 8 [2018-06-24 20:44:48,776 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:48,776 INFO ]: Abstraction has 16 states and 31 transitions. [2018-06-24 20:44:48,776 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:44:48,776 INFO ]: Start isEmpty. Operand 16 states and 31 transitions. [2018-06-24 20:44:48,776 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:44:48,776 INFO ]: Found error trace [2018-06-24 20:44:48,776 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:48,776 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:48,776 INFO ]: Analyzing trace with hash -959129551, now seen corresponding path program 1 times [2018-06-24 20:44:48,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:48,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:48,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:48,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:48,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:48,889 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:48,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:48,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:48,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:48,923 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:48,925 INFO ]: Computing forward predicates... [2018-06-24 20:44:48,976 INFO ]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 20:44:49,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:49,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-06-24 20:44:49,001 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:44:49,001 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:44:49,001 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:44:49,001 INFO ]: Start difference. First operand 16 states and 31 transitions. Second operand 10 states. [2018-06-24 20:44:49,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:49,307 INFO ]: Finished difference Result 39 states and 63 transitions. [2018-06-24 20:44:49,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:44:49,307 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:44:49,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:49,308 INFO ]: With dead ends: 39 [2018-06-24 20:44:49,308 INFO ]: Without dead ends: 32 [2018-06-24 20:44:49,308 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:44:49,308 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:44:49,310 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 16. [2018-06-24 20:44:49,310 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:44:49,311 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2018-06-24 20:44:49,311 INFO ]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 10 [2018-06-24 20:44:49,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:49,311 INFO ]: Abstraction has 16 states and 25 transitions. [2018-06-24 20:44:49,311 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:44:49,311 INFO ]: Start isEmpty. Operand 16 states and 25 transitions. [2018-06-24 20:44:49,311 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:44:49,311 INFO ]: Found error trace [2018-06-24 20:44:49,311 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:49,311 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:49,312 INFO ]: Analyzing trace with hash 1207977169, now seen corresponding path program 1 times [2018-06-24 20:44:49,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:49,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:49,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:49,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:49,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:49,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:49,496 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:49,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:49,497 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 20:44:49,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:49,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:49,528 INFO ]: Computing forward predicates... [2018-06-24 20:44:49,538 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:44:49,559 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:44:49,559 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-06-24 20:44:49,559 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:44:49,559 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:44:49,559 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:44:49,559 INFO ]: Start difference. First operand 16 states and 25 transitions. Second operand 10 states. [2018-06-24 20:44:49,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:49,945 INFO ]: Finished difference Result 35 states and 53 transitions. [2018-06-24 20:44:49,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:44:49,946 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:44:49,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:49,947 INFO ]: With dead ends: 35 [2018-06-24 20:44:49,947 INFO ]: Without dead ends: 35 [2018-06-24 20:44:49,947 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:44:49,947 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:44:49,950 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-06-24 20:44:49,950 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:44:49,950 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2018-06-24 20:44:49,950 INFO ]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 11 [2018-06-24 20:44:49,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:49,950 INFO ]: Abstraction has 22 states and 35 transitions. [2018-06-24 20:44:49,950 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:44:49,950 INFO ]: Start isEmpty. Operand 22 states and 35 transitions. [2018-06-24 20:44:49,951 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:44:49,951 INFO ]: Found error trace [2018-06-24 20:44:49,951 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:49,951 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:49,951 INFO ]: Analyzing trace with hash -795990799, now seen corresponding path program 1 times [2018-06-24 20:44:49,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:49,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:49,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:49,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:49,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:49,969 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:50,117 INFO ]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:50,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:50,117 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 20:44:50,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:50,143 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:50,146 INFO ]: Computing forward predicates... [2018-06-24 20:44:50,330 INFO ]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:44:50,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:50,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-24 20:44:50,350 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:44:50,350 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:44:50,350 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:44:50,350 INFO ]: Start difference. First operand 22 states and 35 transitions. Second operand 14 states. [2018-06-24 20:44:50,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:50,795 INFO ]: Finished difference Result 44 states and 67 transitions. [2018-06-24 20:44:50,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:44:50,797 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-24 20:44:50,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:50,798 INFO ]: With dead ends: 44 [2018-06-24 20:44:50,798 INFO ]: Without dead ends: 37 [2018-06-24 20:44:50,799 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:44:50,799 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:44:50,801 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-06-24 20:44:50,802 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:44:50,803 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2018-06-24 20:44:50,803 INFO ]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 11 [2018-06-24 20:44:50,803 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:50,803 INFO ]: Abstraction has 28 states and 45 transitions. [2018-06-24 20:44:50,803 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:44:50,803 INFO ]: Start isEmpty. Operand 28 states and 45 transitions. [2018-06-24 20:44:50,804 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:44:50,804 INFO ]: Found error trace [2018-06-24 20:44:50,804 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:50,804 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:50,804 INFO ]: Analyzing trace with hash 1279749711, now seen corresponding path program 1 times [2018-06-24 20:44:50,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:50,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:50,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:50,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:50,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:50,816 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:50,854 INFO ]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:44:50,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:50,855 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:50,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:50,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:50,913 INFO ]: Computing forward predicates... [2018-06-24 20:44:50,964 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 20:44:50,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:50,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 20:44:50,984 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:44:50,984 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:44:50,984 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:44:50,984 INFO ]: Start difference. First operand 28 states and 45 transitions. Second operand 8 states. [2018-06-24 20:44:51,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:51,023 INFO ]: Finished difference Result 42 states and 66 transitions. [2018-06-24 20:44:51,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:44:51,023 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-24 20:44:51,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:51,024 INFO ]: With dead ends: 42 [2018-06-24 20:44:51,024 INFO ]: Without dead ends: 36 [2018-06-24 20:44:51,024 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:44:51,024 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:44:51,027 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 23. [2018-06-24 20:44:51,027 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:44:51,028 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2018-06-24 20:44:51,028 INFO ]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 12 [2018-06-24 20:44:51,028 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:51,028 INFO ]: Abstraction has 23 states and 34 transitions. [2018-06-24 20:44:51,028 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:44:51,028 INFO ]: Start isEmpty. Operand 23 states and 34 transitions. [2018-06-24 20:44:51,029 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:44:51,029 INFO ]: Found error trace [2018-06-24 20:44:51,029 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:51,029 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:51,029 INFO ]: Analyzing trace with hash 2051691261, now seen corresponding path program 2 times [2018-06-24 20:44:51,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:51,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:51,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:51,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:51,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:51,044 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:51,177 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:51,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:51,177 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 20:44:51,186 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:44:51,240 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:44:51,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:51,243 INFO ]: Computing forward predicates... [2018-06-24 20:44:51,255 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:51,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:51,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:44:51,290 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:44:51,290 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:44:51,290 INFO ]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:44:51,290 INFO ]: Start difference. First operand 23 states and 34 transitions. Second operand 11 states. [2018-06-24 20:44:51,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:51,504 INFO ]: Finished difference Result 54 states and 76 transitions. [2018-06-24 20:44:51,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:44:51,505 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:44:51,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:51,505 INFO ]: With dead ends: 54 [2018-06-24 20:44:51,505 INFO ]: Without dead ends: 54 [2018-06-24 20:44:51,506 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:44:51,506 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:44:51,509 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 15. [2018-06-24 20:44:51,509 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:44:51,509 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-24 20:44:51,509 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 13 [2018-06-24 20:44:51,509 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:51,509 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-24 20:44:51,509 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:44:51,510 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-24 20:44:51,510 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:44:51,510 INFO ]: Found error trace [2018-06-24 20:44:51,510 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:51,510 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:51,510 INFO ]: Analyzing trace with hash -529027039, now seen corresponding path program 1 times [2018-06-24 20:44:51,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:51,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:51,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:51,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:51,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:51,521 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:51,681 INFO ]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:51,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:51,681 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 20:44:51,695 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 20:44:51,738 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:51,741 INFO ]: Computing forward predicates... [2018-06-24 20:44:51,802 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:51,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:51,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:44:51,834 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:44:51,834 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:44:51,834 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:44:51,834 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. [2018-06-24 20:44:52,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:52,058 INFO ]: Finished difference Result 44 states and 61 transitions. [2018-06-24 20:44:52,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:44:52,058 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:44:52,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:52,059 INFO ]: With dead ends: 44 [2018-06-24 20:44:52,059 INFO ]: Without dead ends: 44 [2018-06-24 20:44:52,060 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:44:52,060 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:44:52,063 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-06-24 20:44:52,063 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:44:52,063 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-06-24 20:44:52,063 INFO ]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 14 [2018-06-24 20:44:52,063 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:52,063 INFO ]: Abstraction has 28 states and 42 transitions. [2018-06-24 20:44:52,063 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:44:52,063 INFO ]: Start isEmpty. Operand 28 states and 42 transitions. [2018-06-24 20:44:52,065 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:44:52,065 INFO ]: Found error trace [2018-06-24 20:44:52,065 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:52,065 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:52,065 INFO ]: Analyzing trace with hash -822430046, now seen corresponding path program 3 times [2018-06-24 20:44:52,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:52,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:52,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:52,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:52,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:52,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:52,294 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:44:52,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:52,295 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:52,300 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:44:52,328 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:44:52,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:52,332 INFO ]: Computing forward predicates... [2018-06-24 20:44:52,438 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:44:52,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:52,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 20:44:52,458 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:44:52,458 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:44:52,458 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:44:52,458 INFO ]: Start difference. First operand 28 states and 42 transitions. Second operand 10 states. [2018-06-24 20:44:52,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:52,729 INFO ]: Finished difference Result 45 states and 67 transitions. [2018-06-24 20:44:52,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:44:52,729 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-24 20:44:52,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:52,729 INFO ]: With dead ends: 45 [2018-06-24 20:44:52,729 INFO ]: Without dead ends: 40 [2018-06-24 20:44:52,730 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:44:52,730 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:44:52,732 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-06-24 20:44:52,732 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:44:52,733 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2018-06-24 20:44:52,733 INFO ]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 14 [2018-06-24 20:44:52,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:52,733 INFO ]: Abstraction has 32 states and 48 transitions. [2018-06-24 20:44:52,733 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:44:52,733 INFO ]: Start isEmpty. Operand 32 states and 48 transitions. [2018-06-24 20:44:52,734 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:44:52,734 INFO ]: Found error trace [2018-06-24 20:44:52,734 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:52,734 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:52,734 INFO ]: Analyzing trace with hash 279788822, now seen corresponding path program 4 times [2018-06-24 20:44:52,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:52,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:52,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:52,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:52,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:52,746 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:53,197 INFO ]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:53,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:53,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:53,203 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:44:53,232 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:44:53,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:53,235 INFO ]: Computing forward predicates... [2018-06-24 20:44:53,248 INFO ]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:53,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:53,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:44:53,268 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:44:53,269 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:44:53,269 INFO ]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:44:53,269 INFO ]: Start difference. First operand 32 states and 48 transitions. Second operand 14 states. [2018-06-24 20:44:53,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:53,559 INFO ]: Finished difference Result 82 states and 115 transitions. [2018-06-24 20:44:53,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:44:53,561 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:44:53,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:53,562 INFO ]: With dead ends: 82 [2018-06-24 20:44:53,562 INFO ]: Without dead ends: 82 [2018-06-24 20:44:53,562 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=627, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:44:53,563 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 20:44:53,566 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 18. [2018-06-24 20:44:53,566 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:44:53,566 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-24 20:44:53,566 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 16 [2018-06-24 20:44:53,566 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:53,566 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-24 20:44:53,566 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:44:53,566 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-24 20:44:53,566 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:44:53,566 INFO ]: Found error trace [2018-06-24 20:44:53,566 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:53,567 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:53,567 INFO ]: Analyzing trace with hash 593703370, now seen corresponding path program 2 times [2018-06-24 20:44:53,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:53,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:53,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:53,567 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:53,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:53,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:53,698 INFO ]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:53,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:53,698 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:53,705 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:44:53,733 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:44:53,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:53,736 INFO ]: Computing forward predicates... [2018-06-24 20:44:53,806 INFO ]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:53,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:53,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 20:44:53,825 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:44:53,825 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:44:53,825 INFO ]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:44:53,825 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 16 states. [2018-06-24 20:44:54,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:54,145 INFO ]: Finished difference Result 64 states and 88 transitions. [2018-06-24 20:44:54,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:44:54,147 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:44:54,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:54,148 INFO ]: With dead ends: 64 [2018-06-24 20:44:54,148 INFO ]: Without dead ends: 64 [2018-06-24 20:44:54,148 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=412, Invalid=920, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:44:54,148 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:44:54,151 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 39. [2018-06-24 20:44:54,151 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:44:54,152 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2018-06-24 20:44:54,152 INFO ]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 17 [2018-06-24 20:44:54,152 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:54,152 INFO ]: Abstraction has 39 states and 59 transitions. [2018-06-24 20:44:54,152 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:44:54,152 INFO ]: Start isEmpty. Operand 39 states and 59 transitions. [2018-06-24 20:44:54,152 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:44:54,152 INFO ]: Found error trace [2018-06-24 20:44:54,153 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:54,153 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:54,153 INFO ]: Analyzing trace with hash 83169193, now seen corresponding path program 5 times [2018-06-24 20:44:54,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:54,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:54,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:54,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:54,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:54,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:54,477 INFO ]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:44:54,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:54,477 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 20:44:54,486 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:44:54,517 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:44:54,517 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:54,523 INFO ]: Computing forward predicates... [2018-06-24 20:44:54,595 INFO ]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:44:54,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:54,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:44:54,615 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:44:54,615 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:44:54,615 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:44:54,615 INFO ]: Start difference. First operand 39 states and 59 transitions. Second operand 12 states. [2018-06-24 20:44:54,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:54,854 INFO ]: Finished difference Result 60 states and 90 transitions. [2018-06-24 20:44:54,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:44:54,854 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-24 20:44:54,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:54,854 INFO ]: With dead ends: 60 [2018-06-24 20:44:54,854 INFO ]: Without dead ends: 54 [2018-06-24 20:44:54,854 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:44:54,854 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:44:54,857 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 43. [2018-06-24 20:44:54,857 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:44:54,857 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2018-06-24 20:44:54,857 INFO ]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 17 [2018-06-24 20:44:54,857 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:54,857 INFO ]: Abstraction has 43 states and 65 transitions. [2018-06-24 20:44:54,857 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:44:54,858 INFO ]: Start isEmpty. Operand 43 states and 65 transitions. [2018-06-24 20:44:54,858 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:44:54,858 INFO ]: Found error trace [2018-06-24 20:44:54,858 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:54,858 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:54,858 INFO ]: Analyzing trace with hash 1260487861, now seen corresponding path program 6 times [2018-06-24 20:44:54,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:54,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:54,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:54,859 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:54,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:54,872 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:55,034 INFO ]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:55,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:55,034 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 20:44:55,040 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:44:55,110 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:44:55,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:55,114 INFO ]: Computing forward predicates... [2018-06-24 20:44:55,131 INFO ]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:55,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:55,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:44:55,163 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:44:55,163 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:44:55,163 INFO ]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:44:55,163 INFO ]: Start difference. First operand 43 states and 65 transitions. Second operand 17 states. [2018-06-24 20:44:55,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:55,788 INFO ]: Finished difference Result 116 states and 162 transitions. [2018-06-24 20:44:55,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:44:55,788 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:44:55,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:55,789 INFO ]: With dead ends: 116 [2018-06-24 20:44:55,789 INFO ]: Without dead ends: 116 [2018-06-24 20:44:55,789 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=529, Invalid=1111, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:44:55,789 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-24 20:44:55,792 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 21. [2018-06-24 20:44:55,792 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:44:55,792 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-24 20:44:55,792 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 19 [2018-06-24 20:44:55,792 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:55,792 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-24 20:44:55,792 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:44:55,792 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-24 20:44:55,793 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:44:55,793 INFO ]: Found error trace [2018-06-24 20:44:55,793 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:55,793 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:55,793 INFO ]: Analyzing trace with hash 1264540201, now seen corresponding path program 3 times [2018-06-24 20:44:55,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:55,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:55,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:55,794 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:55,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:55,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:56,239 INFO ]: Checked inductivity of 35 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:56,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:56,239 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:56,244 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:44:56,285 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:44:56,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:56,288 INFO ]: Computing forward predicates... [2018-06-24 20:44:56,357 INFO ]: Checked inductivity of 35 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:56,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:56,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:44:56,383 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:44:56,384 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:44:56,384 INFO ]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:44:56,384 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 19 states. [2018-06-24 20:44:57,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:57,343 INFO ]: Finished difference Result 88 states and 120 transitions. [2018-06-24 20:44:57,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:44:57,344 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:44:57,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:57,345 INFO ]: With dead ends: 88 [2018-06-24 20:44:57,345 INFO ]: Without dead ends: 88 [2018-06-24 20:44:57,345 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=696, Invalid=1560, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:44:57,345 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-24 20:44:57,348 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 52. [2018-06-24 20:44:57,348 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 20:44:57,351 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2018-06-24 20:44:57,351 INFO ]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 20 [2018-06-24 20:44:57,351 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:57,351 INFO ]: Abstraction has 52 states and 79 transitions. [2018-06-24 20:44:57,351 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:44:57,351 INFO ]: Start isEmpty. Operand 52 states and 79 transitions. [2018-06-24 20:44:57,352 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:44:57,352 INFO ]: Found error trace [2018-06-24 20:44:57,352 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:57,352 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:57,352 INFO ]: Analyzing trace with hash 420068330, now seen corresponding path program 7 times [2018-06-24 20:44:57,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:57,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:57,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:57,353 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:57,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:57,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:57,763 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:44:57,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:57,763 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 20:44:57,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:57,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:57,808 INFO ]: Computing forward predicates... [2018-06-24 20:44:57,972 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:44:57,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:57,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:44:57,997 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:44:57,997 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:44:57,997 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:44:57,997 INFO ]: Start difference. First operand 52 states and 79 transitions. Second operand 14 states. [2018-06-24 20:44:58,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:58,271 INFO ]: Finished difference Result 77 states and 116 transitions. [2018-06-24 20:44:58,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:44:58,272 INFO ]: Start accepts. Automaton has 14 states. Word has length 20 [2018-06-24 20:44:58,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:58,272 INFO ]: With dead ends: 77 [2018-06-24 20:44:58,272 INFO ]: Without dead ends: 70 [2018-06-24 20:44:58,272 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:44:58,272 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 20:44:58,274 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-06-24 20:44:58,274 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 20:44:58,275 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2018-06-24 20:44:58,275 INFO ]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 20 [2018-06-24 20:44:58,275 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:58,275 INFO ]: Abstraction has 56 states and 85 transitions. [2018-06-24 20:44:58,275 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:44:58,275 INFO ]: Start isEmpty. Operand 56 states and 85 transitions. [2018-06-24 20:44:58,276 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:44:58,276 INFO ]: Found error trace [2018-06-24 20:44:58,276 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:58,276 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:58,276 INFO ]: Analyzing trace with hash 1217567582, now seen corresponding path program 8 times [2018-06-24 20:44:58,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:58,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:58,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:58,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:44:58,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:58,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:58,603 INFO ]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:58,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:44:58,603 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:44:58,609 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:44:58,649 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:44:58,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:44:58,652 INFO ]: Computing forward predicates... [2018-06-24 20:44:58,674 INFO ]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:44:58,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:44:58,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:44:58,702 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:44:58,702 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:44:58,702 INFO ]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:44:58,702 INFO ]: Start difference. First operand 56 states and 85 transitions. Second operand 20 states. [2018-06-24 20:44:59,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:44:59,250 INFO ]: Finished difference Result 156 states and 217 transitions. [2018-06-24 20:44:59,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:44:59,250 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:44:59,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:44:59,251 INFO ]: With dead ends: 156 [2018-06-24 20:44:59,251 INFO ]: Without dead ends: 156 [2018-06-24 20:44:59,251 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=852, Invalid=1800, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:44:59,251 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-24 20:44:59,254 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 24. [2018-06-24 20:44:59,254 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:44:59,255 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-06-24 20:44:59,255 INFO ]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 22 [2018-06-24 20:44:59,255 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:44:59,255 INFO ]: Abstraction has 24 states and 32 transitions. [2018-06-24 20:44:59,255 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:44:59,255 INFO ]: Start isEmpty. Operand 24 states and 32 transitions. [2018-06-24 20:44:59,255 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:44:59,255 INFO ]: Found error trace [2018-06-24 20:44:59,255 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:44:59,256 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:44:59,256 INFO ]: Analyzing trace with hash 1127595970, now seen corresponding path program 4 times [2018-06-24 20:44:59,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:44:59,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:44:59,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:59,256 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:44:59,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:44:59,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:00,180 INFO ]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:00,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:00,180 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 20:45:00,188 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:45:00,232 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:45:00,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:00,235 INFO ]: Computing forward predicates... [2018-06-24 20:45:00,325 INFO ]: Checked inductivity of 51 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:00,357 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:00,357 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 20:45:00,357 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:45:00,357 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:45:00,357 INFO ]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:45:00,358 INFO ]: Start difference. First operand 24 states and 32 transitions. Second operand 22 states. [2018-06-24 20:45:01,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:01,019 INFO ]: Finished difference Result 116 states and 157 transitions. [2018-06-24 20:45:01,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:45:01,059 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-24 20:45:01,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:01,059 INFO ]: With dead ends: 116 [2018-06-24 20:45:01,059 INFO ]: Without dead ends: 116 [2018-06-24 20:45:01,060 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1094, Invalid=2446, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:45:01,060 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-24 20:45:01,067 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 67. [2018-06-24 20:45:01,067 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:45:01,068 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions. [2018-06-24 20:45:01,068 INFO ]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 23 [2018-06-24 20:45:01,068 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:01,068 INFO ]: Abstraction has 67 states and 102 transitions. [2018-06-24 20:45:01,068 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:45:01,068 INFO ]: Start isEmpty. Operand 67 states and 102 transitions. [2018-06-24 20:45:01,069 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:45:01,069 INFO ]: Found error trace [2018-06-24 20:45:01,069 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:01,069 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:01,069 INFO ]: Analyzing trace with hash -910460319, now seen corresponding path program 9 times [2018-06-24 20:45:01,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:01,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:01,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:01,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:01,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:01,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:01,358 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:45:01,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:01,358 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 20:45:01,371 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:45:01,419 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:45:01,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:01,429 INFO ]: Computing forward predicates... [2018-06-24 20:45:03,444 INFO ]: Checked inductivity of 51 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:03,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:03,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-06-24 20:45:03,475 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:45:03,475 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:45:03,475 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:45:03,475 INFO ]: Start difference. First operand 67 states and 102 transitions. Second operand 34 states. [2018-06-24 20:45:07,289 WARN ]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 76 [2018-06-24 20:45:09,785 WARN ]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 79 [2018-06-24 20:45:11,653 WARN ]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-06-24 20:45:13,660 WARN ]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 136 [2018-06-24 20:45:14,193 WARN ]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-06-24 20:45:15,179 WARN ]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-06-24 20:45:15,367 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-06-24 20:45:17,192 WARN ]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 136 [2018-06-24 20:45:19,226 WARN ]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 136 [2018-06-24 20:45:21,193 WARN ]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 136 [2018-06-24 20:45:22,846 WARN ]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 116 [2018-06-24 20:45:23,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:23,513 INFO ]: Finished difference Result 123 states and 175 transitions. [2018-06-24 20:45:23,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-24 20:45:23,514 INFO ]: Start accepts. Automaton has 34 states. Word has length 23 [2018-06-24 20:45:23,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:23,515 INFO ]: With dead ends: 123 [2018-06-24 20:45:23,515 INFO ]: Without dead ends: 107 [2018-06-24 20:45:23,516 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=838, Invalid=4712, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 20:45:23,516 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-24 20:45:23,518 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 27. [2018-06-24 20:45:23,518 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:45:23,518 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-24 20:45:23,518 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 23 [2018-06-24 20:45:23,518 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:23,518 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-24 20:45:23,518 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:45:23,518 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-24 20:45:23,519 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:45:23,519 INFO ]: Found error trace [2018-06-24 20:45:23,519 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:23,519 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:23,519 INFO ]: Analyzing trace with hash 1642214449, now seen corresponding path program 5 times [2018-06-24 20:45:23,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:23,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:23,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:23,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:23,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:23,535 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:23,862 INFO ]: Checked inductivity of 70 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:23,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:23,862 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 20:45:23,870 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:45:23,925 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:45:23,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:23,930 INFO ]: Computing forward predicates... [2018-06-24 20:45:23,957 INFO ]: Checked inductivity of 70 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:23,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:23,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:45:23,990 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:45:23,991 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:45:23,991 INFO ]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:45:23,991 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 25 states. [2018-06-24 20:45:26,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:26,368 INFO ]: Finished difference Result 148 states and 199 transitions. [2018-06-24 20:45:26,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-24 20:45:26,368 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:45:26,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:26,369 INFO ]: With dead ends: 148 [2018-06-24 20:45:26,369 INFO ]: Without dead ends: 148 [2018-06-24 20:45:26,371 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1630, Invalid=3626, Unknown=0, NotChecked=0, Total=5256 [2018-06-24 20:45:26,371 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 20:45:26,375 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 84. [2018-06-24 20:45:26,375 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 20:45:26,375 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2018-06-24 20:45:26,376 INFO ]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 26 [2018-06-24 20:45:26,376 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:26,376 INFO ]: Abstraction has 84 states and 128 transitions. [2018-06-24 20:45:26,376 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:45:26,376 INFO ]: Start isEmpty. Operand 84 states and 128 transitions. [2018-06-24 20:45:26,377 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:45:26,377 INFO ]: Found error trace [2018-06-24 20:45:26,377 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:26,377 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:26,377 INFO ]: Analyzing trace with hash -434994894, now seen corresponding path program 10 times [2018-06-24 20:45:26,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:26,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:26,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:26,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:26,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:26,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,905 INFO ]: Checked inductivity of 70 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:45:26,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:26,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:26,910 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:45:26,974 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:45:26,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,982 INFO ]: Computing forward predicates... [2018-06-24 20:45:27,082 INFO ]: Checked inductivity of 70 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:45:27,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:27,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:45:27,102 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:45:27,102 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:45:27,102 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:45:27,103 INFO ]: Start difference. First operand 84 states and 128 transitions. Second operand 18 states. [2018-06-24 20:45:27,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:27,578 INFO ]: Finished difference Result 117 states and 177 transitions. [2018-06-24 20:45:27,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:45:27,579 INFO ]: Start accepts. Automaton has 18 states. Word has length 26 [2018-06-24 20:45:27,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:27,579 INFO ]: With dead ends: 117 [2018-06-24 20:45:27,579 INFO ]: Without dead ends: 108 [2018-06-24 20:45:27,580 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:45:27,580 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 20:45:27,582 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 88. [2018-06-24 20:45:27,582 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-24 20:45:27,583 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2018-06-24 20:45:27,583 INFO ]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 26 [2018-06-24 20:45:27,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:27,583 INFO ]: Abstraction has 88 states and 134 transitions. [2018-06-24 20:45:27,583 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:45:27,583 INFO ]: Start isEmpty. Operand 88 states and 134 transitions. [2018-06-24 20:45:27,586 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:45:27,586 INFO ]: Found error trace [2018-06-24 20:45:27,586 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:27,586 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:27,586 INFO ]: Analyzing trace with hash -712312410, now seen corresponding path program 11 times [2018-06-24 20:45:27,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:27,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:27,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:27,587 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:27,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:27,603 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:27,924 INFO ]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:27,924 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:27,924 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:27,934 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:45:28,011 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:45:28,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:28,016 INFO ]: Computing forward predicates... [2018-06-24 20:45:28,329 INFO ]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:28,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:28,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 41 [2018-06-24 20:45:28,361 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:45:28,361 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:45:28,362 INFO ]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:45:28,362 INFO ]: Start difference. First operand 88 states and 134 transitions. Second operand 41 states. [2018-06-24 20:45:33,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:33,323 INFO ]: Finished difference Result 255 states and 352 transitions. [2018-06-24 20:45:33,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-06-24 20:45:33,323 INFO ]: Start accepts. Automaton has 41 states. Word has length 28 [2018-06-24 20:45:33,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:33,324 INFO ]: With dead ends: 255 [2018-06-24 20:45:33,324 INFO ]: Without dead ends: 255 [2018-06-24 20:45:33,330 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11950 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=12702, Invalid=27098, Unknown=0, NotChecked=0, Total=39800 [2018-06-24 20:45:33,331 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-24 20:45:33,335 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 30. [2018-06-24 20:45:33,335 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:45:33,335 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2018-06-24 20:45:33,335 INFO ]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 28 [2018-06-24 20:45:33,336 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:33,336 INFO ]: Abstraction has 30 states and 40 transitions. [2018-06-24 20:45:33,336 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:45:33,336 INFO ]: Start isEmpty. Operand 30 states and 40 transitions. [2018-06-24 20:45:33,336 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:45:33,336 INFO ]: Found error trace [2018-06-24 20:45:33,336 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:33,336 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:33,336 INFO ]: Analyzing trace with hash -352461382, now seen corresponding path program 6 times [2018-06-24 20:45:33,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:33,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:33,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:33,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:33,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:33,356 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:33,826 INFO ]: Checked inductivity of 92 backedges. 49 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:33,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:33,826 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:33,834 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:45:33,891 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:45:33,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:33,896 INFO ]: Computing forward predicates... [2018-06-24 20:45:33,931 INFO ]: Checked inductivity of 92 backedges. 56 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:33,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:33,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 20:45:33,951 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:45:33,951 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:45:33,951 INFO ]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:45:33,951 INFO ]: Start difference. First operand 30 states and 40 transitions. Second operand 28 states. [2018-06-24 20:45:35,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:35,058 INFO ]: Finished difference Result 184 states and 246 transitions. [2018-06-24 20:45:35,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-24 20:45:35,058 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:45:35,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:35,059 INFO ]: With dead ends: 184 [2018-06-24 20:45:35,059 INFO ]: Without dead ends: 184 [2018-06-24 20:45:35,060 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2330, Invalid=5152, Unknown=0, NotChecked=0, Total=7482 [2018-06-24 20:45:35,060 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-24 20:45:35,065 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 103. [2018-06-24 20:45:35,065 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-24 20:45:35,065 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2018-06-24 20:45:35,065 INFO ]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 29 [2018-06-24 20:45:35,066 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:35,066 INFO ]: Abstraction has 103 states and 157 transitions. [2018-06-24 20:45:35,066 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:45:35,068 INFO ]: Start isEmpty. Operand 103 states and 157 transitions. [2018-06-24 20:45:35,068 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:45:35,068 INFO ]: Found error trace [2018-06-24 20:45:35,068 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:35,068 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:35,069 INFO ]: Analyzing trace with hash -607197927, now seen corresponding path program 12 times [2018-06-24 20:45:35,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:35,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:35,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:35,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:35,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:35,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:35,983 INFO ]: Checked inductivity of 92 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:45:35,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:35,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:35,988 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:45:36,052 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:45:36,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:36,065 INFO ]: Computing forward predicates... [2018-06-24 20:45:47,965 INFO ]: Checked inductivity of 92 backedges. 50 proven. 36 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:47,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:47,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 44 [2018-06-24 20:45:47,984 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:45:47,984 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:45:47,984 INFO ]: CoverageRelationStatistics Valid=178, Invalid=1708, Unknown=6, NotChecked=0, Total=1892 [2018-06-24 20:45:47,984 INFO ]: Start difference. First operand 103 states and 157 transitions. Second operand 44 states. [2018-06-24 20:45:51,032 WARN ]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 69 Received shutdown request... [2018-06-24 20:45:52,606 WARN ]: Removed 6 from assertion stack [2018-06-24 20:45:52,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:45:52,607 WARN ]: Verification canceled [2018-06-24 20:45:52,608 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:45:52,609 WARN ]: Timeout [2018-06-24 20:45:52,609 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:45:52 BasicIcfg [2018-06-24 20:45:52,609 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:45:52,610 INFO ]: Toolchain (without parser) took 66992.13 ms. Allocated memory was 304.1 MB in the beginning and 833.1 MB in the end (delta: 529.0 MB). Free memory was 258.4 MB in the beginning and 537.9 MB in the end (delta: -279.4 MB). Peak memory consumption was 249.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,610 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:45:52,610 INFO ]: ChcToBoogie took 62.40 ms. Allocated memory is still 304.1 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,613 INFO ]: Boogie Preprocessor took 35.73 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,613 INFO ]: RCFGBuilder took 358.74 ms. Allocated memory is still 304.1 MB. Free memory was 254.4 MB in the beginning and 244.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,613 INFO ]: BlockEncodingV2 took 166.49 ms. Allocated memory is still 304.1 MB. Free memory was 244.4 MB in the beginning and 239.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,614 INFO ]: TraceAbstraction took 66359.89 ms. Allocated memory was 304.1 MB in the beginning and 833.1 MB in the end (delta: 529.0 MB). Free memory was 239.4 MB in the beginning and 537.9 MB in the end (delta: -298.4 MB). Peak memory consumption was 230.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:45:52,615 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 18 edges - StatisticsResult: Encoded RCFG 8 locations, 14 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.40 ms. Allocated memory is still 304.1 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.73 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 358.74 ms. Allocated memory is still 304.1 MB. Free memory was 254.4 MB in the beginning and 244.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 166.49 ms. Allocated memory is still 304.1 MB. Free memory was 244.4 MB in the beginning and 239.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66359.89 ms. Allocated memory was 304.1 MB in the beginning and 833.1 MB in the end (delta: 529.0 MB). Free memory was 239.4 MB in the beginning and 537.9 MB in the end (delta: -298.4 MB). Peak memory consumption was 230.6 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 constructing difference of abstraction (103states) and interpolant automaton (currently 19 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 66.3s OverallTime, 27 OverallIterations, 8 TraceHistogramMax, 40.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 856 SDslu, 1819 SDs, 0 SdLazy, 6143 SolverSat, 2426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 381 SyntacticMatches, 13 SemanticMatches, 965 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18639 ImplicationChecksByTransitivity, 51.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 805 ConstructedInterpolants, 42 QuantifiedInterpolants, 150652 SizeOfPredicates, 879 NumberOfNonLiveVariables, 7099 ConjunctsInSsa, 2088 ConjunctsInUnsatCore, 49 InterpolantComputations, 6 PerfectInterpolantSequences, 838/1547 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/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-45-52-625.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-45-52-625.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-45-52-625.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-45-52-625.csv Completed graceful shutdown