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/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:34:06,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:34:06,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:34:06,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:34:06,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:34:06,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:34:06,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:34:06,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:34:06,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:34:06,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:34:06,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:34:06,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:34:06,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:34:06,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:34:06,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:34:06,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:34:06,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:34:06,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:34:06,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:34:06,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:34:06,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:34:06,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:34:06,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:34:06,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:34:06,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:34:06,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:34:06,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:34:06,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:34:06,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:34:06,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:34:06,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:34:06,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:34:06,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:34:06,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:34:06,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:34:06,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:34:06,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:34:06,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:34:06,108 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:34:06,108 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:34:06,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:34:06,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:34:06,110 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:34:06,110 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:34:06,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:34:06,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:34:06,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:34:06,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:34:06,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:34:06,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:34:06,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:34:06,113 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:34:06,114 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:34:06,114 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:34:06,159 INFO ]: Repository-Root is: /tmp [2018-06-25 01:34:06,173 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:34:06,178 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:34:06,179 INFO ]: Initializing SmtParser... [2018-06-25 01:34:06,179 INFO ]: SmtParser initialized [2018-06-25 01:34:06,180 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 [2018-06-25 01:34:06,181 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-25 01:34:06,264 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 unknown [2018-06-25 01:34:06,786 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 [2018-06-25 01:34:06,792 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:34:06,798 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:34:06,799 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:34:06,799 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:34:06,799 INFO ]: ChcToBoogie initialized [2018-06-25 01:34:06,802 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,864 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06 Unit [2018-06-25 01:34:06,864 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:34:06,865 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:34:06,865 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:34:06,865 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:34:06,885 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,885 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,907 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,907 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,928 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,929 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,941 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (1/1) ... [2018-06-25 01:34:06,954 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:34:06,955 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:34:06,955 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:34:06,955 INFO ]: RCFGBuilder initialized [2018-06-25 01:34:06,955 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (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-25 01:34:06,973 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:34:06,973 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:34:06,973 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:34:06,973 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:34:06,973 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:34:06,973 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-25 01:34:07,391 INFO ]: Using library mode [2018-06-25 01:34:07,392 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:07 BoogieIcfgContainer [2018-06-25 01:34:07,392 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:34:07,392 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:34:07,392 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:34:07,393 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:34:07,395 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:07" (1/1) ... [2018-06-25 01:34:07,413 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:34:07,415 INFO ]: Using Remove infeasible edges [2018-06-25 01:34:07,415 INFO ]: Using Maximize final states [2018-06-25 01:34:07,416 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:34:07,416 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:34:07,418 INFO ]: Using Remove sink states [2018-06-25 01:34:07,419 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:34:07,419 INFO ]: Using Use SBE [2018-06-25 01:34:07,427 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 01:34:08,287 WARN ]: aborting because of expected exponential blowup for input size 135 [2018-06-25 01:34:08,302 WARN ]: aborting because of expected exponential blowup for input size 135 [2018-06-25 01:34:08,302 INFO ]: SBE split 1 edges [2018-06-25 01:34:08,308 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:34:08,311 INFO ]: 0 new accepting states [2018-06-25 01:34:08,681 INFO ]: Removed 25 edges and 2 locations by large block encoding [2018-06-25 01:34:08,683 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:34:08,685 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:34:08,685 INFO ]: 0 new accepting states [2018-06-25 01:34:08,685 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:34:08,685 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:34:08,685 INFO ]: Encoded RCFG 6 locations, 27 edges [2018-06-25 01:34:08,686 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:34:08 BasicIcfg [2018-06-25 01:34:08,686 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:34:08,687 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:34:08,687 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:34:08,690 INFO ]: TraceAbstraction initialized [2018-06-25 01:34:08,690 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:34:06" (1/4) ... [2018-06-25 01:34:08,691 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341e4b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:34:08, skipping insertion in model container [2018-06-25 01:34:08,691 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:06" (2/4) ... [2018-06-25 01:34:08,691 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341e4b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:34:08, skipping insertion in model container [2018-06-25 01:34:08,691 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:07" (3/4) ... [2018-06-25 01:34:08,691 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341e4b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:34:08, skipping insertion in model container [2018-06-25 01:34:08,691 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:34:08" (4/4) ... [2018-06-25 01:34:08,693 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:34:08,702 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:34:08,710 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:34:08,758 INFO ]: Using default assertion order modulation [2018-06-25 01:34:08,759 INFO ]: Interprodecural is true [2018-06-25 01:34:08,759 INFO ]: Hoare is false [2018-06-25 01:34:08,759 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:34:08,759 INFO ]: Backedges is TWOTRACK [2018-06-25 01:34:08,759 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:34:08,759 INFO ]: Difference is false [2018-06-25 01:34:08,759 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:34:08,759 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:34:08,773 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:34:08,788 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:34:08,788 INFO ]: Found error trace [2018-06-25 01:34:08,789 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:34:08,790 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:08,797 INFO ]: Analyzing trace with hash 36099287, now seen corresponding path program 1 times [2018-06-25 01:34:08,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:08,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:08,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:08,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:08,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:08,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:08,979 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:08,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:34:08,981 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:34:08,982 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:34:08,993 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:34:08,993 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:34:08,996 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:34:09,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:09,329 INFO ]: Finished difference Result 7 states and 28 transitions. [2018-06-25 01:34:09,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:34:09,330 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:34:09,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:09,342 INFO ]: With dead ends: 7 [2018-06-25 01:34:09,342 INFO ]: Without dead ends: 7 [2018-06-25 01:34:09,348 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-25 01:34:09,375 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:34:09,401 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:34:09,402 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:34:09,403 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-25 01:34:09,404 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-25 01:34:09,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:09,405 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-25 01:34:09,405 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:34:09,405 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-25 01:34:09,405 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:34:09,405 INFO ]: Found error trace [2018-06-25 01:34:09,405 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:34:09,405 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:09,405 INFO ]: Analyzing trace with hash 36158869, now seen corresponding path program 1 times [2018-06-25 01:34:09,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:09,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:09,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:09,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,413 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:09,484 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:09,485 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:34:09,485 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:34:09,486 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:34:09,486 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:34:09,486 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:34:09,486 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-25 01:34:09,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:09,712 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-25 01:34:09,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:34:09,712 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:34:09,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:09,713 INFO ]: With dead ends: 9 [2018-06-25 01:34:09,713 INFO ]: Without dead ends: 9 [2018-06-25 01:34:09,713 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-25 01:34:09,714 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:34:09,715 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:34:09,715 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:34:09,716 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-25 01:34:09,716 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-25 01:34:09,716 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:09,716 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-25 01:34:09,716 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:34:09,716 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-25 01:34:09,716 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:34:09,716 INFO ]: Found error trace [2018-06-25 01:34:09,717 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:34:09,717 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:09,717 INFO ]: Analyzing trace with hash 36218451, now seen corresponding path program 1 times [2018-06-25 01:34:09,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:09,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:09,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:09,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,723 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:09,737 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:09,737 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:34:09,737 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:34:09,737 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:34:09,737 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:34:09,738 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:34:09,738 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-25 01:34:09,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:09,903 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-25 01:34:09,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:34:09,903 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:34:09,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:09,904 INFO ]: With dead ends: 9 [2018-06-25 01:34:09,904 INFO ]: Without dead ends: 9 [2018-06-25 01:34:09,904 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-25 01:34:09,904 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:34:09,906 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:34:09,906 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:34:09,906 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-25 01:34:09,906 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-25 01:34:09,906 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:09,906 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-25 01:34:09,907 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:34:09,908 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-25 01:34:09,908 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:34:09,908 INFO ]: Found error trace [2018-06-25 01:34:09,908 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:34:09,908 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:09,908 INFO ]: Analyzing trace with hash 36248242, now seen corresponding path program 1 times [2018-06-25 01:34:09,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:09,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:09,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:09,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:09,915 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:09,950 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:09,950 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:34:09,950 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:34:09,950 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:34:09,951 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:34:09,951 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:34:09,951 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-25 01:34:10,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:10,122 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-25 01:34:10,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:34:10,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:34:10,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:10,122 INFO ]: With dead ends: 9 [2018-06-25 01:34:10,122 INFO ]: Without dead ends: 9 [2018-06-25 01:34:10,123 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-25 01:34:10,123 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:34:10,124 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 01:34:10,124 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:34:10,125 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-25 01:34:10,125 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-25 01:34:10,125 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:10,125 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-25 01:34:10,125 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:34:10,125 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-25 01:34:10,125 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:34:10,125 INFO ]: Found error trace [2018-06-25 01:34:10,125 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:34:10,125 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:10,126 INFO ]: Analyzing trace with hash 1117572169, now seen corresponding path program 1 times [2018-06-25 01:34:10,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:10,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:10,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:10,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:10,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:10,212 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:10,341 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:10,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:10,341 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-25 01:34:10,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:10,427 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:10,435 INFO ]: Computing forward predicates... [2018-06-25 01:34:10,929 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:10,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:10,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:34:10,961 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:34:10,961 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:34:10,961 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:34:10,961 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 5 states. [2018-06-25 01:34:11,331 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 11 [2018-06-25 01:34:11,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:11,607 INFO ]: Finished difference Result 11 states and 32 transitions. [2018-06-25 01:34:11,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:11,607 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:34:11,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:11,607 INFO ]: With dead ends: 11 [2018-06-25 01:34:11,607 INFO ]: Without dead ends: 11 [2018-06-25 01:34:11,608 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:11,608 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 01:34:11,610 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 01:34:11,610 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:34:11,611 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-25 01:34:11,611 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 6 [2018-06-25 01:34:11,611 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:11,611 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-25 01:34:11,611 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:34:11,611 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-25 01:34:11,611 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:34:11,611 INFO ]: Found error trace [2018-06-25 01:34:11,611 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:34:11,611 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:11,611 INFO ]: Analyzing trace with hash 1121266253, now seen corresponding path program 1 times [2018-06-25 01:34:11,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:11,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:11,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:11,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:11,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:11,652 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:11,800 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:11,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:11,829 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-25 01:34:11,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:11,913 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:11,916 INFO ]: Computing forward predicates... [2018-06-25 01:34:12,345 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:12,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:12,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:34:12,365 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:34:12,365 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:34:12,365 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:34:12,365 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 5 states. [2018-06-25 01:34:12,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:12,509 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-25 01:34:12,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:12,510 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:34:12,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:12,510 INFO ]: With dead ends: 16 [2018-06-25 01:34:12,510 INFO ]: Without dead ends: 16 [2018-06-25 01:34:12,510 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:12,510 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:34:12,512 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-25 01:34:12,512 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:34:12,512 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-25 01:34:12,512 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 6 [2018-06-25 01:34:12,513 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:12,513 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-25 01:34:12,513 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:34:12,513 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-25 01:34:12,513 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:34:12,513 INFO ]: Found error trace [2018-06-25 01:34:12,513 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:34:12,513 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:12,513 INFO ]: Analyzing trace with hash 1134195547, now seen corresponding path program 1 times [2018-06-25 01:34:12,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:12,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:12,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:12,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:12,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:12,539 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:12,673 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:12,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:12,673 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-25 01:34:12,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:12,718 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:12,720 INFO ]: Computing forward predicates... [2018-06-25 01:34:12,902 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:12,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:12,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:34:12,922 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:34:12,922 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:34:12,922 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:34:12,923 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 5 states. [2018-06-25 01:34:13,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:13,010 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-25 01:34:13,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 01:34:13,011 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:34:13,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:13,012 INFO ]: With dead ends: 16 [2018-06-25 01:34:13,012 INFO ]: Without dead ends: 16 [2018-06-25 01:34:13,012 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:13,012 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:34:13,014 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-25 01:34:13,014 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:34:13,015 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-25 01:34:13,015 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 6 [2018-06-25 01:34:13,015 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:13,015 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-25 01:34:13,015 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:34:13,015 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-25 01:34:13,015 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:34:13,015 INFO ]: Found error trace [2018-06-25 01:34:13,015 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:34:13,015 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:13,016 INFO ]: Analyzing trace with hash 283493143, now seen corresponding path program 2 times [2018-06-25 01:34:13,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:13,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:13,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:13,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:13,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:13,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:13,515 WARN ]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:13,675 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:13,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:13,676 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-25 01:34:13,688 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 01:34:13,801 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:34:13,801 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:13,805 INFO ]: Computing forward predicates... [2018-06-25 01:34:14,155 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:34:16,865 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:16,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:16,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:34:16,900 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:34:16,900 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:34:16,900 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:16,900 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-25 01:34:17,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:17,055 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-25 01:34:17,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:34:17,056 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:34:17,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:17,056 INFO ]: With dead ends: 16 [2018-06-25 01:34:17,056 INFO ]: Without dead ends: 16 [2018-06-25 01:34:17,057 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:34:17,057 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:34:17,058 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-25 01:34:17,058 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:34:17,059 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-25 01:34:17,059 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-25 01:34:17,059 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:17,059 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-25 01:34:17,059 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:34:17,059 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-25 01:34:17,059 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:34:17,059 INFO ]: Found error trace [2018-06-25 01:34:17,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:34:17,059 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:17,059 INFO ]: Analyzing trace with hash 340751445, now seen corresponding path program 1 times [2018-06-25 01:34:17,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:17,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:17,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:17,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:34:17,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:17,104 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:17,257 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:17,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:17,257 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-25 01:34:17,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:17,348 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:17,351 INFO ]: Computing forward predicates... [2018-06-25 01:34:19,886 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:34:25,909 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:25,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:25,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:34:25,929 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:34:25,929 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:34:25,929 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:25,929 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-25 01:34:26,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:26,071 INFO ]: Finished difference Result 17 states and 38 transitions. [2018-06-25 01:34:26,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:26,072 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:34:26,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:26,072 INFO ]: With dead ends: 17 [2018-06-25 01:34:26,072 INFO ]: Without dead ends: 17 [2018-06-25 01:34:26,072 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:26,073 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:34:26,074 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-25 01:34:26,074 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:34:26,074 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-25 01:34:26,074 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-25 01:34:26,074 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:26,074 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-25 01:34:26,075 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:34:26,075 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-25 01:34:26,075 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:34:26,075 INFO ]: Found error trace [2018-06-25 01:34:26,075 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:34:26,075 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:26,075 INFO ]: Analyzing trace with hash 627042955, now seen corresponding path program 1 times [2018-06-25 01:34:26,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:26,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:26,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:26,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:26,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:26,130 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:26,256 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:26,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:26,256 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-25 01:34:26,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:26,330 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:26,332 INFO ]: Computing forward predicates... [2018-06-25 01:34:27,322 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:27,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:27,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:34:27,342 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:34:27,342 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:34:27,342 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:27,342 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-25 01:34:27,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:27,416 INFO ]: Finished difference Result 17 states and 38 transitions. [2018-06-25 01:34:27,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:34:27,416 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:34:27,416 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:27,416 INFO ]: With dead ends: 17 [2018-06-25 01:34:27,416 INFO ]: Without dead ends: 17 [2018-06-25 01:34:27,417 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:34:27,417 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:34:27,418 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-25 01:34:27,418 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:34:27,418 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-25 01:34:27,418 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-25 01:34:27,419 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:27,419 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-25 01:34:27,419 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:34:27,419 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-25 01:34:27,419 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:34:27,419 INFO ]: Found error trace [2018-06-25 01:34:27,419 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:34:27,419 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:27,419 INFO ]: Analyzing trace with hash 196847113, now seen corresponding path program 3 times [2018-06-25 01:34:27,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:27,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:27,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:27,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:27,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:27,468 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:28,185 WARN ]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 01:34:28,395 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:28,408 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:28,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:28,408 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-25 01:34:28,417 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 01:34:28,499 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 01:34:28,499 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:28,503 INFO ]: Computing forward predicates... [2018-06-25 01:34:32,637 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:32,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:32,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 01:34:32,658 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:34:32,658 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:34:32,658 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:32,658 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-25 01:34:32,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:32,863 INFO ]: Finished difference Result 13 states and 34 transitions. [2018-06-25 01:34:32,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:32,864 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 01:34:32,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:32,864 INFO ]: With dead ends: 13 [2018-06-25 01:34:32,864 INFO ]: Without dead ends: 13 [2018-06-25 01:34:32,864 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 01:34:32,864 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:34:32,865 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 01:34:32,865 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 01:34:32,866 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 01:34:32,866 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 8 [2018-06-25 01:34:32,866 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:32,866 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 01:34:32,866 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:34:32,866 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 01:34:32,866 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:34:32,866 INFO ]: Found error trace [2018-06-25 01:34:32,866 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:34:32,866 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:32,866 INFO ]: Analyzing trace with hash 1084350794, now seen corresponding path program 1 times [2018-06-25 01:34:32,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:32,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:32,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:32,867 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:34:32,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:32,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:33,167 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:33,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:33,167 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-25 01:34:33,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:33,249 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:33,254 INFO ]: Computing forward predicates... [2018-06-25 01:34:34,129 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:34:36,053 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:36,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:36,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 01:34:36,073 INFO ]: Interpolant automaton has 7 states [2018-06-25 01:34:36,073 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 01:34:36,073 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:36,074 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 7 states. [2018-06-25 01:34:36,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:36,251 INFO ]: Finished difference Result 20 states and 41 transitions. [2018-06-25 01:34:36,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:34:36,251 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 01:34:36,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:36,251 INFO ]: With dead ends: 20 [2018-06-25 01:34:36,251 INFO ]: Without dead ends: 20 [2018-06-25 01:34:36,251 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-06-25 01:34:36,251 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 01:34:36,253 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 10. [2018-06-25 01:34:36,253 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 01:34:36,253 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 01:34:36,253 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 8 [2018-06-25 01:34:36,253 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:36,253 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 01:34:36,253 INFO ]: Interpolant automaton has 7 states. [2018-06-25 01:34:36,253 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 01:34:36,254 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:34:36,254 INFO ]: Found error trace [2018-06-25 01:34:36,254 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:34:36,254 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:36,254 INFO ]: Analyzing trace with hash -405554350, now seen corresponding path program 1 times [2018-06-25 01:34:36,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:36,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:36,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:36,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:36,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:36,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:36,555 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:36,556 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:36,556 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-25 01:34:36,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:36,638 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:36,642 INFO ]: Computing forward predicates... [2018-06-25 01:34:38,537 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:38,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:38,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 01:34:38,568 INFO ]: Interpolant automaton has 7 states [2018-06-25 01:34:38,568 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 01:34:38,568 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:38,568 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 7 states. [2018-06-25 01:34:38,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:38,875 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-25 01:34:38,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 01:34:38,875 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 01:34:38,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:38,875 INFO ]: With dead ends: 21 [2018-06-25 01:34:38,875 INFO ]: Without dead ends: 21 [2018-06-25 01:34:38,875 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-25 01:34:38,875 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 01:34:38,877 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 10. [2018-06-25 01:34:38,877 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 01:34:38,877 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 01:34:38,877 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 8 [2018-06-25 01:34:38,877 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:38,877 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 01:34:38,877 INFO ]: Interpolant automaton has 7 states. [2018-06-25 01:34:38,877 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 01:34:38,877 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 01:34:38,877 INFO ]: Found error trace [2018-06-25 01:34:38,877 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 01:34:38,877 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:38,877 INFO ]: Analyzing trace with hash 1805787479, now seen corresponding path program 4 times [2018-06-25 01:34:38,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:38,878 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:38,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:38,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:38,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:38,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:39,201 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:39,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:39,201 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-25 01:34:39,209 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 01:34:39,322 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 01:34:39,322 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:39,328 INFO ]: Computing forward predicates... Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown