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/HOLA/32.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:42:25,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:42:25,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:42:25,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:42:25,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:42:25,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:42:25,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:42:25,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:42:25,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:42:25,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:42:25,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:42:25,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:42:25,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:42:25,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:42:25,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:42:25,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:42:25,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:42:25,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:42:25,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:42:25,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:42:25,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:42:25,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:42:25,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:42:25,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:42:25,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:42:25,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:42:25,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:42:25,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:42:25,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:42:25,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:42:25,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:42:25,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:42:25,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:42:25,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:42:25,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:42:25,879 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:42:25,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:42:25,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:42:25,894 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:42:25,894 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:42:25,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:42:25,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:42:25,896 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:42:25,896 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:42:25,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:42:25,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:42:25,897 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:42:25,897 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:42:25,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:42:25,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:42:25,898 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:42:25,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:42:25,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:42:25,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:42:25,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:42:25,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:42:25,899 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:42:25,901 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:42:25,901 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:42:25,937 INFO ]: Repository-Root is: /tmp [2018-06-24 20:42:25,959 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:42:25,967 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:42:25,968 INFO ]: Initializing SmtParser... [2018-06-24 20:42:25,968 INFO ]: SmtParser initialized [2018-06-24 20:42:25,969 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-24 20:42:25,970 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:42:26,064 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 unknown [2018-06-24 20:42:26,434 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-24 20:42:26,439 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:42:26,445 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:42:26,445 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:42:26,445 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:42:26,446 INFO ]: ChcToBoogie initialized [2018-06-24 20:42:26,458 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,577 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26 Unit [2018-06-24 20:42:26,583 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:42:26,584 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:42:26,584 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:42:26,584 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:42:26,608 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,609 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,618 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,618 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,629 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,632 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,633 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (1/1) ... [2018-06-24 20:42:26,636 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:42:26,636 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:42:26,636 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:42:26,636 INFO ]: RCFGBuilder initialized [2018-06-24 20:42:26,637 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:42:26,656 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:42:26,656 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:42:26,656 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:42:26,656 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:42:26,656 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:42:26,656 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:42:27,255 INFO ]: Using library mode [2018-06-24 20:42:27,255 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:42:27 BoogieIcfgContainer [2018-06-24 20:42:27,255 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:42:27,256 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:42:27,256 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:42:27,258 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:42:27,259 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:42:27" (1/1) ... [2018-06-24 20:42:27,279 INFO ]: Initial Icfg 29 locations, 36 edges [2018-06-24 20:42:27,281 INFO ]: Using Remove infeasible edges [2018-06-24 20:42:27,282 INFO ]: Using Maximize final states [2018-06-24 20:42:27,282 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:42:27,282 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:42:27,287 INFO ]: Using Remove sink states [2018-06-24 20:42:27,288 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:42:27,288 INFO ]: Using Use SBE [2018-06-24 20:42:27,304 INFO ]: SBE split 0 edges [2018-06-24 20:42:27,310 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:42:27,312 INFO ]: 0 new accepting states [2018-06-24 20:42:27,911 INFO ]: Removed 56 edges and 20 locations by large block encoding [2018-06-24 20:42:27,913 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:42:27,914 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-24 20:42:27,914 INFO ]: 0 new accepting states [2018-06-24 20:42:27,914 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:42:27,916 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:42:27,916 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:42:27,917 INFO ]: 0 new accepting states [2018-06-24 20:42:27,917 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:42:27,917 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:42:27,917 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-24 20:42:27,917 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:42:27 BasicIcfg [2018-06-24 20:42:27,917 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:42:27,918 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:42:27,918 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:42:27,923 INFO ]: TraceAbstraction initialized [2018-06-24 20:42:27,923 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:42:26" (1/4) ... [2018-06-24 20:42:27,924 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b1d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:42:27, skipping insertion in model container [2018-06-24 20:42:27,924 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:42:26" (2/4) ... [2018-06-24 20:42:27,924 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b1d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:42:27, skipping insertion in model container [2018-06-24 20:42:27,925 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:42:27" (3/4) ... [2018-06-24 20:42:27,925 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b1d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:42:27, skipping insertion in model container [2018-06-24 20:42:27,925 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:42:27" (4/4) ... [2018-06-24 20:42:27,932 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:42:27,941 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:42:27,950 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:42:28,000 INFO ]: Using default assertion order modulation [2018-06-24 20:42:28,001 INFO ]: Interprodecural is true [2018-06-24 20:42:28,001 INFO ]: Hoare is false [2018-06-24 20:42:28,001 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:42:28,001 INFO ]: Backedges is TWOTRACK [2018-06-24 20:42:28,001 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:42:28,001 INFO ]: Difference is false [2018-06-24 20:42:28,001 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:42:28,001 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:42:28,013 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:42:28,022 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:42:28,022 INFO ]: Found error trace [2018-06-24 20:42:28,023 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:42:28,024 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:28,027 INFO ]: Analyzing trace with hash 34775862, now seen corresponding path program 1 times [2018-06-24 20:42:28,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:28,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:28,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:28,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:28,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:28,146 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:28,319 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:42:28,322 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:28,322 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:28,324 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:28,339 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:28,340 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:28,349 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:42:28,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:28,553 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-24 20:42:28,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:28,555 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:42:28,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:28,568 INFO ]: With dead ends: 9 [2018-06-24 20:42:28,568 INFO ]: Without dead ends: 9 [2018-06-24 20:42:28,571 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:42:28,591 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:42:28,617 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:42:28,618 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:42:28,619 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-24 20:42:28,620 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 5 [2018-06-24 20:42:28,621 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:28,621 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-24 20:42:28,621 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:28,621 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-24 20:42:28,622 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:42:28,622 INFO ]: Found error trace [2018-06-24 20:42:28,622 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:42:28,622 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:28,622 INFO ]: Analyzing trace with hash 1077937518, now seen corresponding path program 1 times [2018-06-24 20:42:28,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:28,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:28,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:28,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:28,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:28,690 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:28,943 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:42:28,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:28,943 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:42:28,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:29,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:29,072 INFO ]: Computing forward predicates... [2018-06-24 20:42:29,280 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:42:29,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:29,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:42:29,311 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:42:29,311 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:42:29,311 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:42:29,311 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 5 states. [2018-06-24 20:42:29,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:29,596 INFO ]: Finished difference Result 11 states and 24 transitions. [2018-06-24 20:42:29,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:42:29,644 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:42:29,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:29,644 INFO ]: With dead ends: 11 [2018-06-24 20:42:29,644 INFO ]: Without dead ends: 11 [2018-06-24 20:42:29,645 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:42:29,645 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:42:29,646 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 20:42:29,646 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:42:29,647 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-06-24 20:42:29,647 INFO ]: Start accepts. Automaton has 9 states and 20 transitions. Word has length 6 [2018-06-24 20:42:29,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:29,647 INFO ]: Abstraction has 9 states and 20 transitions. [2018-06-24 20:42:29,647 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:42:29,647 INFO ]: Start isEmpty. Operand 9 states and 20 transitions. [2018-06-24 20:42:29,647 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:42:29,647 INFO ]: Found error trace [2018-06-24 20:42:29,647 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:42:29,648 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:29,648 INFO ]: Analyzing trace with hash -943789514, now seen corresponding path program 2 times [2018-06-24 20:42:29,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:29,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:29,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:29,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:29,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:29,667 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:29,742 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:29,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:29,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:29,742 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:29,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:29,742 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:29,742 INFO ]: Start difference. First operand 9 states and 20 transitions. Second operand 3 states. [2018-06-24 20:42:29,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:29,889 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-24 20:42:29,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:29,890 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:42:29,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:29,892 INFO ]: With dead ends: 12 [2018-06-24 20:42:29,892 INFO ]: Without dead ends: 12 [2018-06-24 20:42:29,892 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:42:29,893 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:42:29,894 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:42:29,895 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:42:29,895 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-06-24 20:42:29,895 INFO ]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 7 [2018-06-24 20:42:29,895 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:29,895 INFO ]: Abstraction has 10 states and 21 transitions. [2018-06-24 20:42:29,895 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:29,895 INFO ]: Start isEmpty. Operand 10 states and 21 transitions. [2018-06-24 20:42:29,895 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:42:29,895 INFO ]: Found error trace [2018-06-24 20:42:29,896 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:29,896 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:29,896 INFO ]: Analyzing trace with hash -948734820, now seen corresponding path program 1 times [2018-06-24 20:42:29,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:29,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:29,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:29,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:29,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:29,909 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:30,054 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:42:30,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:30,054 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:42:30,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:30,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:30,145 INFO ]: Computing forward predicates... [2018-06-24 20:42:30,396 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:42:30,420 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:42:30,420 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-06-24 20:42:30,420 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:42:30,420 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:42:30,420 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:42:30,420 INFO ]: Start difference. First operand 10 states and 21 transitions. Second operand 7 states. [2018-06-24 20:42:30,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:30,612 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-24 20:42:30,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:42:30,612 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:42:30,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:30,613 INFO ]: With dead ends: 16 [2018-06-24 20:42:30,613 INFO ]: Without dead ends: 12 [2018-06-24 20:42:30,613 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:42:30,613 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:42:30,615 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 20:42:30,615 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:42:30,615 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-24 20:42:30,615 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-24 20:42:30,615 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:30,615 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-24 20:42:30,615 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:42:30,615 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-24 20:42:30,616 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:42:30,616 INFO ]: Found error trace [2018-06-24 20:42:30,616 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:30,616 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:30,616 INFO ]: Analyzing trace with hash -920105669, now seen corresponding path program 1 times [2018-06-24 20:42:30,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:30,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:30,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:30,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:30,912 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:42:30,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:30,912 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) [2018-06-24 20:42:30,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:42:31,016 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:31,020 INFO ]: Computing forward predicates... [2018-06-24 20:42:31,178 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:42:31,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:31,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 20:42:31,198 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:42:31,198 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:42:31,198 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:42:31,198 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 6 states. [2018-06-24 20:42:31,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:31,416 INFO ]: Finished difference Result 16 states and 34 transitions. [2018-06-24 20:42:31,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:42:31,417 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 20:42:31,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:31,417 INFO ]: With dead ends: 16 [2018-06-24 20:42:31,417 INFO ]: Without dead ends: 16 [2018-06-24 20:42:31,418 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:42:31,418 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:42:31,420 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 20:42:31,420 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:42:31,420 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2018-06-24 20:42:31,420 INFO ]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 7 [2018-06-24 20:42:31,420 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:31,420 INFO ]: Abstraction has 13 states and 28 transitions. [2018-06-24 20:42:31,420 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:42:31,420 INFO ]: Start isEmpty. Operand 13 states and 28 transitions. [2018-06-24 20:42:31,421 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:31,421 INFO ]: Found error trace [2018-06-24 20:42:31,421 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:31,421 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:31,421 INFO ]: Analyzing trace with hash 802236628, now seen corresponding path program 1 times [2018-06-24 20:42:31,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:31,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:31,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:31,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:31,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:31,436 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:31,562 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:42:31,562 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:31,562 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:42:31,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:31,651 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:31,655 INFO ]: Computing forward predicates... [2018-06-24 20:42:31,715 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:42:31,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:31,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-06-24 20:42:31,742 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:42:31,742 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:42:31,742 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:42:31,742 INFO ]: Start difference. First operand 13 states and 28 transitions. Second operand 7 states. [2018-06-24 20:42:31,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:31,837 INFO ]: Finished difference Result 19 states and 42 transitions. [2018-06-24 20:42:31,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:42:31,837 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:42:31,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:31,838 INFO ]: With dead ends: 19 [2018-06-24 20:42:31,838 INFO ]: Without dead ends: 19 [2018-06-24 20:42:31,838 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:42:31,838 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:42:31,841 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-24 20:42:31,841 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:42:31,841 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 39 transitions. [2018-06-24 20:42:31,842 INFO ]: Start accepts. Automaton has 17 states and 39 transitions. Word has length 8 [2018-06-24 20:42:31,842 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:31,842 INFO ]: Abstraction has 17 states and 39 transitions. [2018-06-24 20:42:31,842 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:42:31,842 INFO ]: Start isEmpty. Operand 17 states and 39 transitions. [2018-06-24 20:42:31,842 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:31,842 INFO ]: Found error trace [2018-06-24 20:42:31,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:31,842 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:31,842 INFO ]: Analyzing trace with hash 1689740309, now seen corresponding path program 1 times [2018-06-24 20:42:31,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:31,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:31,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:31,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:31,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:31,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:31,940 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:31,940 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:31,940 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:42:31,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,040 INFO ]: Computing forward predicates... [2018-06-24 20:42:32,086 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:42:32,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:32,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-06-24 20:42:32,117 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:42:32,117 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:42:32,117 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:42:32,117 INFO ]: Start difference. First operand 17 states and 39 transitions. Second operand 7 states. [2018-06-24 20:42:32,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:32,195 INFO ]: Finished difference Result 21 states and 49 transitions. [2018-06-24 20:42:32,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:42:32,196 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:42:32,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:32,197 INFO ]: With dead ends: 21 [2018-06-24 20:42:32,197 INFO ]: Without dead ends: 21 [2018-06-24 20:42:32,197 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:42:32,197 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:42:32,200 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-24 20:42:32,200 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:42:32,201 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-06-24 20:42:32,201 INFO ]: Start accepts. Automaton has 19 states and 45 transitions. Word has length 8 [2018-06-24 20:42:32,201 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:32,201 INFO ]: Abstraction has 19 states and 45 transitions. [2018-06-24 20:42:32,201 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:42:32,201 INFO ]: Start isEmpty. Operand 19 states and 45 transitions. [2018-06-24 20:42:32,201 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:32,201 INFO ]: Found error trace [2018-06-24 20:42:32,201 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:32,201 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:32,201 INFO ]: Analyzing trace with hash 1541381129, now seen corresponding path program 2 times [2018-06-24 20:42:32,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:32,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:32,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,256 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:32,256 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:32,256 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:32,256 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:32,256 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:32,256 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:32,256 INFO ]: Start difference. First operand 19 states and 45 transitions. Second operand 3 states. [2018-06-24 20:42:32,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:32,277 INFO ]: Finished difference Result 24 states and 47 transitions. [2018-06-24 20:42:32,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:32,278 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 20:42:32,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:32,278 INFO ]: With dead ends: 24 [2018-06-24 20:42:32,278 INFO ]: Without dead ends: 21 [2018-06-24 20:42:32,278 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:42:32,279 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:42:32,281 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-24 20:42:32,281 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:42:32,281 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 43 transitions. [2018-06-24 20:42:32,281 INFO ]: Start accepts. Automaton has 20 states and 43 transitions. Word has length 8 [2018-06-24 20:42:32,282 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:32,282 INFO ]: Abstraction has 20 states and 43 transitions. [2018-06-24 20:42:32,282 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:32,282 INFO ]: Start isEmpty. Operand 20 states and 43 transitions. [2018-06-24 20:42:32,282 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:32,282 INFO ]: Found error trace [2018-06-24 20:42:32,282 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:32,282 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:32,282 INFO ]: Analyzing trace with hash 1543228171, now seen corresponding path program 1 times [2018-06-24 20:42:32,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:32,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:32,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,283 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:32,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,299 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,364 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:42:32,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:32,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:32,365 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:32,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:32,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:32,365 INFO ]: Start difference. First operand 20 states and 43 transitions. Second operand 3 states. [2018-06-24 20:42:32,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:32,387 INFO ]: Finished difference Result 25 states and 45 transitions. [2018-06-24 20:42:32,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:32,388 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 20:42:32,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:32,389 INFO ]: With dead ends: 25 [2018-06-24 20:42:32,389 INFO ]: Without dead ends: 22 [2018-06-24 20:42:32,389 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:42:32,389 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:42:32,392 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:42:32,392 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:42:32,392 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-06-24 20:42:32,393 INFO ]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 8 [2018-06-24 20:42:32,393 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:32,393 INFO ]: Abstraction has 21 states and 39 transitions. [2018-06-24 20:42:32,393 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:32,393 INFO ]: Start isEmpty. Operand 21 states and 39 transitions. [2018-06-24 20:42:32,393 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:32,393 INFO ]: Found error trace [2018-06-24 20:42:32,393 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:32,393 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:32,394 INFO ]: Analyzing trace with hash 1571857322, now seen corresponding path program 1 times [2018-06-24 20:42:32,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:32,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:32,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,464 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:42:32,464 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:32,464 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:32,464 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:32,464 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:32,464 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:32,465 INFO ]: Start difference. First operand 21 states and 39 transitions. Second operand 3 states. [2018-06-24 20:42:32,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:32,479 INFO ]: Finished difference Result 24 states and 39 transitions. [2018-06-24 20:42:32,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:32,479 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 20:42:32,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:32,480 INFO ]: With dead ends: 24 [2018-06-24 20:42:32,480 INFO ]: Without dead ends: 21 [2018-06-24 20:42:32,480 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:42:32,480 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:42:32,482 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:42:32,482 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:42:32,483 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2018-06-24 20:42:32,483 INFO ]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 8 [2018-06-24 20:42:32,483 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:32,483 INFO ]: Abstraction has 21 states and 34 transitions. [2018-06-24 20:42:32,483 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:32,483 INFO ]: Start isEmpty. Operand 21 states and 34 transitions. [2018-06-24 20:42:32,483 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:42:32,483 INFO ]: Found error trace [2018-06-24 20:42:32,483 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:32,483 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:32,483 INFO ]: Analyzing trace with hash 1600486473, now seen corresponding path program 1 times [2018-06-24 20:42:32,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:32,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:32,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,567 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:42:32,567 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:32,567 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:42:32,574 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:32,669 INFO ]: Computing forward predicates... [2018-06-24 20:42:32,683 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:42:32,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:32,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-06-24 20:42:32,707 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:42:32,707 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:42:32,707 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:42:32,707 INFO ]: Start difference. First operand 21 states and 34 transitions. Second operand 6 states. [2018-06-24 20:42:32,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:32,877 INFO ]: Finished difference Result 30 states and 49 transitions. [2018-06-24 20:42:32,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:42:32,878 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:42:32,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:32,878 INFO ]: With dead ends: 30 [2018-06-24 20:42:32,878 INFO ]: Without dead ends: 30 [2018-06-24 20:42:32,879 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:42:32,879 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:42:32,881 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-24 20:42:32,881 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:42:32,883 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2018-06-24 20:42:32,883 INFO ]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 8 [2018-06-24 20:42:32,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:32,883 INFO ]: Abstraction has 24 states and 42 transitions. [2018-06-24 20:42:32,883 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:42:32,883 INFO ]: Start isEmpty. Operand 24 states and 42 transitions. [2018-06-24 20:42:32,883 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:42:32,883 INFO ]: Found error trace [2018-06-24 20:42:32,883 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:32,883 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:32,884 INFO ]: Analyzing trace with hash -841477168, now seen corresponding path program 1 times [2018-06-24 20:42:32,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:32,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:32,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:32,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:32,913 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:33,030 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:33,030 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:33,030 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:42:33,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:33,124 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:33,129 INFO ]: Computing forward predicates... [2018-06-24 20:42:33,256 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:33,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:33,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 20:42:33,276 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:42:33,276 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:42:33,277 INFO ]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:42:33,277 INFO ]: Start difference. First operand 24 states and 42 transitions. Second operand 8 states. [2018-06-24 20:42:33,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:33,380 INFO ]: Finished difference Result 39 states and 63 transitions. [2018-06-24 20:42:33,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:42:33,380 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:42:33,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:33,381 INFO ]: With dead ends: 39 [2018-06-24 20:42:33,381 INFO ]: Without dead ends: 39 [2018-06-24 20:42:33,381 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:42:33,381 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:42:33,386 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 27. [2018-06-24 20:42:33,386 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:42:33,386 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-24 20:42:33,386 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 9 [2018-06-24 20:42:33,386 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:33,386 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-24 20:42:33,386 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:42:33,387 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-24 20:42:33,387 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:42:33,387 INFO ]: Found error trace [2018-06-24 20:42:33,387 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:33,387 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:33,387 INFO ]: Analyzing trace with hash -1929586399, now seen corresponding path program 1 times [2018-06-24 20:42:33,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:33,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:33,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:33,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:33,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:33,403 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:33,460 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:33,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:42:33,461 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:42:33,461 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:42:33,461 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:42:33,461 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:42:33,461 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2018-06-24 20:42:33,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:33,551 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-24 20:42:33,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:42:33,552 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:42:33,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:33,552 INFO ]: With dead ends: 25 [2018-06-24 20:42:33,552 INFO ]: Without dead ends: 22 [2018-06-24 20:42:33,553 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:42:33,553 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:42:33,554 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:42:33,554 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:42:33,554 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-24 20:42:33,554 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2018-06-24 20:42:33,554 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:33,555 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-24 20:42:33,555 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:42:33,555 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-24 20:42:33,555 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:42:33,555 INFO ]: Found error trace [2018-06-24 20:42:33,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:33,555 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:33,555 INFO ]: Analyzing trace with hash 460608751, now seen corresponding path program 1 times [2018-06-24 20:42:33,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:33,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:33,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:33,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:33,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:33,572 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:33,676 INFO ]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:33,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:33,676 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:42:33,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:33,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:33,772 INFO ]: Computing forward predicates... [2018-06-24 20:42:34,148 INFO ]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:34,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:34,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:42:34,169 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:42:34,169 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:42:34,170 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:42:34,170 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2018-06-24 20:42:34,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:34,280 INFO ]: Finished difference Result 27 states and 33 transitions. [2018-06-24 20:42:34,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:42:34,281 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:42:34,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:34,281 INFO ]: With dead ends: 27 [2018-06-24 20:42:34,281 INFO ]: Without dead ends: 25 [2018-06-24 20:42:34,281 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:42:34,281 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:42:34,283 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-24 20:42:34,283 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:42:34,283 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-24 20:42:34,283 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2018-06-24 20:42:34,283 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:34,283 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-24 20:42:34,283 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:42:34,284 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-24 20:42:34,284 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:42:34,284 INFO ]: Found error trace [2018-06-24 20:42:34,284 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-06-24 20:42:34,284 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:34,284 INFO ]: Analyzing trace with hash 1070191150, now seen corresponding path program 2 times [2018-06-24 20:42:34,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:34,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:34,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:34,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:34,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:34,316 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:34,570 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:34,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:34,570 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:42:34,576 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:42:34,739 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:42:34,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:34,747 INFO ]: Computing forward predicates... [2018-06-24 20:42:34,913 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:34,933 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:34,933 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:42:34,933 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:42:34,934 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:42:34,934 INFO ]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:42:34,934 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 11 states. [2018-06-24 20:42:35,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:35,055 INFO ]: Finished difference Result 31 states and 37 transitions. [2018-06-24 20:42:35,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:42:35,055 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:42:35,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:35,055 INFO ]: With dead ends: 31 [2018-06-24 20:42:35,055 INFO ]: Without dead ends: 31 [2018-06-24 20:42:35,056 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:42:35,056 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:42:35,057 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-24 20:42:35,057 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:42:35,058 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-24 20:42:35,058 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2018-06-24 20:42:35,058 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:35,058 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-24 20:42:35,058 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:42:35,058 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-24 20:42:35,058 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:42:35,058 INFO ]: Found error trace [2018-06-24 20:42:35,058 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:35,059 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:35,059 INFO ]: Analyzing trace with hash 422101179, now seen corresponding path program 2 times [2018-06-24 20:42:35,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:35,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:35,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:35,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:35,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:35,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:35,304 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:35,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:35,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:42:35,319 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:42:35,430 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:42:35,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:35,436 INFO ]: Computing forward predicates... [2018-06-24 20:42:35,588 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:35,611 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:35,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:42:35,612 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:42:35,612 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:42:35,613 INFO ]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:42:35,613 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 12 states. [2018-06-24 20:42:35,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:35,881 INFO ]: Finished difference Result 33 states and 39 transitions. [2018-06-24 20:42:35,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:42:35,881 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 20:42:35,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:35,881 INFO ]: With dead ends: 33 [2018-06-24 20:42:35,881 INFO ]: Without dead ends: 31 [2018-06-24 20:42:35,881 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:42:35,881 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:42:35,883 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-06-24 20:42:35,883 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:42:35,884 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-24 20:42:35,884 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2018-06-24 20:42:35,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:35,884 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-24 20:42:35,884 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:42:35,884 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-24 20:42:35,884 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:42:35,884 INFO ]: Found error trace [2018-06-24 20:42:35,884 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2018-06-24 20:42:35,884 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:35,884 INFO ]: Analyzing trace with hash 314707728, now seen corresponding path program 3 times [2018-06-24 20:42:35,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:35,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:35,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:35,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:35,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:35,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:36,883 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:36,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:36,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:42:36,912 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:42:37,100 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:42:37,100 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:37,111 INFO ]: Computing forward predicates... [2018-06-24 20:42:37,316 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:37,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:37,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:42:37,336 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:42:37,336 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:42:37,336 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:42:37,336 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 14 states. [2018-06-24 20:42:37,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:37,597 INFO ]: Finished difference Result 37 states and 43 transitions. [2018-06-24 20:42:37,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:42:37,598 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 20:42:37,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:37,598 INFO ]: With dead ends: 37 [2018-06-24 20:42:37,598 INFO ]: Without dead ends: 37 [2018-06-24 20:42:37,598 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=348, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:42:37,598 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:42:37,600 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-24 20:42:37,600 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:42:37,600 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-24 20:42:37,601 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-06-24 20:42:37,601 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:37,601 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-24 20:42:37,601 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:42:37,601 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-24 20:42:37,601 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:42:37,601 INFO ]: Found error trace [2018-06-24 20:42:37,601 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:37,601 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:37,601 INFO ]: Analyzing trace with hash -708241, now seen corresponding path program 3 times [2018-06-24 20:42:37,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:37,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:37,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:37,602 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:37,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:37,630 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:37,880 INFO ]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:37,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:37,880 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:42:37,886 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:42:38,050 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:42:38,050 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:38,060 INFO ]: Computing forward predicates... [2018-06-24 20:42:38,359 INFO ]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:38,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:38,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:42:38,386 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:42:38,386 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:42:38,387 INFO ]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:42:38,387 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 15 states. [2018-06-24 20:42:38,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:38,729 INFO ]: Finished difference Result 39 states and 45 transitions. [2018-06-24 20:42:38,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:42:38,730 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:42:38,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:38,730 INFO ]: With dead ends: 39 [2018-06-24 20:42:38,730 INFO ]: Without dead ends: 37 [2018-06-24 20:42:38,731 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=445, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:42:38,731 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:42:38,733 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-06-24 20:42:38,733 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:42:38,733 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-24 20:42:38,733 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2018-06-24 20:42:38,734 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:38,734 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-24 20:42:38,734 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:42:38,734 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-24 20:42:38,734 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:42:38,734 INFO ]: Found error trace [2018-06-24 20:42:38,734 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-06-24 20:42:38,734 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:38,734 INFO ]: Analyzing trace with hash -663286034, now seen corresponding path program 4 times [2018-06-24 20:42:38,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:38,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:38,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:38,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:38,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:38,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:39,008 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:39,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:39,008 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:42:39,014 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:42:39,173 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:42:39,173 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:39,185 INFO ]: Computing forward predicates... [2018-06-24 20:42:39,570 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:39,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:39,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:42:39,590 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:42:39,590 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:42:39,590 INFO ]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:42:39,590 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 17 states. [2018-06-24 20:42:39,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:39,835 INFO ]: Finished difference Result 43 states and 49 transitions. [2018-06-24 20:42:39,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:42:39,866 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:42:39,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:39,866 INFO ]: With dead ends: 43 [2018-06-24 20:42:39,866 INFO ]: Without dead ends: 43 [2018-06-24 20:42:39,866 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=557, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:42:39,866 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:42:39,868 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-24 20:42:39,868 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:42:39,868 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-24 20:42:39,868 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-06-24 20:42:39,869 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:39,869 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-24 20:42:39,869 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:42:39,869 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-24 20:42:39,869 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:42:39,869 INFO ]: Found error trace [2018-06-24 20:42:39,869 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:39,869 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:39,869 INFO ]: Analyzing trace with hash 1222939707, now seen corresponding path program 4 times [2018-06-24 20:42:39,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:39,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:39,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:39,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:39,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:39,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:40,423 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:42:40,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:40,423 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:42:40,428 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:42:40,606 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:42:40,606 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:40,616 INFO ]: Computing forward predicates... [2018-06-24 20:42:41,668 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:42:41,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:41,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:42:41,699 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:42:41,699 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:42:41,699 INFO ]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:42:41,699 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 18 states. [2018-06-24 20:42:42,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:42,305 INFO ]: Finished difference Result 45 states and 51 transitions. [2018-06-24 20:42:42,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:42:42,305 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:42:42,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:42,306 INFO ]: With dead ends: 45 [2018-06-24 20:42:42,306 INFO ]: Without dead ends: 43 [2018-06-24 20:42:42,306 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=379, Invalid=677, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:42:42,306 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:42:42,308 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-06-24 20:42:42,308 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:42:42,309 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-24 20:42:42,309 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-06-24 20:42:42,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:42,309 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-24 20:42:42,309 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:42:42,309 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-24 20:42:42,313 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:42:42,313 INFO ]: Found error trace [2018-06-24 20:42:42,313 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1] [2018-06-24 20:42:42,314 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:42,314 INFO ]: Analyzing trace with hash 982686288, now seen corresponding path program 5 times [2018-06-24 20:42:42,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:42,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:42,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:42,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:42,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:42,351 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:42,614 INFO ]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:42,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:42,614 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:42:42,620 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:42:42,850 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:42:42,850 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:42,863 INFO ]: Computing forward predicates... [2018-06-24 20:42:43,117 INFO ]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:43,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:43,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 20:42:43,138 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:42:43,138 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:42:43,138 INFO ]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:42:43,138 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 20 states. [2018-06-24 20:42:43,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:43,534 INFO ]: Finished difference Result 49 states and 55 transitions. [2018-06-24 20:42:43,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:42:43,535 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 20:42:43,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:43,536 INFO ]: With dead ends: 49 [2018-06-24 20:42:43,536 INFO ]: Without dead ends: 49 [2018-06-24 20:42:43,536 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:42:43,536 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:42:43,539 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-24 20:42:43,539 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:42:43,539 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-06-24 20:42:43,539 INFO ]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-06-24 20:42:43,539 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:43,539 INFO ]: Abstraction has 45 states and 49 transitions. [2018-06-24 20:42:43,540 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:42:43,540 INFO ]: Start isEmpty. Operand 45 states and 49 transitions. [2018-06-24 20:42:43,545 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:42:43,545 INFO ]: Found error trace [2018-06-24 20:42:43,545 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:43,546 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:43,546 INFO ]: Analyzing trace with hash -763449873, now seen corresponding path program 5 times [2018-06-24 20:42:43,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:43,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:43,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:43,546 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:43,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:43,576 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:43,834 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:43,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:43,834 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:42:43,840 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:42:44,066 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:42:44,066 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:44,079 INFO ]: Computing forward predicates... [2018-06-24 20:42:44,383 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:44,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:44,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:42:44,404 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:42:44,404 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:42:44,404 INFO ]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:42:44,404 INFO ]: Start difference. First operand 45 states and 49 transitions. Second operand 21 states. [2018-06-24 20:42:44,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:44,710 INFO ]: Finished difference Result 51 states and 57 transitions. [2018-06-24 20:42:44,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:42:44,712 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:42:44,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:44,712 INFO ]: With dead ends: 51 [2018-06-24 20:42:44,712 INFO ]: Without dead ends: 49 [2018-06-24 20:42:44,713 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=958, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:42:44,713 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:42:44,847 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-06-24 20:42:44,848 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:42:44,884 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-24 20:42:44,884 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-06-24 20:42:44,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:44,884 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-24 20:42:44,884 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:42:44,884 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-24 20:42:44,885 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:42:44,885 INFO ]: Found error trace [2018-06-24 20:42:44,885 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1] [2018-06-24 20:42:44,885 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:44,886 INFO ]: Analyzing trace with hash 502512558, now seen corresponding path program 6 times [2018-06-24 20:42:44,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:44,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:44,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:44,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:44,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:44,916 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:45,928 INFO ]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:45,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:45,928 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) [2018-06-24 20:42:45,945 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:42:46,194 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-24 20:42:46,194 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:46,206 INFO ]: Computing forward predicates... [2018-06-24 20:42:46,444 INFO ]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:46,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:46,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:42:46,465 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:42:46,465 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:42:46,465 INFO ]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:42:46,465 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 23 states. [2018-06-24 20:42:47,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:47,571 INFO ]: Finished difference Result 55 states and 61 transitions. [2018-06-24 20:42:47,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:42:47,572 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 20:42:47,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:47,572 INFO ]: With dead ends: 55 [2018-06-24 20:42:47,572 INFO ]: Without dead ends: 55 [2018-06-24 20:42:47,573 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=600, Invalid=1122, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:42:47,573 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:42:47,575 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-24 20:42:47,575 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 20:42:47,575 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-06-24 20:42:47,575 INFO ]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 24 [2018-06-24 20:42:47,575 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:47,575 INFO ]: Abstraction has 51 states and 55 transitions. [2018-06-24 20:42:47,575 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:42:47,575 INFO ]: Start isEmpty. Operand 51 states and 55 transitions. [2018-06-24 20:42:47,585 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:42:47,585 INFO ]: Found error trace [2018-06-24 20:42:47,585 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:47,585 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:47,585 INFO ]: Analyzing trace with hash -1236023365, now seen corresponding path program 6 times [2018-06-24 20:42:47,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:47,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:47,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:47,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:47,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:47,624 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:48,586 INFO ]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:48,586 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:48,586 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:42:48,591 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:42:48,836 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-24 20:42:48,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:48,850 INFO ]: Computing forward predicates... [2018-06-24 20:42:49,711 INFO ]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:49,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:49,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 20:42:49,733 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:42:49,733 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:42:49,733 INFO ]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:42:49,734 INFO ]: Start difference. First operand 51 states and 55 transitions. Second operand 24 states. [2018-06-24 20:42:50,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:50,401 INFO ]: Finished difference Result 57 states and 63 transitions. [2018-06-24 20:42:50,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:42:50,401 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-24 20:42:50,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:50,402 INFO ]: With dead ends: 57 [2018-06-24 20:42:50,402 INFO ]: Without dead ends: 55 [2018-06-24 20:42:50,402 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=692, Invalid=1288, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:42:50,402 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:42:50,404 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-06-24 20:42:50,404 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 20:42:50,405 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-06-24 20:42:50,405 INFO ]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 25 [2018-06-24 20:42:50,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:50,405 INFO ]: Abstraction has 54 states and 58 transitions. [2018-06-24 20:42:50,405 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:42:50,405 INFO ]: Start isEmpty. Operand 54 states and 58 transitions. [2018-06-24 20:42:50,407 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:42:50,407 INFO ]: Found error trace [2018-06-24 20:42:50,407 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1] [2018-06-24 20:42:50,407 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:50,407 INFO ]: Analyzing trace with hash -2111982192, now seen corresponding path program 7 times [2018-06-24 20:42:50,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:50,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:50,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:50,408 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:50,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:50,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:50,991 INFO ]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:50,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:50,991 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:42:50,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:51,265 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:51,281 INFO ]: Computing forward predicates... [2018-06-24 20:42:51,755 INFO ]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:51,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:51,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 20:42:51,776 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:42:51,776 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:42:51,776 INFO ]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:42:51,776 INFO ]: Start difference. First operand 54 states and 58 transitions. Second operand 26 states. [2018-06-24 20:42:52,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:52,163 INFO ]: Finished difference Result 61 states and 67 transitions. [2018-06-24 20:42:52,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:42:52,163 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:42:52,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:52,163 INFO ]: With dead ends: 61 [2018-06-24 20:42:52,163 INFO ]: Without dead ends: 61 [2018-06-24 20:42:52,164 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=778, Invalid=1478, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:42:52,164 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:42:52,165 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-06-24 20:42:52,165 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 20:42:52,165 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-06-24 20:42:52,165 INFO ]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 27 [2018-06-24 20:42:52,166 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:52,166 INFO ]: Abstraction has 57 states and 61 transitions. [2018-06-24 20:42:52,166 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:42:52,166 INFO ]: Start isEmpty. Operand 57 states and 61 transitions. [2018-06-24 20:42:52,166 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:42:52,166 INFO ]: Found error trace [2018-06-24 20:42:52,166 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:52,166 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:52,166 INFO ]: Analyzing trace with hash -770127249, now seen corresponding path program 7 times [2018-06-24 20:42:52,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:52,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:52,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:52,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:52,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:52,201 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:52,873 INFO ]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:52,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:52,873 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:42:52,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:53,154 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:53,168 INFO ]: Computing forward predicates... [2018-06-24 20:42:53,484 INFO ]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:53,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:53,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:42:53,506 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:42:53,507 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:42:53,507 INFO ]: CoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:42:53,507 INFO ]: Start difference. First operand 57 states and 61 transitions. Second operand 27 states. [2018-06-24 20:42:53,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:53,885 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-24 20:42:53,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:42:53,885 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 20:42:53,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:53,885 INFO ]: With dead ends: 63 [2018-06-24 20:42:53,885 INFO ]: Without dead ends: 61 [2018-06-24 20:42:53,886 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=883, Invalid=1667, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:42:53,886 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:42:53,887 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-06-24 20:42:53,887 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:42:53,888 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-06-24 20:42:53,888 INFO ]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-06-24 20:42:53,888 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:53,888 INFO ]: Abstraction has 60 states and 64 transitions. [2018-06-24 20:42:53,888 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:42:53,888 INFO ]: Start isEmpty. Operand 60 states and 64 transitions. [2018-06-24 20:42:53,888 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:42:53,888 INFO ]: Found error trace [2018-06-24 20:42:53,889 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 20:42:53,889 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:53,889 INFO ]: Analyzing trace with hash -1293166482, now seen corresponding path program 8 times [2018-06-24 20:42:53,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:53,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:53,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:53,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:42:53,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:53,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:54,483 INFO ]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:54,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:54,483 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:42:54,488 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:42:54,767 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:42:54,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:54,789 INFO ]: Computing forward predicates... [2018-06-24 20:42:55,411 INFO ]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:55,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:55,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:42:55,511 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:42:55,511 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:42:55,511 INFO ]: CoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:42:55,511 INFO ]: Start difference. First operand 60 states and 64 transitions. Second operand 29 states. [2018-06-24 20:42:55,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:55,989 INFO ]: Finished difference Result 67 states and 73 transitions. [2018-06-24 20:42:55,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:42:55,989 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 20:42:55,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:55,989 INFO ]: With dead ends: 67 [2018-06-24 20:42:55,989 INFO ]: Without dead ends: 67 [2018-06-24 20:42:55,990 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 25 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=979, Invalid=1883, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:42:55,990 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:42:55,992 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-06-24 20:42:55,992 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 20:42:55,993 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-06-24 20:42:55,993 INFO ]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 30 [2018-06-24 20:42:55,993 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:55,993 INFO ]: Abstraction has 63 states and 67 transitions. [2018-06-24 20:42:55,993 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:42:55,993 INFO ]: Start isEmpty. Operand 63 states and 67 transitions. [2018-06-24 20:42:55,993 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:42:55,993 INFO ]: Found error trace [2018-06-24 20:42:55,993 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:55,993 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:55,994 INFO ]: Analyzing trace with hash 1701731131, now seen corresponding path program 8 times [2018-06-24 20:42:55,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:55,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:55,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:55,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:55,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:56,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:56,447 INFO ]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:56,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:56,447 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:42:56,455 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:42:56,747 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:42:56,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:56,764 INFO ]: Computing forward predicates... [2018-06-24 20:42:57,316 INFO ]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:57,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:57,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-24 20:42:57,338 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:42:57,338 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:42:57,338 INFO ]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:42:57,338 INFO ]: Start difference. First operand 63 states and 67 transitions. Second operand 30 states. [2018-06-24 20:42:57,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:57,850 INFO ]: Finished difference Result 69 states and 75 transitions. [2018-06-24 20:42:57,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:42:57,850 INFO ]: Start accepts. Automaton has 30 states. Word has length 31 [2018-06-24 20:42:57,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:57,850 INFO ]: With dead ends: 69 [2018-06-24 20:42:57,850 INFO ]: Without dead ends: 67 [2018-06-24 20:42:57,851 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1097, Invalid=2095, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:42:57,851 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:42:57,852 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-06-24 20:42:57,852 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 20:42:57,852 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-06-24 20:42:57,852 INFO ]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 31 [2018-06-24 20:42:57,853 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:57,853 INFO ]: Abstraction has 66 states and 70 transitions. [2018-06-24 20:42:57,853 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:42:57,853 INFO ]: Start isEmpty. Operand 66 states and 70 transitions. [2018-06-24 20:42:57,853 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:42:57,853 INFO ]: Found error trace [2018-06-24 20:42:57,853 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1] [2018-06-24 20:42:57,853 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:57,853 INFO ]: Analyzing trace with hash 926376144, now seen corresponding path program 9 times [2018-06-24 20:42:57,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:57,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:57,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:57,854 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:57,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:57,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:58,424 INFO ]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:58,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:58,424 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:42:58,430 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:42:58,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:42:58,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:58,852 INFO ]: Computing forward predicates... [2018-06-24 20:42:59,264 INFO ]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:59,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:59,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 20:42:59,286 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:42:59,286 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:42:59,286 INFO ]: CoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:42:59,286 INFO ]: Start difference. First operand 66 states and 70 transitions. Second operand 32 states. [2018-06-24 20:42:59,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:42:59,828 INFO ]: Finished difference Result 73 states and 79 transitions. [2018-06-24 20:42:59,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:42:59,829 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-24 20:42:59,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:42:59,829 INFO ]: With dead ends: 73 [2018-06-24 20:42:59,829 INFO ]: Without dead ends: 73 [2018-06-24 20:42:59,830 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 5 SyntacticMatches, 28 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1203, Invalid=2337, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:42:59,830 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 20:42:59,831 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-06-24 20:42:59,831 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 20:42:59,832 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-06-24 20:42:59,832 INFO ]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2018-06-24 20:42:59,832 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:42:59,832 INFO ]: Abstraction has 69 states and 73 transitions. [2018-06-24 20:42:59,832 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:42:59,832 INFO ]: Start isEmpty. Operand 69 states and 73 transitions. [2018-06-24 20:42:59,832 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:42:59,832 INFO ]: Found error trace [2018-06-24 20:42:59,832 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:42:59,832 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:42:59,832 INFO ]: Analyzing trace with hash -674527505, now seen corresponding path program 9 times [2018-06-24 20:42:59,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:42:59,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:42:59,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:59,833 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:42:59,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:42:59,866 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:00,318 INFO ]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:00,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:00,318 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:43:00,324 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:43:00,753 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-24 20:43:00,753 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:00,774 INFO ]: Computing forward predicates... [2018-06-24 20:43:01,217 INFO ]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:01,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:01,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:43:01,239 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:43:01,240 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:43:01,240 INFO ]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:43:01,240 INFO ]: Start difference. First operand 69 states and 73 transitions. Second operand 33 states. [2018-06-24 20:43:01,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:01,905 INFO ]: Finished difference Result 75 states and 81 transitions. [2018-06-24 20:43:01,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:43:01,906 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 20:43:01,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:01,906 INFO ]: With dead ends: 75 [2018-06-24 20:43:01,906 INFO ]: Without dead ends: 73 [2018-06-24 20:43:01,907 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 5 SyntacticMatches, 29 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1334, Invalid=2572, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:43:01,907 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 20:43:01,909 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-06-24 20:43:01,909 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-24 20:43:01,909 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-06-24 20:43:01,909 INFO ]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 34 [2018-06-24 20:43:01,909 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:01,909 INFO ]: Abstraction has 72 states and 76 transitions. [2018-06-24 20:43:01,909 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:43:01,909 INFO ]: Start isEmpty. Operand 72 states and 76 transitions. [2018-06-24 20:43:01,910 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:43:01,910 INFO ]: Found error trace [2018-06-24 20:43:01,910 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2018-06-24 20:43:01,910 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:01,910 INFO ]: Analyzing trace with hash -1995741906, now seen corresponding path program 10 times [2018-06-24 20:43:01,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:01,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:01,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:01,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:01,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:01,945 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:02,946 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:43:02,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:02,946 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:43:02,956 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:43:03,329 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:43:03,329 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:03,357 INFO ]: Computing forward predicates... [2018-06-24 20:43:04,007 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:43:04,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:04,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:43:04,030 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:43:04,030 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:43:04,030 INFO ]: CoverageRelationStatistics Valid=365, Invalid=825, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:43:04,031 INFO ]: Start difference. First operand 72 states and 76 transitions. Second operand 35 states. [2018-06-24 20:43:04,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:04,712 INFO ]: Finished difference Result 79 states and 85 transitions. [2018-06-24 20:43:04,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:43:04,712 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 20:43:04,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:04,712 INFO ]: With dead ends: 79 [2018-06-24 20:43:04,712 INFO ]: Without dead ends: 79 [2018-06-24 20:43:04,713 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1450, Invalid=2840, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:43:04,713 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 20:43:04,715 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-06-24 20:43:04,715 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 20:43:04,715 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-06-24 20:43:04,715 INFO ]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2018-06-24 20:43:04,715 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:04,715 INFO ]: Abstraction has 75 states and 79 transitions. [2018-06-24 20:43:04,715 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:43:04,716 INFO ]: Start isEmpty. Operand 75 states and 79 transitions. [2018-06-24 20:43:04,716 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:43:04,716 INFO ]: Found error trace [2018-06-24 20:43:04,716 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:43:04,716 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:04,716 INFO ]: Analyzing trace with hash -2144579909, now seen corresponding path program 10 times [2018-06-24 20:43:04,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:04,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:04,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:04,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:04,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:04,755 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:05,353 INFO ]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:05,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:05,353 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:43:05,359 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:43:05,739 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:43:05,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:05,768 INFO ]: Computing forward predicates... [2018-06-24 20:43:06,332 INFO ]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:06,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:06,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 20:43:06,355 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:43:06,355 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:43:06,356 INFO ]: CoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:43:06,356 INFO ]: Start difference. First operand 75 states and 79 transitions. Second operand 36 states. [2018-06-24 20:43:07,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:07,127 INFO ]: Finished difference Result 81 states and 87 transitions. [2018-06-24 20:43:07,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:43:07,127 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-24 20:43:07,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:07,127 INFO ]: With dead ends: 81 [2018-06-24 20:43:07,127 INFO ]: Without dead ends: 79 [2018-06-24 20:43:07,128 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 5 SyntacticMatches, 32 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1594, Invalid=3098, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:43:07,128 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 20:43:07,130 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-06-24 20:43:07,130 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 20:43:07,133 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-06-24 20:43:07,133 INFO ]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2018-06-24 20:43:07,134 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:07,134 INFO ]: Abstraction has 78 states and 82 transitions. [2018-06-24 20:43:07,134 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:43:07,134 INFO ]: Start isEmpty. Operand 78 states and 82 transitions. [2018-06-24 20:43:07,135 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:43:07,135 INFO ]: Found error trace [2018-06-24 20:43:07,135 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1] [2018-06-24 20:43:07,135 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:07,135 INFO ]: Analyzing trace with hash -122446832, now seen corresponding path program 11 times [2018-06-24 20:43:07,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:07,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:07,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:07,136 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:07,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:07,175 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:07,708 INFO ]: Checked inductivity of 331 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:07,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:07,708 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:43:07,714 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:43:08,313 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-24 20:43:08,313 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:08,357 INFO ]: Computing forward predicates... [2018-06-24 20:43:09,167 INFO ]: Checked inductivity of 331 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:09,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:09,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-24 20:43:09,190 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:43:09,190 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:43:09,190 INFO ]: CoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:43:09,191 INFO ]: Start difference. First operand 78 states and 82 transitions. Second operand 38 states. [2018-06-24 20:43:09,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:09,966 INFO ]: Finished difference Result 85 states and 91 transitions. [2018-06-24 20:43:09,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:43:09,966 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-24 20:43:09,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:09,966 INFO ]: With dead ends: 85 [2018-06-24 20:43:09,966 INFO ]: Without dead ends: 85 [2018-06-24 20:43:09,967 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 34 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1720, Invalid=3392, Unknown=0, NotChecked=0, Total=5112 [2018-06-24 20:43:09,968 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 20:43:09,969 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-06-24 20:43:09,969 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-24 20:43:09,970 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-06-24 20:43:09,970 INFO ]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 39 [2018-06-24 20:43:09,970 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:09,970 INFO ]: Abstraction has 81 states and 85 transitions. [2018-06-24 20:43:09,970 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:43:09,970 INFO ]: Start isEmpty. Operand 81 states and 85 transitions. [2018-06-24 20:43:09,970 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:43:09,970 INFO ]: Found error trace [2018-06-24 20:43:09,970 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:43:09,970 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:09,970 INFO ]: Analyzing trace with hash -694230161, now seen corresponding path program 11 times [2018-06-24 20:43:09,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:09,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:09,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:09,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:09,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:10,004 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:11,243 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:11,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:11,244 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:43:11,250 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:43:11,875 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 20:43:11,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:11,917 INFO ]: Computing forward predicates... [2018-06-24 20:43:12,713 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:12,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:12,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-24 20:43:12,737 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:43:12,737 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:43:12,737 INFO ]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:43:12,737 INFO ]: Start difference. First operand 81 states and 85 transitions. Second operand 39 states. [2018-06-24 20:43:13,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:13,573 INFO ]: Finished difference Result 87 states and 93 transitions. [2018-06-24 20:43:13,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:43:13,573 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-24 20:43:13,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:13,573 INFO ]: With dead ends: 87 [2018-06-24 20:43:13,573 INFO ]: Without dead ends: 85 [2018-06-24 20:43:13,575 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 5 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1877, Invalid=3673, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 20:43:13,575 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 20:43:13,577 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-06-24 20:43:13,577 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 20:43:13,577 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-06-24 20:43:13,577 INFO ]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 40 [2018-06-24 20:43:13,577 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:13,577 INFO ]: Abstraction has 84 states and 88 transitions. [2018-06-24 20:43:13,577 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:43:13,577 INFO ]: Start isEmpty. Operand 84 states and 88 transitions. [2018-06-24 20:43:13,578 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 20:43:13,578 INFO ]: Found error trace [2018-06-24 20:43:13,578 INFO ]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1] [2018-06-24 20:43:13,578 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:13,578 INFO ]: Analyzing trace with hash -1593941522, now seen corresponding path program 12 times [2018-06-24 20:43:13,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:13,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:13,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:13,578 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:13,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:13,679 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:14,516 INFO ]: Checked inductivity of 391 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:14,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:14,516 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:43:14,521 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:43:15,166 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-24 20:43:15,166 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:15,196 INFO ]: Computing forward predicates... [2018-06-24 20:43:16,046 INFO ]: Checked inductivity of 391 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:16,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:16,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-24 20:43:16,070 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:43:16,070 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:43:16,070 INFO ]: CoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:43:16,070 INFO ]: Start difference. First operand 84 states and 88 transitions. Second operand 41 states. [2018-06-24 20:43:16,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:16,940 INFO ]: Finished difference Result 91 states and 97 transitions. [2018-06-24 20:43:16,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 20:43:16,975 INFO ]: Start accepts. Automaton has 41 states. Word has length 42 [2018-06-24 20:43:16,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:16,975 INFO ]: With dead ends: 91 [2018-06-24 20:43:16,975 INFO ]: Without dead ends: 91 [2018-06-24 20:43:16,976 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1897 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2013, Invalid=3993, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:43:16,976 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-24 20:43:16,978 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-06-24 20:43:16,978 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 20:43:16,978 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-06-24 20:43:16,978 INFO ]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 42 [2018-06-24 20:43:16,978 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:16,978 INFO ]: Abstraction has 87 states and 91 transitions. [2018-06-24 20:43:16,978 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:43:16,978 INFO ]: Start isEmpty. Operand 87 states and 91 transitions. [2018-06-24 20:43:16,979 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 20:43:16,979 INFO ]: Found error trace [2018-06-24 20:43:16,979 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:43:16,979 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:16,979 INFO ]: Analyzing trace with hash -695885253, now seen corresponding path program 12 times [2018-06-24 20:43:16,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:16,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:16,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:16,980 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:16,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:17,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:17,805 INFO ]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:17,805 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:17,805 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:43:17,811 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:43:18,394 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-24 20:43:18,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:18,427 INFO ]: Computing forward predicates... [2018-06-24 20:43:19,385 INFO ]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:19,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:19,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-06-24 20:43:19,409 INFO ]: Interpolant automaton has 42 states [2018-06-24 20:43:19,409 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 20:43:19,409 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:43:19,409 INFO ]: Start difference. First operand 87 states and 91 transitions. Second operand 42 states. [2018-06-24 20:43:20,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:20,300 INFO ]: Finished difference Result 93 states and 99 transitions. [2018-06-24 20:43:20,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 20:43:20,300 INFO ]: Start accepts. Automaton has 42 states. Word has length 43 [2018-06-24 20:43:20,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:20,300 INFO ]: With dead ends: 93 [2018-06-24 20:43:20,301 INFO ]: Without dead ends: 91 [2018-06-24 20:43:20,301 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 5 SyntacticMatches, 38 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2183, Invalid=4297, Unknown=0, NotChecked=0, Total=6480 [2018-06-24 20:43:20,301 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-24 20:43:20,303 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-06-24 20:43:20,303 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-24 20:43:20,304 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-06-24 20:43:20,304 INFO ]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 43 [2018-06-24 20:43:20,304 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:20,304 INFO ]: Abstraction has 90 states and 94 transitions. [2018-06-24 20:43:20,304 INFO ]: Interpolant automaton has 42 states. [2018-06-24 20:43:20,304 INFO ]: Start isEmpty. Operand 90 states and 94 transitions. [2018-06-24 20:43:20,305 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:43:20,305 INFO ]: Found error trace [2018-06-24 20:43:20,305 INFO ]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1] [2018-06-24 20:43:20,305 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:20,305 INFO ]: Analyzing trace with hash -161061040, now seen corresponding path program 13 times [2018-06-24 20:43:20,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:20,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:20,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:20,305 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:43:20,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:20,373 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:21,046 INFO ]: Checked inductivity of 456 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:21,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:43:21,046 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:43:21,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:43:21,497 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:43:21,529 INFO ]: Computing forward predicates... [2018-06-24 20:43:22,360 INFO ]: Checked inductivity of 456 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:43:22,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:43:22,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-06-24 20:43:22,383 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:43:22,384 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:43:22,384 INFO ]: CoverageRelationStatistics Valid=569, Invalid=1323, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:43:22,384 INFO ]: Start difference. First operand 90 states and 94 transitions. Second operand 44 states. [2018-06-24 20:43:23,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:43:23,407 INFO ]: Finished difference Result 97 states and 103 transitions. [2018-06-24 20:43:23,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-24 20:43:23,407 INFO ]: Start accepts. Automaton has 44 states. Word has length 45 [2018-06-24 20:43:23,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:43:23,408 INFO ]: With dead ends: 97 [2018-06-24 20:43:23,408 INFO ]: Without dead ends: 97 [2018-06-24 20:43:23,408 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 5 SyntacticMatches, 40 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2329, Invalid=4643, Unknown=0, NotChecked=0, Total=6972 [2018-06-24 20:43:23,408 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 20:43:23,410 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-06-24 20:43:23,411 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-24 20:43:23,411 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-06-24 20:43:23,411 INFO ]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 45 [2018-06-24 20:43:23,411 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:43:23,411 INFO ]: Abstraction has 93 states and 97 transitions. [2018-06-24 20:43:23,411 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:43:23,411 INFO ]: Start isEmpty. Operand 93 states and 97 transitions. [2018-06-24 20:43:23,412 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:43:23,412 INFO ]: Found error trace [2018-06-24 20:43:23,412 INFO ]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:43:23,412 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:43:23,412 INFO ]: Analyzing trace with hash 1536876527, now seen corresponding path program 13 times [2018-06-24 20:43:23,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:43:23,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:43:23,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:23,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:43:23,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:43:23,462 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 20:43:23,932 WARN ]: Verification canceled [2018-06-24 20:43:23,935 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:43:23,936 WARN ]: Timeout [2018-06-24 20:43:23,936 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:43:23 BasicIcfg [2018-06-24 20:43:23,936 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:43:23,937 INFO ]: Toolchain (without parser) took 57497.38 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 813.2 MB). Free memory was 248.5 MB in the beginning and 884.0 MB in the end (delta: -635.5 MB). Peak memory consumption was 177.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:43:23,938 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:43:23,939 INFO ]: ChcToBoogie took 138.39 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 245.5 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:43:23,939 INFO ]: Boogie Preprocessor took 51.63 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 243.5 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:43:23,939 INFO ]: RCFGBuilder took 619.15 ms. Allocated memory is still 304.1 MB. Free memory was 243.5 MB in the beginning and 215.4 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:43:23,939 INFO ]: BlockEncodingV2 took 661.62 ms. Allocated memory was 304.1 MB in the beginning and 324.5 MB in the end (delta: 20.4 MB). Free memory was 215.4 MB in the beginning and 278.6 MB in the end (delta: -63.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:43:23,940 INFO ]: TraceAbstraction took 56017.57 ms. Allocated memory was 324.5 MB in the beginning and 1.1 GB in the end (delta: 792.7 MB). Free memory was 278.6 MB in the beginning and 884.0 MB in the end (delta: -605.4 MB). Peak memory consumption was 187.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:43:23,945 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 29 locations, 36 edges - StatisticsResult: Encoded RCFG 7 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 138.39 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.63 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 619.15 ms. Allocated memory is still 304.1 MB. Free memory was 243.5 MB in the beginning and 215.4 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 661.62 ms. Allocated memory was 304.1 MB in the beginning and 324.5 MB in the end (delta: 20.4 MB). Free memory was 215.4 MB in the beginning and 278.6 MB in the end (delta: -63.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56017.57 ms. Allocated memory was 324.5 MB in the beginning and 1.1 GB in the end (delta: 792.7 MB). Free memory was 278.6 MB in the beginning and 884.0 MB in the end (delta: -605.4 MB). Peak memory consumption was 187.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 47 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 38 OverallIterations, 14 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 129 SDslu, 1462 SDs, 0 SdLazy, 3344 SolverSat, 1666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1917 GetRequests, 178 SyntacticMatches, 547 SemanticMatches, 1192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21189 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 94 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 1471 NumberOfCodeBlocks, 1471 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 1403 ConstructedInterpolants, 27 QuantifiedInterpolants, 254666 SizeOfPredicates, 5240 NumberOfNonLiveVariables, 64108 ConjunctsInSsa, 6011 ConjunctsInUnsatCore, 68 InterpolantComputations, 7 PerfectInterpolantSequences, 24/8436 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-43-23-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-43-23-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-43-23-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-43-23-954.csv Completed graceful shutdown