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/reve/003-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:56:24,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:56:24,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:56:24,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:56:24,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:56:24,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:56:24,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:56:24,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:56:24,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:56:24,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:56:24,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:56:24,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:56:24,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:56:24,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:56:24,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:56:24,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:56:24,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:56:24,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:56:24,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:56:24,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:56:24,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:56:24,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:56:24,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:56:24,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:56:24,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:56:24,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:56:24,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:56:24,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:56:24,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:56:24,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:56:24,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:56:24,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:56:24,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:56:24,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:56:24,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:56:24,990 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:56:25,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:56:25,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:56:25,005 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:56:25,005 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:56:25,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:56:25,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:56:25,006 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:56:25,006 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:56:25,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:56:25,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:56:25,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:56:25,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:56:25,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:56:25,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:56:25,008 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:56:25,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:56:25,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:56:25,008 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:56:25,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:56:25,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:56:25,009 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:56:25,010 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:56:25,010 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:56:25,068 INFO ]: Repository-Root is: /tmp [2018-06-24 20:56:25,089 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:56:25,099 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:56:25,101 INFO ]: Initializing SmtParser... [2018-06-24 20:56:25,101 INFO ]: SmtParser initialized [2018-06-24 20:56:25,102 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-24 20:56:25,103 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:56:25,197 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 unknown [2018-06-24 20:56:25,398 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-24 20:56:25,403 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:56:25,410 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:56:25,410 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:56:25,410 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:56:25,410 INFO ]: ChcToBoogie initialized [2018-06-24 20:56:25,414 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,479 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25 Unit [2018-06-24 20:56:25,479 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:56:25,480 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:56:25,480 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:56:25,480 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:56:25,506 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,506 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,512 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,512 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,515 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,517 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,525 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,527 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:56:25,528 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:56:25,528 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:56:25,528 INFO ]: RCFGBuilder initialized [2018-06-24 20:56:25,529 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (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:56:25,550 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:56:25,550 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:56:25,550 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:56:25,551 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:56:25,551 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:56:25,551 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:56:25,819 INFO ]: Using library mode [2018-06-24 20:56:25,819 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:56:25 BoogieIcfgContainer [2018-06-24 20:56:25,819 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:56:25,820 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:56:25,820 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:56:25,827 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:56:25,828 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:56:25" (1/1) ... [2018-06-24 20:56:25,843 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 20:56:25,845 INFO ]: Using Remove infeasible edges [2018-06-24 20:56:25,845 INFO ]: Using Maximize final states [2018-06-24 20:56:25,846 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:56:25,846 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:56:25,847 INFO ]: Using Remove sink states [2018-06-24 20:56:25,848 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:56:25,848 INFO ]: Using Use SBE [2018-06-24 20:56:25,856 INFO ]: SBE split 0 edges [2018-06-24 20:56:25,868 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:56:25,869 INFO ]: 0 new accepting states [2018-06-24 20:56:25,905 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 20:56:25,906 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:56:25,910 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:56:25,910 INFO ]: 0 new accepting states [2018-06-24 20:56:25,910 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:56:25,910 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:56:25,910 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 20:56:25,911 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:56:25 BasicIcfg [2018-06-24 20:56:25,911 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:56:25,912 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:56:25,912 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:56:25,915 INFO ]: TraceAbstraction initialized [2018-06-24 20:56:25,915 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:56:25" (1/4) ... [2018-06-24 20:56:25,916 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:56:25, skipping insertion in model container [2018-06-24 20:56:25,916 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:56:25" (2/4) ... [2018-06-24 20:56:25,916 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:56:25, skipping insertion in model container [2018-06-24 20:56:25,916 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:56:25" (3/4) ... [2018-06-24 20:56:25,917 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:56:25, skipping insertion in model container [2018-06-24 20:56:25,917 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:56:25" (4/4) ... [2018-06-24 20:56:25,918 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:56:25,928 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:56:25,936 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:56:25,976 INFO ]: Using default assertion order modulation [2018-06-24 20:56:25,977 INFO ]: Interprodecural is true [2018-06-24 20:56:25,977 INFO ]: Hoare is false [2018-06-24 20:56:25,977 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:56:25,977 INFO ]: Backedges is TWOTRACK [2018-06-24 20:56:25,977 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:56:25,977 INFO ]: Difference is false [2018-06-24 20:56:25,977 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:56:25,977 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:56:25,986 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:56:25,994 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:56:25,995 INFO ]: Found error trace [2018-06-24 20:56:25,995 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:56:25,996 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:26,000 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 20:56:26,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:26,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:26,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:26,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,087 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:26,235 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:56:26,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:56:26,237 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:56:26,238 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:56:26,248 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:56:26,249 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:56:26,250 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:56:26,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:26,312 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 20:56:26,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:56:26,313 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:56:26,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:26,319 INFO ]: With dead ends: 7 [2018-06-24 20:56:26,320 INFO ]: Without dead ends: 7 [2018-06-24 20:56:26,321 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:56:26,334 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:56:26,363 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:56:26,365 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:56:26,365 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 20:56:26,366 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 20:56:26,366 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:26,366 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 20:56:26,366 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:56:26,366 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 20:56:26,367 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:56:26,367 INFO ]: Found error trace [2018-06-24 20:56:26,367 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:56:26,367 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:26,367 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 20:56:26,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:26,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:26,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:26,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,397 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:26,492 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:26,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:56:26,492 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:56:26,493 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:56:26,493 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:56:26,493 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:56:26,494 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 3 states. [2018-06-24 20:56:26,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:26,631 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-24 20:56:26,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:56:26,632 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:56:26,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:26,633 INFO ]: With dead ends: 8 [2018-06-24 20:56:26,633 INFO ]: Without dead ends: 7 [2018-06-24 20:56:26,634 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:56:26,634 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:56:26,635 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:56:26,635 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:56:26,635 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-24 20:56:26,635 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 6 [2018-06-24 20:56:26,635 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:26,635 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-24 20:56:26,635 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:56:26,635 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-24 20:56:26,635 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:56:26,635 INFO ]: Found error trace [2018-06-24 20:56:26,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:56:26,635 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:26,636 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-24 20:56:26,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:26,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:26,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:26,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:26,679 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:26,848 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:56:26,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:26,848 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:56:26,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:26,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:26,917 INFO ]: Computing forward predicates... [2018-06-24 20:56:26,983 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:56:27,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:27,003 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:56:27,003 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:56:27,003 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:56:27,003 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:56:27,004 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2018-06-24 20:56:27,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:27,053 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-24 20:56:27,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:56:27,053 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:56:27,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:27,054 INFO ]: With dead ends: 8 [2018-06-24 20:56:27,054 INFO ]: Without dead ends: 8 [2018-06-24 20:56:27,054 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:56:27,054 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:56:27,055 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:56:27,055 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:56:27,055 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:56:27,055 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:56:27,055 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:27,055 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:56:27,056 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:56:27,056 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:56:27,056 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:56:27,056 INFO ]: Found error trace [2018-06-24 20:56:27,056 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:56:27,056 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:27,056 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-24 20:56:27,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:27,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:27,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:27,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:27,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:27,074 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:27,116 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:56:27,116 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:27,116 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:56:27,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:27,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:27,173 INFO ]: Computing forward predicates... [2018-06-24 20:56:27,336 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:27,358 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:56:27,358 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-24 20:56:27,359 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:56:27,359 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:56:27,359 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:56:27,359 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 5 states. [2018-06-24 20:56:27,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:27,529 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 20:56:27,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:56:27,530 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:56:27,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:27,531 INFO ]: With dead ends: 10 [2018-06-24 20:56:27,531 INFO ]: Without dead ends: 8 [2018-06-24 20:56:27,531 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:56:27,531 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:56:27,532 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:56:27,532 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:56:27,532 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 20:56:27,533 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 20:56:27,533 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:27,533 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 20:56:27,533 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:56:27,533 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 20:56:27,533 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:56:27,533 INFO ]: Found error trace [2018-06-24 20:56:27,533 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:56:27,533 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:27,533 INFO ]: Analyzing trace with hash 1485878148, now seen corresponding path program 2 times [2018-06-24 20:56:27,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:27,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:27,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:27,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:27,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:27,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:27,858 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:27,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:27,858 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:56:27,871 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:27,916 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:27,916 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:27,919 INFO ]: Computing forward predicates... [2018-06-24 20:56:27,961 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:27,995 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:27,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:56:27,995 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:56:27,995 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:56:27,995 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:56:27,995 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-06-24 20:56:28,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:28,103 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 20:56:28,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:56:28,104 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:56:28,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:28,104 INFO ]: With dead ends: 10 [2018-06-24 20:56:28,104 INFO ]: Without dead ends: 10 [2018-06-24 20:56:28,104 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:56:28,104 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:56:28,106 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:56:28,106 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:56:28,106 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 20:56:28,106 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-06-24 20:56:28,106 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:28,106 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 20:56:28,106 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:56:28,106 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 20:56:28,106 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:56:28,106 INFO ]: Found error trace [2018-06-24 20:56:28,106 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:56:28,107 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:28,107 INFO ]: Analyzing trace with hash 1989338180, now seen corresponding path program 3 times [2018-06-24 20:56:28,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:28,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:28,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:28,107 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:28,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:28,144 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:28,706 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 20:56:28,707 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:28,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:28,707 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:56:28,721 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:28,800 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:56:28,800 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:28,804 INFO ]: Computing forward predicates... [2018-06-24 20:56:29,179 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:29,201 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:29,201 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:56:29,201 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:56:29,201 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:56:29,201 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:29,201 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-06-24 20:56:29,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:29,336 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 20:56:29,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:56:29,337 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:56:29,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:29,337 INFO ]: With dead ends: 11 [2018-06-24 20:56:29,337 INFO ]: Without dead ends: 11 [2018-06-24 20:56:29,338 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:29,338 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:56:29,339 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:56:29,339 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:56:29,339 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 20:56:29,339 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 20:56:29,339 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:29,339 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 20:56:29,339 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:56:29,339 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 20:56:29,340 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:56:29,340 INFO ]: Found error trace [2018-06-24 20:56:29,340 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:56:29,340 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:29,340 INFO ]: Analyzing trace with hash 1539615818, now seen corresponding path program 4 times [2018-06-24 20:56:29,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:29,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:29,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:29,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:29,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:29,378 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:29,849 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:29,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:29,849 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:56:29,862 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:29,902 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:29,902 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:29,908 INFO ]: Computing forward predicates... [2018-06-24 20:56:30,047 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:30,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:30,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:56:30,067 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:56:30,067 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:56:30,067 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:30,067 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-24 20:56:30,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:30,148 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 20:56:30,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:56:30,149 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:56:30,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:30,149 INFO ]: With dead ends: 12 [2018-06-24 20:56:30,149 INFO ]: Without dead ends: 12 [2018-06-24 20:56:30,150 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:56:30,150 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:56:30,151 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:56:30,151 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:56:30,151 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:56:30,151 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 20:56:30,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:30,151 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:56:30,151 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:56:30,151 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:56:30,152 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:56:30,152 INFO ]: Found error trace [2018-06-24 20:56:30,152 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:56:30,152 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:30,152 INFO ]: Analyzing trace with hash 483124484, now seen corresponding path program 5 times [2018-06-24 20:56:30,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:30,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:30,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:30,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:30,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:30,182 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:30,673 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:30,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:30,673 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:56:30,688 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:56:30,750 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:56:30,750 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:30,755 INFO ]: Computing forward predicates... [2018-06-24 20:56:30,937 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:30,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:30,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 20:56:30,961 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:56:30,961 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:56:30,961 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:56:30,962 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-24 20:56:31,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:31,055 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 20:56:31,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:56:31,055 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:56:31,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:31,056 INFO ]: With dead ends: 13 [2018-06-24 20:56:31,056 INFO ]: Without dead ends: 13 [2018-06-24 20:56:31,056 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:56:31,056 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:56:31,057 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:56:31,057 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:56:31,058 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 20:56:31,058 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 20:56:31,058 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:31,058 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 20:56:31,058 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:56:31,058 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 20:56:31,058 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:56:31,058 INFO ]: Found error trace [2018-06-24 20:56:31,058 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:56:31,058 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:31,059 INFO ]: Analyzing trace with hash 2091631498, now seen corresponding path program 6 times [2018-06-24 20:56:31,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:31,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:31,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:31,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:31,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:31,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:31,311 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:31,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:31,311 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:31,318 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:56:31,381 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:56:31,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:31,387 INFO ]: Computing forward predicates... [2018-06-24 20:56:31,652 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:31,672 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:31,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:56:31,672 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:56:31,673 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:56:31,673 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:56:31,673 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-24 20:56:31,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:31,771 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:56:31,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:56:31,771 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:56:31,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:31,772 INFO ]: With dead ends: 14 [2018-06-24 20:56:31,772 INFO ]: Without dead ends: 14 [2018-06-24 20:56:31,772 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:56:31,772 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:56:31,773 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:56:31,773 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:56:31,774 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:56:31,774 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 20:56:31,774 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:31,774 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:56:31,774 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:56:31,774 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:56:31,774 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:56:31,774 INFO ]: Found error trace [2018-06-24 20:56:31,774 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:56:31,774 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:31,774 INFO ]: Analyzing trace with hash 415741380, now seen corresponding path program 7 times [2018-06-24 20:56:31,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:31,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:31,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:31,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:31,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:31,801 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:32,141 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:32,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:32,142 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:56:32,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:32,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:32,229 INFO ]: Computing forward predicates... [2018-06-24 20:56:32,394 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:32,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:32,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:56:32,423 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:56:32,423 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:56:32,423 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:56:32,423 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-06-24 20:56:32,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:32,503 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:56:32,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:56:32,503 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 20:56:32,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:32,503 INFO ]: With dead ends: 15 [2018-06-24 20:56:32,503 INFO ]: Without dead ends: 15 [2018-06-24 20:56:32,503 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:56:32,503 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:56:32,505 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:56:32,505 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:56:32,505 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 20:56:32,505 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 20:56:32,505 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:32,505 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 20:56:32,505 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:56:32,505 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 20:56:32,506 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:56:32,506 INFO ]: Found error trace [2018-06-24 20:56:32,506 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:56:32,506 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:32,506 INFO ]: Analyzing trace with hash 2755274, now seen corresponding path program 8 times [2018-06-24 20:56:32,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:32,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:32,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:32,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:32,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:32,550 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:32,888 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:32,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:32,888 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:56:32,894 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:32,950 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:32,950 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:32,956 INFO ]: Computing forward predicates... [2018-06-24 20:56:33,019 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:33,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:33,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:56:33,039 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:56:33,039 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:56:33,039 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:56:33,039 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-06-24 20:56:33,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:33,158 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 20:56:33,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:56:33,159 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:56:33,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:33,159 INFO ]: With dead ends: 16 [2018-06-24 20:56:33,159 INFO ]: Without dead ends: 16 [2018-06-24 20:56:33,160 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:56:33,160 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:56:33,161 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:56:33,161 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:56:33,161 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:56:33,161 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 20:56:33,162 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:33,162 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:56:33,162 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:56:33,162 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:56:33,162 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:56:33,162 INFO ]: Found error trace [2018-06-24 20:56:33,162 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:56:33,162 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:33,162 INFO ]: Analyzing trace with hash 85087876, now seen corresponding path program 9 times [2018-06-24 20:56:33,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:33,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:33,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:33,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:33,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:33,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:33,514 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:33,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:33,515 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:56:33,521 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:33,587 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:56:33,587 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:33,592 INFO ]: Computing forward predicates... [2018-06-24 20:56:33,776 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:33,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:33,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:56:33,796 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:56:33,796 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:56:33,797 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:56:33,797 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-06-24 20:56:33,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:33,894 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:56:33,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:56:33,894 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 20:56:33,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:33,895 INFO ]: With dead ends: 17 [2018-06-24 20:56:33,895 INFO ]: Without dead ends: 17 [2018-06-24 20:56:33,895 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:56:33,895 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:56:33,896 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:56:33,896 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:56:33,897 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 20:56:33,897 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 20:56:33,897 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:33,897 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 20:56:33,897 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:56:33,897 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 20:56:33,898 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:56:33,898 INFO ]: Found error trace [2018-06-24 20:56:33,898 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:56:33,898 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:33,898 INFO ]: Analyzing trace with hash -1657568758, now seen corresponding path program 10 times [2018-06-24 20:56:33,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:33,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:33,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:33,899 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:33,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:33,945 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:34,354 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:34,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:34,354 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:56:34,368 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:34,427 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:34,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:34,434 INFO ]: Computing forward predicates... [2018-06-24 20:56:34,506 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:34,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:34,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:56:34,526 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:56:34,526 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:56:34,526 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:56:34,526 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-06-24 20:56:34,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:34,637 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 20:56:34,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:56:34,637 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:56:34,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:34,637 INFO ]: With dead ends: 18 [2018-06-24 20:56:34,637 INFO ]: Without dead ends: 18 [2018-06-24 20:56:34,638 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:56:34,638 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:56:34,639 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:56:34,639 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:56:34,639 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:56:34,640 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 20:56:34,640 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:34,640 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:56:34,640 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:56:34,640 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:56:34,640 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:56:34,640 INFO ]: Found error trace [2018-06-24 20:56:34,640 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:56:34,640 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:34,640 INFO ]: Analyzing trace with hash 154650436, now seen corresponding path program 11 times [2018-06-24 20:56:34,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:34,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:34,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:34,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:34,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:34,697 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:35,569 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:35,569 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:35,580 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:56:35,586 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:56:35,649 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:56:35,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:35,655 INFO ]: Computing forward predicates... [2018-06-24 20:56:35,982 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:36,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:36,004 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 20:56:36,004 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:56:36,004 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:56:36,004 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:56:36,004 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-24 20:56:36,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:36,197 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:56:36,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:56:36,197 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:56:36,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:36,197 INFO ]: With dead ends: 19 [2018-06-24 20:56:36,197 INFO ]: Without dead ends: 19 [2018-06-24 20:56:36,197 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:56:36,197 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:56:36,199 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:56:36,199 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:56:36,199 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 20:56:36,199 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 20:56:36,199 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:36,199 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 20:56:36,199 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:56:36,199 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 20:56:36,200 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:56:36,200 INFO ]: Found error trace [2018-06-24 20:56:36,200 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:56:36,200 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:36,200 INFO ]: Analyzing trace with hash 498870602, now seen corresponding path program 12 times [2018-06-24 20:56:36,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:36,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:36,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:36,201 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:36,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:36,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:36,579 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:36,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:36,579 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:56:36,599 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:56:36,711 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:56:36,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:36,716 INFO ]: Computing forward predicates... [2018-06-24 20:56:36,884 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:36,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:36,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:56:36,904 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:56:36,904 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:56:36,904 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:56:36,904 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-24 20:56:37,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:37,175 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 20:56:37,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:56:37,175 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:56:37,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:37,175 INFO ]: With dead ends: 20 [2018-06-24 20:56:37,175 INFO ]: Without dead ends: 20 [2018-06-24 20:56:37,176 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:56:37,176 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:56:37,177 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:56:37,177 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:56:37,178 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:56:37,178 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 20:56:37,178 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:37,178 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:56:37,178 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:56:37,178 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:56:37,178 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:56:37,178 INFO ]: Found error trace [2018-06-24 20:56:37,178 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:56:37,178 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:37,178 INFO ]: Analyzing trace with hash -1715206140, now seen corresponding path program 13 times [2018-06-24 20:56:37,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:37,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:37,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:37,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:37,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:37,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:38,075 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:38,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:38,075 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:56:38,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:38,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:38,168 INFO ]: Computing forward predicates... [2018-06-24 20:56:38,328 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:38,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:38,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:56:38,348 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:56:38,348 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:56:38,348 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:56:38,349 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-06-24 20:56:38,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:38,663 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:56:38,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:56:38,663 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:56:38,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:38,664 INFO ]: With dead ends: 21 [2018-06-24 20:56:38,664 INFO ]: Without dead ends: 21 [2018-06-24 20:56:38,664 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:56:38,664 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:56:38,665 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:56:38,665 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:56:38,666 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 20:56:38,666 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 20:56:38,666 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:38,666 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 20:56:38,666 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:56:38,666 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 20:56:38,666 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:56:38,666 INFO ]: Found error trace [2018-06-24 20:56:38,666 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:56:38,667 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:38,667 INFO ]: Analyzing trace with hash -1632108406, now seen corresponding path program 14 times [2018-06-24 20:56:38,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:38,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:38,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:38,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:38,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:38,722 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:39,820 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:39,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:39,820 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:56:39,826 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:39,909 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:39,909 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:39,919 INFO ]: Computing forward predicates... [2018-06-24 20:56:40,081 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:40,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:40,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:56:40,101 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:56:40,101 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:56:40,101 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:56:40,101 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-06-24 20:56:40,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:40,271 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 20:56:40,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:56:40,272 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:56:40,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:40,272 INFO ]: With dead ends: 22 [2018-06-24 20:56:40,272 INFO ]: Without dead ends: 22 [2018-06-24 20:56:40,272 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:56:40,273 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:56:40,274 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:56:40,274 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:56:40,275 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:56:40,275 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 20:56:40,275 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:40,275 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:56:40,275 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:56:40,275 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:56:40,275 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:56:40,275 INFO ]: Found error trace [2018-06-24 20:56:40,275 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:56:40,275 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:40,275 INFO ]: Analyzing trace with hash 943921348, now seen corresponding path program 15 times [2018-06-24 20:56:40,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:40,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:40,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:40,276 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:40,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:40,342 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:40,774 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:40,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:40,791 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:56:40,798 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:40,877 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:56:40,877 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:40,886 INFO ]: Computing forward predicates... [2018-06-24 20:56:41,134 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:41,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:41,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-24 20:56:41,165 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:56:41,165 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:56:41,165 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:56:41,166 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-06-24 20:56:41,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:41,393 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:56:41,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:56:41,393 INFO ]: Start accepts. Automaton has 21 states. Word has length 21 [2018-06-24 20:56:41,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:41,394 INFO ]: With dead ends: 23 [2018-06-24 20:56:41,394 INFO ]: Without dead ends: 23 [2018-06-24 20:56:41,394 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:56:41,394 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:56:41,397 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:56:41,397 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:56:41,397 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 20:56:41,397 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 20:56:41,398 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:41,398 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 20:56:41,398 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:56:41,398 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 20:56:41,398 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:56:41,398 INFO ]: Found error trace [2018-06-24 20:56:41,398 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:56:41,398 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:41,398 INFO ]: Analyzing trace with hash -803534902, now seen corresponding path program 16 times [2018-06-24 20:56:41,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:41,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:41,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:41,399 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:41,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:41,467 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:42,130 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:42,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:42,130 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:56:42,135 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:42,221 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:42,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:42,233 INFO ]: Computing forward predicates... [2018-06-24 20:56:42,375 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:42,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:42,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:56:42,407 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:56:42,408 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:56:42,408 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:56:42,408 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2018-06-24 20:56:42,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:42,661 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 20:56:42,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:56:42,661 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:56:42,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:42,662 INFO ]: With dead ends: 24 [2018-06-24 20:56:42,662 INFO ]: Without dead ends: 24 [2018-06-24 20:56:42,662 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:56:42,662 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:56:42,664 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:56:42,664 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:56:42,664 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:56:42,664 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 20:56:42,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:42,664 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:56:42,664 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:56:42,664 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:56:42,665 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:56:42,665 INFO ]: Found error trace [2018-06-24 20:56:42,665 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:56:42,665 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:42,665 INFO ]: Analyzing trace with hash 859896196, now seen corresponding path program 17 times [2018-06-24 20:56:42,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:42,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:42,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:42,666 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:42,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:42,721 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:43,233 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:43,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:43,233 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:56:43,239 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:56:43,401 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:56:43,401 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:43,410 INFO ]: Computing forward predicates... [2018-06-24 20:56:43,584 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:43,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:43,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 20:56:43,605 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:56:43,605 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:56:43,605 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:56:43,606 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2018-06-24 20:56:43,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:43,841 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:56:43,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:56:43,841 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-24 20:56:43,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:43,842 INFO ]: With dead ends: 25 [2018-06-24 20:56:43,842 INFO ]: Without dead ends: 25 [2018-06-24 20:56:43,842 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:56:43,842 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:56:43,843 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:56:43,843 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:56:43,844 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 20:56:43,844 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 20:56:43,844 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:43,844 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 20:56:43,844 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:56:43,844 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 20:56:43,844 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:56:43,844 INFO ]: Found error trace [2018-06-24 20:56:43,845 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:56:43,845 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:43,845 INFO ]: Analyzing trace with hash 886652682, now seen corresponding path program 18 times [2018-06-24 20:56:43,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:43,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:43,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:43,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:43,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:43,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:44,455 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:44,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:44,455 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:56:44,481 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:56:44,573 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-24 20:56:44,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:44,580 INFO ]: Computing forward predicates... [2018-06-24 20:56:44,737 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:44,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:44,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:56:44,770 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:56:44,770 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:56:44,770 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:56:44,770 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2018-06-24 20:56:45,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:45,271 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 20:56:45,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:56:45,272 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 20:56:45,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:45,272 INFO ]: With dead ends: 26 [2018-06-24 20:56:45,272 INFO ]: Without dead ends: 26 [2018-06-24 20:56:45,273 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:56:45,273 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:56:45,274 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:56:45,274 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:56:45,275 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:56:45,275 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 20:56:45,276 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:45,276 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:56:45,276 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:56:45,276 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:56:45,276 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:56:45,276 INFO ]: Found error trace [2018-06-24 20:56:45,276 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:56:45,276 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:45,277 INFO ]: Analyzing trace with hash 1716103748, now seen corresponding path program 19 times [2018-06-24 20:56:45,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:45,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:45,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:45,344 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:45,919 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:45,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:45,936 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:56:45,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:46,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:46,067 INFO ]: Computing forward predicates... [2018-06-24 20:56:46,291 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:46,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:46,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 20:56:46,311 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:56:46,311 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:56:46,311 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:56:46,311 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2018-06-24 20:56:46,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:46,586 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:56:46,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:56:46,589 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-24 20:56:46,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:46,589 INFO ]: With dead ends: 27 [2018-06-24 20:56:46,589 INFO ]: Without dead ends: 27 [2018-06-24 20:56:46,590 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:56:46,590 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:56:46,591 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:56:46,591 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:56:46,592 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 20:56:46,592 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 20:56:46,592 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:46,592 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 20:56:46,592 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:56:46,592 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 20:56:46,593 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:56:46,593 INFO ]: Found error trace [2018-06-24 20:56:46,593 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:56:46,593 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:46,593 INFO ]: Analyzing trace with hash 1659283018, now seen corresponding path program 20 times [2018-06-24 20:56:46,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:46,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:46,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:46,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:46,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:46,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:47,192 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:47,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:47,192 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:56:47,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:47,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:47,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:47,333 INFO ]: Computing forward predicates... [2018-06-24 20:56:47,586 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:47,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:47,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:56:47,605 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:56:47,605 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:56:47,606 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:56:47,606 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2018-06-24 20:56:48,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:48,112 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 20:56:48,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:56:48,114 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:56:48,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:48,114 INFO ]: With dead ends: 28 [2018-06-24 20:56:48,114 INFO ]: Without dead ends: 28 [2018-06-24 20:56:48,115 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:56:48,115 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:56:48,116 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:56:48,116 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:56:48,117 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 20:56:48,117 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 20:56:48,117 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:48,117 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 20:56:48,117 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:56:48,117 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 20:56:48,117 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:56:48,117 INFO ]: Found error trace [2018-06-24 20:56:48,118 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:56:48,118 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:48,118 INFO ]: Analyzing trace with hash -102159612, now seen corresponding path program 21 times [2018-06-24 20:56:48,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:48,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:48,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:48,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:48,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:48,194 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:48,723 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:48,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:48,723 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:56:48,728 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:56:48,838 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:56:48,838 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:48,851 INFO ]: Computing forward predicates... [2018-06-24 20:56:49,151 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:49,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:49,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 20:56:49,172 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:56:49,172 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:56:49,172 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:56:49,172 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2018-06-24 20:56:49,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:49,839 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 20:56:49,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:56:49,840 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:56:49,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:49,840 INFO ]: With dead ends: 29 [2018-06-24 20:56:49,840 INFO ]: Without dead ends: 29 [2018-06-24 20:56:49,841 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:56:49,841 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:56:49,843 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:56:49,843 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:56:49,843 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:56:49,843 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 20:56:49,843 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:49,843 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:56:49,843 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:56:49,843 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:56:49,844 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:56:49,844 INFO ]: Found error trace [2018-06-24 20:56:49,844 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:56:49,844 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:49,844 INFO ]: Analyzing trace with hash 1127693706, now seen corresponding path program 22 times [2018-06-24 20:56:49,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:49,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:49,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:49,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:49,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:49,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:51,019 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:51,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:51,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:51,025 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:56:51,164 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:56:51,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:51,180 INFO ]: Computing forward predicates... [2018-06-24 20:56:51,435 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:51,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:51,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:56:51,455 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:56:51,456 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:56:51,456 INFO ]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:56:51,456 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2018-06-24 20:56:51,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:51,837 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 20:56:51,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:56:51,837 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 20:56:51,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:51,838 INFO ]: With dead ends: 30 [2018-06-24 20:56:51,838 INFO ]: Without dead ends: 30 [2018-06-24 20:56:51,838 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:56:51,838 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:56:51,840 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:56:51,840 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:56:51,840 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 20:56:51,841 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 20:56:51,841 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:51,841 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 20:56:51,841 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:56:51,841 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 20:56:51,841 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:56:51,841 INFO ]: Found error trace [2018-06-24 20:56:51,841 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 20:56:51,841 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:51,841 INFO ]: Analyzing trace with hash 598440900, now seen corresponding path program 23 times [2018-06-24 20:56:51,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:51,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:51,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:51,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:51,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:51,977 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:52,688 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:52,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:52,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:52,696 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:56:52,829 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:56:52,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:52,843 INFO ]: Computing forward predicates... [2018-06-24 20:56:53,175 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:53,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:53,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 20:56:53,196 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:56:53,196 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:56:53,196 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:56:53,196 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2018-06-24 20:56:53,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:53,681 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 20:56:53,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:56:53,682 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:56:53,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:53,682 INFO ]: With dead ends: 31 [2018-06-24 20:56:53,682 INFO ]: Without dead ends: 31 [2018-06-24 20:56:53,682 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:56:53,682 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:56:53,684 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:56:53,684 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:56:53,684 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 20:56:53,684 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 20:56:53,684 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:53,684 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 20:56:53,684 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:56:53,684 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 20:56:53,685 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:56:53,685 INFO ]: Found error trace [2018-06-24 20:56:53,685 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-24 20:56:53,685 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:53,685 INFO ]: Analyzing trace with hash 1371473098, now seen corresponding path program 24 times [2018-06-24 20:56:53,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:53,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:53,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:53,686 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:53,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:53,802 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:54,484 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:54,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:54,485 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:54,491 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:56:54,614 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-24 20:56:54,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:54,623 INFO ]: Computing forward predicates... [2018-06-24 20:56:54,914 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:54,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:54,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:56:54,935 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:56:54,935 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:56:54,935 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:56:54,935 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2018-06-24 20:56:55,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:55,356 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 20:56:55,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:56:55,358 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 20:56:55,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:55,359 INFO ]: With dead ends: 32 [2018-06-24 20:56:55,359 INFO ]: Without dead ends: 32 [2018-06-24 20:56:55,359 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:56:55,359 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:56:55,361 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:56:55,361 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:56:55,361 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 20:56:55,362 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 20:56:55,362 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:55,363 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 20:56:55,363 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:56:55,363 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 20:56:55,363 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:56:55,363 INFO ]: Found error trace [2018-06-24 20:56:55,363 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-24 20:56:55,363 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:55,363 INFO ]: Analyzing trace with hash -434332540, now seen corresponding path program 25 times [2018-06-24 20:56:55,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:55,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:55,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:55,364 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:55,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:55,459 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:56,243 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:56,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:56,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:56,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:56,420 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:56,442 INFO ]: Computing forward predicates... [2018-06-24 20:56:56,802 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:56,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:56,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-24 20:56:56,822 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:56:56,822 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:56:56,822 INFO ]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:56:56,822 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-06-24 20:56:57,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:57,291 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 20:56:57,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:56:57,292 INFO ]: Start accepts. Automaton has 31 states. Word has length 31 [2018-06-24 20:56:57,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:57,293 INFO ]: With dead ends: 33 [2018-06-24 20:56:57,293 INFO ]: Without dead ends: 33 [2018-06-24 20:56:57,293 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:56:57,293 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:56:57,294 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:56:57,294 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:56:57,295 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 20:56:57,295 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 20:56:57,295 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:57,295 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 20:56:57,295 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:56:57,295 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 20:56:57,296 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:56:57,296 INFO ]: Found error trace [2018-06-24 20:56:57,296 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-24 20:56:57,296 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:57,296 INFO ]: Analyzing trace with hash -579732470, now seen corresponding path program 26 times [2018-06-24 20:56:57,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:57,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:57,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:57,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:56:57,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:57,368 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:58,105 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:58,105 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:56:58,105 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:56:58,112 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:56:58,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:56:58,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:56:58,304 INFO ]: Computing forward predicates... [2018-06-24 20:56:58,802 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:56:58,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:56:58,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 20:56:58,821 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:56:58,822 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:56:58,822 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:56:58,822 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2018-06-24 20:56:59,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:56:59,291 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 20:56:59,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:56:59,291 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:56:59,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:56:59,291 INFO ]: With dead ends: 34 [2018-06-24 20:56:59,291 INFO ]: Without dead ends: 34 [2018-06-24 20:56:59,291 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 17 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:56:59,291 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:56:59,293 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:56:59,293 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:56:59,293 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 20:56:59,293 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 20:56:59,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:56:59,293 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 20:56:59,293 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:56:59,294 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 20:56:59,294 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:56:59,294 INFO ]: Found error trace [2018-06-24 20:56:59,294 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-24 20:56:59,294 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:56:59,294 INFO ]: Analyzing trace with hash -792163004, now seen corresponding path program 27 times [2018-06-24 20:56:59,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:56:59,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:56:59,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:59,295 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:56:59,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:56:59,370 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:00,398 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:00,398 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:00,398 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:00,404 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:00,581 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:57:00,581 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:00,608 INFO ]: Computing forward predicates... [2018-06-24 20:57:00,934 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:00,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:00,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 20:57:00,955 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:57:00,955 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:57:00,955 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:57:00,955 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-24 20:57:01,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:01,480 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 20:57:01,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:57:01,480 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-24 20:57:01,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:01,480 INFO ]: With dead ends: 35 [2018-06-24 20:57:01,480 INFO ]: Without dead ends: 35 [2018-06-24 20:57:01,481 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:57:01,481 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:57:01,482 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:57:01,482 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:57:01,483 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 20:57:01,483 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 20:57:01,483 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:01,483 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 20:57:01,483 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:57:01,483 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 20:57:01,483 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:57:01,483 INFO ]: Found error trace [2018-06-24 20:57:01,483 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-24 20:57:01,484 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:01,484 INFO ]: Analyzing trace with hash 1212425034, now seen corresponding path program 28 times [2018-06-24 20:57:01,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:01,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:01,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:01,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:01,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:01,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:02,746 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:02,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:02,746 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:02,752 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:02,962 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:02,962 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:02,986 INFO ]: Computing forward predicates... [2018-06-24 20:57:03,326 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:03,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:03,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:57:03,346 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:57:03,346 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:57:03,347 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:57:03,347 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-24 20:57:03,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:03,886 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 20:57:03,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:57:03,886 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 20:57:03,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:03,886 INFO ]: With dead ends: 36 [2018-06-24 20:57:03,886 INFO ]: Without dead ends: 36 [2018-06-24 20:57:03,886 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:57:03,887 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:57:03,888 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:57:03,888 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:57:03,888 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 20:57:03,888 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 20:57:03,888 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:03,889 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 20:57:03,889 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:57:03,889 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 20:57:03,889 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:57:03,889 INFO ]: Found error trace [2018-06-24 20:57:03,889 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-24 20:57:03,889 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:03,889 INFO ]: Analyzing trace with hash -1069855228, now seen corresponding path program 29 times [2018-06-24 20:57:03,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:03,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:03,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:03,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:03,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:04,010 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:04,895 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:04,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:04,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:04,900 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:05,061 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 20:57:05,061 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:05,077 INFO ]: Computing forward predicates... [2018-06-24 20:57:05,346 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:05,366 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:05,366 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-24 20:57:05,366 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:57:05,366 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:57:05,366 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:57:05,366 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-24 20:57:06,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:06,010 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 20:57:06,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:57:06,011 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-24 20:57:06,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:06,011 INFO ]: With dead ends: 37 [2018-06-24 20:57:06,011 INFO ]: Without dead ends: 37 [2018-06-24 20:57:06,011 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:57:06,011 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:57:06,014 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:57:06,014 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:57:06,015 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 20:57:06,015 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 20:57:06,015 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:06,015 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 20:57:06,015 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:57:06,015 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 20:57:06,015 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:57:06,015 INFO ]: Found error trace [2018-06-24 20:57:06,015 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-24 20:57:06,015 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:06,015 INFO ]: Analyzing trace with hash 1193900682, now seen corresponding path program 30 times [2018-06-24 20:57:06,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:06,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:06,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:06,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:06,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:06,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:07,750 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:07,750 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:07,750 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:07,756 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:57:07,914 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-24 20:57:07,914 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:07,924 INFO ]: Computing forward predicates... [2018-06-24 20:57:08,442 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:08,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:08,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:57:08,463 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:57:08,464 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:57:08,464 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:57:08,464 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-24 20:57:09,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:09,146 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 20:57:09,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:57:09,147 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 20:57:09,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:09,147 INFO ]: With dead ends: 38 [2018-06-24 20:57:09,147 INFO ]: Without dead ends: 38 [2018-06-24 20:57:09,147 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 22 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:57:09,147 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:57:09,149 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:57:09,149 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:57:09,149 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 20:57:09,149 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 20:57:09,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:09,149 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 20:57:09,149 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:57:09,149 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 20:57:09,150 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:57:09,150 INFO ]: Found error trace [2018-06-24 20:57:09,150 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-24 20:57:09,150 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:09,150 INFO ]: Analyzing trace with hash -1644110140, now seen corresponding path program 31 times [2018-06-24 20:57:09,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:09,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:09,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:09,150 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:09,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:09,241 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:10,781 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:10,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:10,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:10,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:11,030 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:11,063 INFO ]: Computing forward predicates... [2018-06-24 20:57:11,563 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:11,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:11,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 20:57:11,583 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:57:11,583 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:57:11,583 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:57:11,584 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-24 20:57:12,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:12,339 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 20:57:12,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:57:12,339 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-24 20:57:12,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:12,339 INFO ]: With dead ends: 39 [2018-06-24 20:57:12,339 INFO ]: Without dead ends: 39 [2018-06-24 20:57:12,340 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:57:12,340 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:57:12,340 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:57:12,340 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:57:12,341 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 20:57:12,341 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 20:57:12,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:12,341 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 20:57:12,341 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:57:12,341 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 20:57:12,341 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:57:12,341 INFO ]: Found error trace [2018-06-24 20:57:12,341 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-24 20:57:12,341 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:12,342 INFO ]: Analyzing trace with hash 571867594, now seen corresponding path program 32 times [2018-06-24 20:57:12,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:12,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:12,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:12,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:57:12,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:12,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:13,848 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:13,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:13,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:13,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:57:14,107 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:57:14,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:14,129 INFO ]: Computing forward predicates... [2018-06-24 20:57:14,525 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:14,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:14,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 20:57:14,544 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:57:14,544 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:57:14,545 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:57:14,545 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2018-06-24 20:57:15,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:15,309 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 20:57:15,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:57:15,309 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-24 20:57:15,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:15,309 INFO ]: With dead ends: 40 [2018-06-24 20:57:15,309 INFO ]: Without dead ends: 40 [2018-06-24 20:57:15,310 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:57:15,310 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:57:15,311 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:57:15,311 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:57:15,311 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 20:57:15,311 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 20:57:15,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:15,311 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 20:57:15,311 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:57:15,311 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 20:57:15,312 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:57:15,312 INFO ]: Found error trace [2018-06-24 20:57:15,312 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-24 20:57:15,312 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:15,312 INFO ]: Analyzing trace with hash 547700612, now seen corresponding path program 33 times [2018-06-24 20:57:15,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:15,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:15,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:15,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:15,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:15,483 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:16,431 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:16,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:16,431 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:16,436 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:57:16,619 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 20:57:16,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:16,650 INFO ]: Computing forward predicates... [2018-06-24 20:57:17,524 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:17,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:17,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-24 20:57:17,545 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:57:17,545 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:57:17,545 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:57:17,546 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2018-06-24 20:57:18,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:18,333 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 20:57:18,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:57:18,333 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-24 20:57:18,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:18,334 INFO ]: With dead ends: 41 [2018-06-24 20:57:18,334 INFO ]: Without dead ends: 41 [2018-06-24 20:57:18,334 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:57:18,334 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:57:18,335 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:57:18,335 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:57:18,335 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 20:57:18,335 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 20:57:18,335 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:18,335 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 20:57:18,335 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:57:18,335 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 20:57:18,335 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:57:18,335 INFO ]: Found error trace [2018-06-24 20:57:18,335 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-24 20:57:18,336 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:18,336 INFO ]: Analyzing trace with hash -201475830, now seen corresponding path program 34 times [2018-06-24 20:57:18,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:18,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:18,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:18,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:18,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:18,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:19,520 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:19,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:19,646 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:19,652 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:57:19,936 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:57:19,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:19,966 INFO ]: Computing forward predicates... [2018-06-24 20:57:20,517 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:20,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:20,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-24 20:57:20,537 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:57:20,537 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:57:20,537 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:57:20,537 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2018-06-24 20:57:21,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:57:21,387 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 20:57:21,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:57:21,387 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-24 20:57:21,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:57:21,387 INFO ]: With dead ends: 42 [2018-06-24 20:57:21,387 INFO ]: Without dead ends: 42 [2018-06-24 20:57:21,387 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 23 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:57:21,388 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:57:21,389 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 20:57:21,389 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:57:21,389 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 20:57:21,389 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 20:57:21,389 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:57:21,389 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 20:57:21,389 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:57:21,389 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 20:57:21,389 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:57:21,389 INFO ]: Found error trace [2018-06-24 20:57:21,390 INFO ]: trace histogram [36, 1, 1, 1, 1, 1] [2018-06-24 20:57:21,390 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:57:21,390 INFO ]: Analyzing trace with hash -1951109052, now seen corresponding path program 35 times [2018-06-24 20:57:21,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:57:21,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:57:21,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:21,390 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:57:21,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:57:21,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:22,670 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:22,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:57:22,670 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:57:22,675 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:57:22,888 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 20:57:22,888 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:57:22,913 INFO ]: Computing forward predicates... [2018-06-24 20:57:24,022 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:57:24,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:57:24,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-24 20:57:24,042 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:57:24,042 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:57:24,042 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:57:24,043 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. Received shutdown request... [2018-06-24 20:57:24,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:57:24,664 WARN ]: Verification canceled [2018-06-24 20:57:24,667 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:57:24,668 WARN ]: Timeout [2018-06-24 20:57:24,668 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:57:24 BasicIcfg [2018-06-24 20:57:24,668 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:57:24,668 INFO ]: Toolchain (without parser) took 59264.88 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 758.1 MB). Free memory was 263.2 MB in the beginning and 1.0 GB in the end (delta: -753.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:57:24,669 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:57:24,670 INFO ]: ChcToBoogie took 69.60 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 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:57:24,670 INFO ]: Boogie Preprocessor took 46.96 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 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:57:24,671 INFO ]: RCFGBuilder took 291.79 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 249.2 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:57:24,671 INFO ]: BlockEncodingV2 took 90.89 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 247.2 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:57:24,672 INFO ]: TraceAbstraction took 58755.89 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 758.1 MB). Free memory was 247.2 MB in the beginning and 1.0 GB in the end (delta: -769.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:57:24,678 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.60 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.96 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 291.79 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 249.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 90.89 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 247.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58755.89 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 758.1 MB). Free memory was 247.2 MB in the beginning and 1.0 GB in the end (delta: -769.1 MB). There was no memory consumed. 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 (42states) and interpolant automaton (currently 29 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.6s OverallTime, 38 OverallIterations, 36 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 0 SDslu, 2081 SDs, 0 SdLazy, 18857 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1586 GetRequests, 459 SyntacticMatches, 385 SemanticMatches, 742 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=37, 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, 37 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 250 NumberOfCheckSat, 1625 ConstructedInterpolants, 0 QuantifiedInterpolants, 1160824 SizeOfPredicates, 214 NumberOfNonLiveVariables, 27854 ConjunctsInSsa, 12330 ConjunctsInUnsatCore, 74 InterpolantComputations, 3 PerfectInterpolantSequences, 2/16863 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/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-57-24-690.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-57-24-690.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-57-24-690.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-57-24-690.csv Completed graceful shutdown