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/llreve-bench/smt2/loop__barthe2-big.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:42:55,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:42:55,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:42:55,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:42:55,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:42:55,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:42:55,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:42:55,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:42:55,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:42:55,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:42:55,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:42:55,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:42:55,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:42:55,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:42:55,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:42:55,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:42:55,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:42:55,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:42:55,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:42:55,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:42:55,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:42:55,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:42:55,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:42:55,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:42:55,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:42:55,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:42:55,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:42:55,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:42:55,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:42:55,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:42:55,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:42:55,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:42:55,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:42:55,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:42:55,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:42:55,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:42:55,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:42:56,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:42:56,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:42:56,005 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:42:56,005 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:42:56,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:42:56,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:42:56,007 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:42:56,007 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:42:56,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:42:56,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:42:56,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:42:56,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:42:56,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:42:56,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:42:56,008 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:42:56,009 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:42:56,011 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:42:56,011 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:42:56,045 INFO ]: Repository-Root is: /tmp [2018-06-26 18:42:56,059 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:42:56,063 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:42:56,064 INFO ]: Initializing SmtParser... [2018-06-26 18:42:56,065 INFO ]: SmtParser initialized [2018-06-26 18:42:56,065 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-26 18:42:56,066 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-26 18:42:56,149 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@67329f17 [2018-06-26 18:42:56,356 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-26 18:42:56,362 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:42:56,368 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:42:56,368 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:42:56,368 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:42:56,368 INFO ]: ChcToBoogie initialized [2018-06-26 18:42:56,371 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,428 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56 Unit [2018-06-26 18:42:56,428 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:42:56,429 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:42:56,429 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:42:56,429 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:42:56,452 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,452 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,459 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,459 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,463 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,465 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,466 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,472 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:42:56,473 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:42:56,473 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:42:56,473 INFO ]: RCFGBuilder initialized [2018-06-26 18:42:56,474 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:42:56,489 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:42:56,490 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:42:56,490 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:42:56,490 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:42:56,490 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:42:56,490 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:42:56,848 INFO ]: Using library mode [2018-06-26 18:42:56,848 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:56 BoogieIcfgContainer [2018-06-26 18:42:56,848 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:42:56,849 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:42:56,849 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:42:56,849 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:42:56,850 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:56" (1/1) ... [2018-06-26 18:42:56,862 INFO ]: Initial Icfg 11 locations, 16 edges [2018-06-26 18:42:56,863 INFO ]: Using Remove infeasible edges [2018-06-26 18:42:56,864 INFO ]: Using Maximize final states [2018-06-26 18:42:56,864 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:42:56,864 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:42:56,866 INFO ]: Using Remove sink states [2018-06-26 18:42:56,867 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:42:56,867 INFO ]: Using Use SBE [2018-06-26 18:42:56,873 INFO ]: SBE split 0 edges [2018-06-26 18:42:56,887 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:42:56,888 INFO ]: 0 new accepting states [2018-06-26 18:42:56,909 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:42:56,911 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:42:56,914 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:42:56,914 INFO ]: 0 new accepting states [2018-06-26 18:42:56,915 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:42:56,915 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:42:56,915 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-26 18:42:56,915 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:42:56 BasicIcfg [2018-06-26 18:42:56,915 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:42:56,917 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:42:56,917 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:42:56,919 INFO ]: TraceAbstraction initialized [2018-06-26 18:42:56,920 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:42:56" (1/4) ... [2018-06-26 18:42:56,920 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e34ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:42:56, skipping insertion in model container [2018-06-26 18:42:56,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:56" (2/4) ... [2018-06-26 18:42:56,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e34ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:42:56, skipping insertion in model container [2018-06-26 18:42:56,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:56" (3/4) ... [2018-06-26 18:42:56,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e34ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:42:56, skipping insertion in model container [2018-06-26 18:42:56,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:42:56" (4/4) ... [2018-06-26 18:42:56,923 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:42:56,931 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:42:56,940 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:42:56,972 INFO ]: Using default assertion order modulation [2018-06-26 18:42:56,973 INFO ]: Interprodecural is true [2018-06-26 18:42:56,973 INFO ]: Hoare is false [2018-06-26 18:42:56,973 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:42:56,973 INFO ]: Backedges is TWOTRACK [2018-06-26 18:42:56,973 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:42:56,973 INFO ]: Difference is false [2018-06-26 18:42:56,973 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:42:56,973 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:42:56,981 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 18:42:56,990 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:42:56,990 INFO ]: Found error trace [2018-06-26 18:42:56,991 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:42:56,991 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:56,997 INFO ]: Analyzing trace with hash 1274475792, now seen corresponding path program 1 times [2018-06-26 18:42:56,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:56,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:57,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:57,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,074 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:57,161 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:57,162 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:57,163 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:42:57,164 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:42:57,175 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:42:57,175 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:42:57,177 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-26 18:42:57,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:57,311 INFO ]: Finished difference Result 11 states and 24 transitions. [2018-06-26 18:42:57,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:42:57,313 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:42:57,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:57,323 INFO ]: With dead ends: 11 [2018-06-26 18:42:57,323 INFO ]: Without dead ends: 11 [2018-06-26 18:42:57,324 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:57,337 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:42:57,352 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 18:42:57,353 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:42:57,354 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-06-26 18:42:57,355 INFO ]: Start accepts. Automaton has 9 states and 19 transitions. Word has length 6 [2018-06-26 18:42:57,356 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:57,356 INFO ]: Abstraction has 9 states and 19 transitions. [2018-06-26 18:42:57,356 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:42:57,356 INFO ]: Start isEmpty. Operand 9 states and 19 transitions. [2018-06-26 18:42:57,356 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:42:57,356 INFO ]: Found error trace [2018-06-26 18:42:57,356 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:57,357 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:57,357 INFO ]: Analyzing trace with hash 853688483, now seen corresponding path program 1 times [2018-06-26 18:42:57,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:57,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:57,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:57,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,376 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:57,545 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:57,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:57,545 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-26 18:42:57,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:57,586 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:57,594 INFO ]: Computing forward predicates... [2018-06-26 18:42:57,726 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:57,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:57,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 18:42:57,747 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:42:57,747 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:42:57,747 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:57,747 INFO ]: Start difference. First operand 9 states and 19 transitions. Second operand 7 states. [2018-06-26 18:42:57,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:57,964 INFO ]: Finished difference Result 14 states and 34 transitions. [2018-06-26 18:42:57,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:57,965 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 18:42:57,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:57,965 INFO ]: With dead ends: 14 [2018-06-26 18:42:57,965 INFO ]: Without dead ends: 12 [2018-06-26 18:42:57,966 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:57,966 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:42:57,968 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 18:42:57,968 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:42:57,969 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-26 18:42:57,969 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-26 18:42:57,969 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:57,969 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-26 18:42:57,969 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:42:57,969 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-26 18:42:57,970 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:42:57,970 INFO ]: Found error trace [2018-06-26 18:42:57,970 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:57,970 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:57,970 INFO ]: Analyzing trace with hash 853777856, now seen corresponding path program 1 times [2018-06-26 18:42:57,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:57,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:57,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:57,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:57,985 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:58,074 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:58,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:58,074 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-26 18:42:58,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:58,105 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:58,107 INFO ]: Computing forward predicates... [2018-06-26 18:42:58,144 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:58,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:58,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:42:58,163 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:58,163 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:58,163 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:58,163 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 8 states. [2018-06-26 18:42:58,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:58,840 INFO ]: Finished difference Result 18 states and 38 transitions. [2018-06-26 18:42:58,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:42:58,840 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:42:58,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:58,841 INFO ]: With dead ends: 18 [2018-06-26 18:42:58,841 INFO ]: Without dead ends: 14 [2018-06-26 18:42:58,841 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:58,842 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:42:58,844 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-26 18:42:58,844 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:42:58,844 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-26 18:42:58,844 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 7 [2018-06-26 18:42:58,844 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:58,844 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-26 18:42:58,844 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:58,844 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-26 18:42:58,845 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:42:58,845 INFO ]: Found error trace [2018-06-26 18:42:58,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:58,845 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:58,845 INFO ]: Analyzing trace with hash 854463049, now seen corresponding path program 1 times [2018-06-26 18:42:58,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:58,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:58,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:58,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:58,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:58,865 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:58,929 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:58,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:58,929 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:58,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:58,951 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:58,952 INFO ]: Computing forward predicates... [2018-06-26 18:42:58,971 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:58,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:58,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:42:58,989 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:58,989 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:58,989 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:58,989 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 6 states. [2018-06-26 18:42:59,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,035 INFO ]: Finished difference Result 16 states and 34 transitions. [2018-06-26 18:42:59,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:42:59,036 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 18:42:59,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,036 INFO ]: With dead ends: 16 [2018-06-26 18:42:59,036 INFO ]: Without dead ends: 16 [2018-06-26 18:42:59,036 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:59,037 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:42:59,039 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-26 18:42:59,039 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:42:59,039 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-26 18:42:59,039 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 7 [2018-06-26 18:42:59,039 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,039 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-26 18:42:59,039 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:59,040 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-26 18:42:59,040 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:42:59,040 INFO ]: Found error trace [2018-06-26 18:42:59,040 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,040 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,040 INFO ]: Analyzing trace with hash 855386570, now seen corresponding path program 1 times [2018-06-26 18:42:59,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,049 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,082 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:59,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:59,082 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:42:59,082 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:42:59,082 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:42:59,082 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:42:59,082 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 4 states. [2018-06-26 18:42:59,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,114 INFO ]: Finished difference Result 16 states and 32 transitions. [2018-06-26 18:42:59,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:42:59,115 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 18:42:59,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,115 INFO ]: With dead ends: 16 [2018-06-26 18:42:59,115 INFO ]: Without dead ends: 15 [2018-06-26 18:42:59,116 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:59,116 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:42:59,118 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 18:42:59,118 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:42:59,118 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2018-06-26 18:42:59,119 INFO ]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 7 [2018-06-26 18:42:59,119 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,119 INFO ]: Abstraction has 14 states and 30 transitions. [2018-06-26 18:42:59,119 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:42:59,119 INFO ]: Start isEmpty. Operand 14 states and 30 transitions. [2018-06-26 18:42:59,119 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:42:59,119 INFO ]: Found error trace [2018-06-26 18:42:59,119 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,119 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,119 INFO ]: Analyzing trace with hash 718195338, now seen corresponding path program 1 times [2018-06-26 18:42:59,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,161 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:59,161 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:59,161 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:42:59,161 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:42:59,161 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:42:59,161 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:42:59,162 INFO ]: Start difference. First operand 14 states and 30 transitions. Second operand 3 states. [2018-06-26 18:42:59,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,172 INFO ]: Finished difference Result 17 states and 37 transitions. [2018-06-26 18:42:59,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:42:59,172 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 18:42:59,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,172 INFO ]: With dead ends: 17 [2018-06-26 18:42:59,172 INFO ]: Without dead ends: 15 [2018-06-26 18:42:59,173 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-26 18:42:59,173 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:42:59,174 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 18:42:59,174 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:42:59,175 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2018-06-26 18:42:59,175 INFO ]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 8 [2018-06-26 18:42:59,175 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,175 INFO ]: Abstraction has 14 states and 30 transitions. [2018-06-26 18:42:59,175 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:42:59,175 INFO ]: Start isEmpty. Operand 14 states and 30 transitions. [2018-06-26 18:42:59,175 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:42:59,175 INFO ]: Found error trace [2018-06-26 18:42:59,175 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,175 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,176 INFO ]: Analyzing trace with hash 718969904, now seen corresponding path program 2 times [2018-06-26 18:42:59,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,186 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,222 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:59,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:59,222 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:59,222 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:59,222 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:59,222 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:59,222 INFO ]: Start difference. First operand 14 states and 30 transitions. Second operand 5 states. [2018-06-26 18:42:59,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,281 INFO ]: Finished difference Result 20 states and 42 transitions. [2018-06-26 18:42:59,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:59,282 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:42:59,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,282 INFO ]: With dead ends: 20 [2018-06-26 18:42:59,282 INFO ]: Without dead ends: 19 [2018-06-26 18:42:59,283 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:59,283 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:42:59,284 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-26 18:42:59,285 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:42:59,285 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-06-26 18:42:59,285 INFO ]: Start accepts. Automaton has 14 states and 28 transitions. Word has length 8 [2018-06-26 18:42:59,285 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,285 INFO ]: Abstraction has 14 states and 28 transitions. [2018-06-26 18:42:59,285 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:59,285 INFO ]: Start isEmpty. Operand 14 states and 28 transitions. [2018-06-26 18:42:59,285 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:42:59,285 INFO ]: Found error trace [2018-06-26 18:42:59,285 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,286 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,286 INFO ]: Analyzing trace with hash 775513222, now seen corresponding path program 1 times [2018-06-26 18:42:59,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:59,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,297 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,442 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:59,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:59,442 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-26 18:42:59,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,469 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,471 INFO ]: Computing forward predicates... [2018-06-26 18:42:59,510 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:59,528 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:59,528 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-26 18:42:59,529 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:59,529 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:59,529 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:59,529 INFO ]: Start difference. First operand 14 states and 28 transitions. Second operand 8 states. [2018-06-26 18:42:59,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,620 INFO ]: Finished difference Result 19 states and 41 transitions. [2018-06-26 18:42:59,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:42:59,620 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-26 18:42:59,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,620 INFO ]: With dead ends: 19 [2018-06-26 18:42:59,620 INFO ]: Without dead ends: 17 [2018-06-26 18:42:59,621 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:59,621 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:42:59,622 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 18:42:59,622 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:42:59,623 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2018-06-26 18:42:59,623 INFO ]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 8 [2018-06-26 18:42:59,623 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,623 INFO ]: Abstraction has 15 states and 28 transitions. [2018-06-26 18:42:59,623 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:59,623 INFO ]: Start isEmpty. Operand 15 states and 28 transitions. [2018-06-26 18:42:59,623 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:42:59,623 INFO ]: Found error trace [2018-06-26 18:42:59,623 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,623 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,624 INFO ]: Analyzing trace with hash 775543013, now seen corresponding path program 1 times [2018-06-26 18:42:59,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,638 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,693 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:59,693 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:59,693 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:42:59,693 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:42:59,693 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:42:59,693 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:42:59,693 INFO ]: Start difference. First operand 15 states and 28 transitions. Second operand 3 states. [2018-06-26 18:42:59,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:59,703 INFO ]: Finished difference Result 18 states and 36 transitions. [2018-06-26 18:42:59,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:42:59,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 18:42:59,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:59,704 INFO ]: With dead ends: 18 [2018-06-26 18:42:59,704 INFO ]: Without dead ends: 16 [2018-06-26 18:42:59,704 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:42:59,704 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:42:59,705 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 18:42:59,705 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:42:59,705 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-26 18:42:59,705 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 8 [2018-06-26 18:42:59,706 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:59,706 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-26 18:42:59,706 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:42:59,706 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-26 18:42:59,706 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:59,706 INFO ]: Found error trace [2018-06-26 18:42:59,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:59,706 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:59,706 INFO ]: Analyzing trace with hash 870193023, now seen corresponding path program 1 times [2018-06-26 18:42:59,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:59,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:59,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:59,719 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,903 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:59,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:59,903 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-26 18:42:59,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:59,936 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:59,938 INFO ]: Computing forward predicates... [2018-06-26 18:43:00,039 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:00,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:00,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-06-26 18:43:00,058 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:43:00,058 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:43:00,058 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:43:00,059 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 8 states. [2018-06-26 18:43:00,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:00,155 INFO ]: Finished difference Result 22 states and 47 transitions. [2018-06-26 18:43:00,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:43:00,157 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 18:43:00,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:00,157 INFO ]: With dead ends: 22 [2018-06-26 18:43:00,157 INFO ]: Without dead ends: 22 [2018-06-26 18:43:00,158 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:43:00,158 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:43:00,168 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-26 18:43:00,168 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:43:00,195 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-06-26 18:43:00,195 INFO ]: Start accepts. Automaton has 16 states and 30 transitions. Word has length 9 [2018-06-26 18:43:00,195 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:00,195 INFO ]: Abstraction has 16 states and 30 transitions. [2018-06-26 18:43:00,195 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:43:00,195 INFO ]: Start isEmpty. Operand 16 states and 30 transitions. [2018-06-26 18:43:00,196 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:43:00,196 INFO ]: Found error trace [2018-06-26 18:43:00,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:00,196 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:00,196 INFO ]: Analyzing trace with hash -1649766911, now seen corresponding path program 2 times [2018-06-26 18:43:00,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:00,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:00,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:00,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:00,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:00,205 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:00,250 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:00,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:00,251 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-26 18:43:00,258 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:00,276 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:00,276 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:00,278 INFO ]: Computing forward predicates... [2018-06-26 18:43:00,336 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:00,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:00,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 18:43:00,355 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:43:00,355 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:43:00,355 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:43:00,355 INFO ]: Start difference. First operand 16 states and 30 transitions. Second operand 10 states. [2018-06-26 18:43:00,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:00,737 INFO ]: Finished difference Result 39 states and 93 transitions. [2018-06-26 18:43:00,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:43:00,737 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-26 18:43:00,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:00,738 INFO ]: With dead ends: 39 [2018-06-26 18:43:00,738 INFO ]: Without dead ends: 31 [2018-06-26 18:43:00,739 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:00,739 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:43:00,741 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-26 18:43:00,741 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:00,741 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-26 18:43:00,741 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 9 [2018-06-26 18:43:00,741 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:00,742 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-26 18:43:00,742 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:43:00,742 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-26 18:43:00,742 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:43:00,742 INFO ]: Found error trace [2018-06-26 18:43:00,742 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:00,742 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:00,742 INFO ]: Analyzing trace with hash -489700442, now seen corresponding path program 2 times [2018-06-26 18:43:00,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:00,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:00,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:00,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:00,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:00,762 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,066 INFO ]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:01,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:01,066 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-26 18:43:01,074 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:01,104 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:01,104 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,106 INFO ]: Computing forward predicates... [2018-06-26 18:43:01,185 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:01,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:01,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:43:01,204 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:43:01,204 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:43:01,205 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:43:01,205 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 12 states. [2018-06-26 18:43:01,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:01,386 INFO ]: Finished difference Result 36 states and 85 transitions. [2018-06-26 18:43:01,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:43:01,386 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-26 18:43:01,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:01,386 INFO ]: With dead ends: 36 [2018-06-26 18:43:01,386 INFO ]: Without dead ends: 31 [2018-06-26 18:43:01,387 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:01,387 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:43:01,389 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-26 18:43:01,389 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:01,390 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2018-06-26 18:43:01,390 INFO ]: Start accepts. Automaton has 19 states and 37 transitions. Word has length 10 [2018-06-26 18:43:01,390 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:01,390 INFO ]: Abstraction has 19 states and 37 transitions. [2018-06-26 18:43:01,390 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:43:01,390 INFO ]: Start isEmpty. Operand 19 states and 37 transitions. [2018-06-26 18:43:01,390 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:43:01,390 INFO ]: Found error trace [2018-06-26 18:43:01,390 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:01,390 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:01,390 INFO ]: Analyzing trace with hash 1206807635, now seen corresponding path program 1 times [2018-06-26 18:43:01,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:01,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:01,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:01,391 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:01,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:01,400 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,469 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:01,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:01,469 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-26 18:43:01,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:01,490 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,492 INFO ]: Computing forward predicates... [2018-06-26 18:43:01,504 INFO ]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:01,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:01,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-26 18:43:01,526 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:43:01,526 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:43:01,526 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:43:01,526 INFO ]: Start difference. First operand 19 states and 37 transitions. Second operand 8 states. [2018-06-26 18:43:01,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:01,638 INFO ]: Finished difference Result 28 states and 59 transitions. [2018-06-26 18:43:01,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:43:01,639 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 18:43:01,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:01,640 INFO ]: With dead ends: 28 [2018-06-26 18:43:01,640 INFO ]: Without dead ends: 22 [2018-06-26 18:43:01,640 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:43:01,640 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:43:01,642 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-26 18:43:01,642 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:01,642 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-26 18:43:01,642 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 10 [2018-06-26 18:43:01,642 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:01,643 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-26 18:43:01,643 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:43:01,643 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-26 18:43:01,643 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:43:01,643 INFO ]: Found error trace [2018-06-26 18:43:01,643 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:01,643 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:01,643 INFO ]: Analyzing trace with hash 1869571403, now seen corresponding path program 3 times [2018-06-26 18:43:01,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:01,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:01,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:01,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:01,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:01,654 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,768 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:01,768 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:01,768 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-26 18:43:01,774 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:01,793 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:43:01,793 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:01,795 INFO ]: Computing forward predicates... [2018-06-26 18:43:01,811 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:01,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:01,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 18:43:01,833 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:43:01,833 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:43:01,833 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:43:01,833 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 9 states. [2018-06-26 18:43:02,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:02,066 INFO ]: Finished difference Result 45 states and 102 transitions. [2018-06-26 18:43:02,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:43:02,066 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 18:43:02,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:02,067 INFO ]: With dead ends: 45 [2018-06-26 18:43:02,067 INFO ]: Without dead ends: 45 [2018-06-26 18:43:02,067 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:43:02,067 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 18:43:02,070 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-06-26 18:43:02,070 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:43:02,070 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-06-26 18:43:02,070 INFO ]: Start accepts. Automaton has 24 states and 48 transitions. Word has length 11 [2018-06-26 18:43:02,070 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:02,070 INFO ]: Abstraction has 24 states and 48 transitions. [2018-06-26 18:43:02,070 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:43:02,070 INFO ]: Start isEmpty. Operand 24 states and 48 transitions. [2018-06-26 18:43:02,071 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:43:02,071 INFO ]: Found error trace [2018-06-26 18:43:02,071 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:02,071 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:02,071 INFO ]: Analyzing trace with hash 1951152, now seen corresponding path program 3 times [2018-06-26 18:43:02,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:02,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:02,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:02,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:02,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:02,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:02,152 INFO ]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:02,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:02,152 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:02,157 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:02,212 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:43:02,212 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:02,214 INFO ]: Computing forward predicates... [2018-06-26 18:43:02,280 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:02,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:02,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 18:43:02,308 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:43:02,308 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:43:02,308 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:43:02,308 INFO ]: Start difference. First operand 24 states and 48 transitions. Second operand 13 states. [2018-06-26 18:43:02,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:02,702 INFO ]: Finished difference Result 65 states and 165 transitions. [2018-06-26 18:43:02,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:43:02,703 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-26 18:43:02,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:02,704 INFO ]: With dead ends: 65 [2018-06-26 18:43:02,704 INFO ]: Without dead ends: 65 [2018-06-26 18:43:02,705 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:43:02,705 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 18:43:02,708 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 33. [2018-06-26 18:43:02,708 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:43:02,709 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2018-06-26 18:43:02,709 INFO ]: Start accepts. Automaton has 33 states and 75 transitions. Word has length 12 [2018-06-26 18:43:02,709 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:02,709 INFO ]: Abstraction has 33 states and 75 transitions. [2018-06-26 18:43:02,709 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:43:02,709 INFO ]: Start isEmpty. Operand 33 states and 75 transitions. [2018-06-26 18:43:02,709 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:43:02,709 INFO ]: Found error trace [2018-06-26 18:43:02,709 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:02,709 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:02,710 INFO ]: Analyzing trace with hash -1836432245, now seen corresponding path program 1 times [2018-06-26 18:43:02,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:02,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:02,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:02,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:02,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:02,719 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:02,783 INFO ]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:02,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:02,783 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-26 18:43:02,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:02,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:02,814 INFO ]: Computing forward predicates... [2018-06-26 18:43:02,821 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:43:02,842 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:43:02,842 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-06-26 18:43:02,842 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:43:02,842 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:43:02,842 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:43:02,842 INFO ]: Start difference. First operand 33 states and 75 transitions. Second operand 9 states. [2018-06-26 18:43:03,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:03,026 INFO ]: Finished difference Result 39 states and 76 transitions. [2018-06-26 18:43:03,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:43:03,026 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 18:43:03,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:03,026 INFO ]: With dead ends: 39 [2018-06-26 18:43:03,026 INFO ]: Without dead ends: 31 [2018-06-26 18:43:03,027 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:43:03,027 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:43:03,029 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-26 18:43:03,029 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:43:03,029 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2018-06-26 18:43:03,029 INFO ]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 12 [2018-06-26 18:43:03,029 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:03,029 INFO ]: Abstraction has 23 states and 34 transitions. [2018-06-26 18:43:03,029 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:43:03,029 INFO ]: Start isEmpty. Operand 23 states and 34 transitions. [2018-06-26 18:43:03,030 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:43:03,030 INFO ]: Found error trace [2018-06-26 18:43:03,030 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:03,030 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:03,030 INFO ]: Analyzing trace with hash -1751468313, now seen corresponding path program 2 times [2018-06-26 18:43:03,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:03,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:03,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:03,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,041 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:03,196 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:03,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:03,196 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-26 18:43:03,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:03,233 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:03,233 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:03,235 INFO ]: Computing forward predicates... [2018-06-26 18:43:03,247 INFO ]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:03,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:03,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 18:43:03,278 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:43:03,278 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:43:03,278 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:43:03,278 INFO ]: Start difference. First operand 23 states and 34 transitions. Second operand 10 states. [2018-06-26 18:43:03,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:03,374 INFO ]: Finished difference Result 42 states and 63 transitions. [2018-06-26 18:43:03,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:43:03,375 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-26 18:43:03,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:03,375 INFO ]: With dead ends: 42 [2018-06-26 18:43:03,375 INFO ]: Without dead ends: 28 [2018-06-26 18:43:03,375 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:43:03,375 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:43:03,377 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-26 18:43:03,377 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:43:03,377 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-26 18:43:03,377 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 12 [2018-06-26 18:43:03,377 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:03,377 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-26 18:43:03,377 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:43:03,377 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-26 18:43:03,377 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:43:03,377 INFO ]: Found error trace [2018-06-26 18:43:03,377 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:03,377 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:03,377 INFO ]: Analyzing trace with hash 2121842822, now seen corresponding path program 4 times [2018-06-26 18:43:03,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:03,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:03,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:03,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,387 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:03,559 INFO ]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:03,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:03,559 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-26 18:43:03,565 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:03,585 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:03,585 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:03,586 INFO ]: Computing forward predicates... [2018-06-26 18:43:03,612 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:03,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:03,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-26 18:43:03,632 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:43:03,632 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:43:03,632 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:43:03,632 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2018-06-26 18:43:03,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:03,783 INFO ]: Finished difference Result 32 states and 45 transitions. [2018-06-26 18:43:03,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:43:03,783 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-26 18:43:03,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:03,784 INFO ]: With dead ends: 32 [2018-06-26 18:43:03,784 INFO ]: Without dead ends: 29 [2018-06-26 18:43:03,784 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:43:03,784 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:43:03,785 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-06-26 18:43:03,785 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:43:03,787 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-06-26 18:43:03,787 INFO ]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2018-06-26 18:43:03,787 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:03,787 INFO ]: Abstraction has 22 states and 30 transitions. [2018-06-26 18:43:03,787 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:43:03,787 INFO ]: Start isEmpty. Operand 22 states and 30 transitions. [2018-06-26 18:43:03,787 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:43:03,787 INFO ]: Found error trace [2018-06-26 18:43:03,787 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:03,787 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:03,788 INFO ]: Analyzing trace with hash -2144495323, now seen corresponding path program 1 times [2018-06-26 18:43:03,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:03,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:03,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:03,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:03,797 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:04,001 INFO ]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:43:04,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:04,001 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) [2018-06-26 18:43:04,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:04,050 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:04,052 INFO ]: Computing forward predicates... [2018-06-26 18:43:04,266 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:43:04,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:04,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-06-26 18:43:04,285 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:43:04,285 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:43:04,285 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:43:04,285 INFO ]: Start difference. First operand 22 states and 30 transitions. Second operand 9 states. [2018-06-26 18:43:04,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:04,518 INFO ]: Finished difference Result 31 states and 41 transitions. [2018-06-26 18:43:04,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:43:04,518 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 18:43:04,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:04,519 INFO ]: With dead ends: 31 [2018-06-26 18:43:04,519 INFO ]: Without dead ends: 23 [2018-06-26 18:43:04,519 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:04,519 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:43:04,520 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-26 18:43:04,520 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:43:04,520 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-26 18:43:04,520 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 12 [2018-06-26 18:43:04,520 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:04,520 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-26 18:43:04,520 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:43:04,520 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-26 18:43:04,520 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:43:04,520 INFO ]: Found error trace [2018-06-26 18:43:04,520 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:04,520 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:04,520 INFO ]: Analyzing trace with hash -332837121, now seen corresponding path program 4 times [2018-06-26 18:43:04,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:04,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:04,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:04,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:04,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:04,531 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:04,978 INFO ]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:43:04,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:04,978 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-26 18:43:04,988 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:05,010 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:05,010 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:05,013 INFO ]: Computing forward predicates... [2018-06-26 18:43:05,130 INFO ]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:43:05,149 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:05,149 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-26 18:43:05,150 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:43:05,150 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:43:05,150 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:43:05,150 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 10 states. [2018-06-26 18:43:05,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:05,266 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-26 18:43:05,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:43:05,303 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-26 18:43:05,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:05,303 INFO ]: With dead ends: 25 [2018-06-26 18:43:05,303 INFO ]: Without dead ends: 21 [2018-06-26 18:43:05,303 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:43:05,303 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:43:05,304 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-26 18:43:05,304 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:43:05,304 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-26 18:43:05,304 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 13 [2018-06-26 18:43:05,305 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:05,305 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-26 18:43:05,305 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:43:05,305 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-26 18:43:05,305 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:43:05,305 INFO ]: Found error trace [2018-06-26 18:43:05,305 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:05,305 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:05,305 INFO ]: Analyzing trace with hash 368227457, now seen corresponding path program 5 times [2018-06-26 18:43:05,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:05,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:05,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:05,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:05,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:05,321 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:05,410 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:05,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:05,410 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-26 18:43:05,415 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:05,439 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 18:43:05,439 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:05,440 INFO ]: Computing forward predicates... [2018-06-26 18:43:05,454 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:05,474 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:05,474 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 18:43:05,474 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:43:05,474 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:43:05,474 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:43:05,474 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 11 states. [2018-06-26 18:43:05,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:05,560 INFO ]: Finished difference Result 36 states and 47 transitions. [2018-06-26 18:43:05,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:43:05,562 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 18:43:05,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:05,562 INFO ]: With dead ends: 36 [2018-06-26 18:43:05,562 INFO ]: Without dead ends: 36 [2018-06-26 18:43:05,562 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:43:05,562 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 18:43:05,564 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-06-26 18:43:05,564 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:43:05,564 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-06-26 18:43:05,564 INFO ]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2018-06-26 18:43:05,564 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:05,564 INFO ]: Abstraction has 22 states and 29 transitions. [2018-06-26 18:43:05,564 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:43:05,564 INFO ]: Start isEmpty. Operand 22 states and 29 transitions. [2018-06-26 18:43:05,565 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:43:05,565 INFO ]: Found error trace [2018-06-26 18:43:05,565 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:05,565 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:05,565 INFO ]: Analyzing trace with hash 881495974, now seen corresponding path program 5 times [2018-06-26 18:43:05,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:05,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:05,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:05,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:05,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:05,577 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:06,751 INFO ]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:06,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:06,751 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-26 18:43:06,767 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:06,845 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:43:06,845 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:06,847 INFO ]: Computing forward predicates... [2018-06-26 18:43:06,886 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:06,905 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:06,905 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-26 18:43:06,905 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:43:06,905 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:43:06,905 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:43:06,906 INFO ]: Start difference. First operand 22 states and 29 transitions. Second operand 13 states. [2018-06-26 18:43:06,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:06,997 INFO ]: Finished difference Result 42 states and 54 transitions. [2018-06-26 18:43:06,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:43:06,999 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 18:43:06,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:06,999 INFO ]: With dead ends: 42 [2018-06-26 18:43:06,999 INFO ]: Without dead ends: 42 [2018-06-26 18:43:06,999 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:06,999 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 18:43:07,001 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 19. [2018-06-26 18:43:07,001 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:07,001 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-26 18:43:07,001 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-06-26 18:43:07,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:07,001 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-26 18:43:07,001 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:43:07,001 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-26 18:43:07,002 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:43:07,002 INFO ]: Found error trace [2018-06-26 18:43:07,002 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:07,002 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:07,002 INFO ]: Analyzing trace with hash -1470146544, now seen corresponding path program 6 times [2018-06-26 18:43:07,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:07,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:07,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:07,002 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:07,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:07,013 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:07,151 INFO ]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:07,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:07,152 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-26 18:43:07,159 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:07,184 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 18:43:07,184 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:07,186 INFO ]: Computing forward predicates... [2018-06-26 18:43:07,311 INFO ]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:43:07,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:07,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-06-26 18:43:07,332 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:43:07,332 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:43:07,332 INFO ]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:07,332 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2018-06-26 18:43:07,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:07,718 INFO ]: Finished difference Result 43 states and 56 transitions. [2018-06-26 18:43:07,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 18:43:07,718 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-26 18:43:07,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:07,719 INFO ]: With dead ends: 43 [2018-06-26 18:43:07,719 INFO ]: Without dead ends: 38 [2018-06-26 18:43:07,719 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:43:07,719 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:43:07,720 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 19. [2018-06-26 18:43:07,720 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:07,720 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-26 18:43:07,720 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-06-26 18:43:07,721 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:07,721 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-26 18:43:07,721 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:43:07,721 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-26 18:43:07,721 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:43:07,721 INFO ]: Found error trace [2018-06-26 18:43:07,721 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:07,721 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:07,721 INFO ]: Analyzing trace with hash 1556275595, now seen corresponding path program 6 times [2018-06-26 18:43:07,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:07,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:07,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:07,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:07,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:07,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:07,877 INFO ]: Checked inductivity of 25 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:07,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:07,877 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-26 18:43:07,883 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:07,944 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:43:07,944 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:07,947 INFO ]: Computing forward predicates... [2018-06-26 18:43:08,145 INFO ]: Checked inductivity of 25 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:43:08,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:08,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-06-26 18:43:08,164 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:43:08,165 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:43:08,165 INFO ]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:08,165 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2018-06-26 18:43:08,639 WARN ]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-06-26 18:43:08,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:08,929 INFO ]: Finished difference Result 42 states and 55 transitions. [2018-06-26 18:43:08,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:43:08,929 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-26 18:43:08,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:08,929 INFO ]: With dead ends: 42 [2018-06-26 18:43:08,929 INFO ]: Without dead ends: 37 [2018-06-26 18:43:08,929 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:43:08,929 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 18:43:08,930 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-26 18:43:08,930 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:43:08,930 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-26 18:43:08,930 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2018-06-26 18:43:08,931 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:08,931 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-26 18:43:08,931 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:43:08,931 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-26 18:43:08,931 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:43:08,931 INFO ]: Found error trace [2018-06-26 18:43:08,931 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:08,931 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:08,931 INFO ]: Analyzing trace with hash 1227635019, now seen corresponding path program 7 times [2018-06-26 18:43:08,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:08,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:08,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:08,932 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:08,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:08,943 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:09,019 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:09,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:09,019 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-26 18:43:09,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:09,050 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:09,052 INFO ]: Computing forward predicates... [2018-06-26 18:43:09,090 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:09,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:09,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 18:43:09,112 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:43:09,112 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:43:09,112 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:43:09,112 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 13 states. [2018-06-26 18:43:09,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:09,258 INFO ]: Finished difference Result 44 states and 56 transitions. [2018-06-26 18:43:09,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:43:09,258 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-26 18:43:09,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:09,259 INFO ]: With dead ends: 44 [2018-06-26 18:43:09,259 INFO ]: Without dead ends: 44 [2018-06-26 18:43:09,259 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:43:09,259 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:43:09,346 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 24. [2018-06-26 18:43:09,346 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:43:09,346 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-26 18:43:09,346 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2018-06-26 18:43:09,346 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:09,346 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-26 18:43:09,346 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:43:09,346 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-26 18:43:09,347 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:43:09,347 INFO ]: Found error trace [2018-06-26 18:43:09,347 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:09,347 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:09,347 INFO ]: Analyzing trace with hash 557440816, now seen corresponding path program 7 times [2018-06-26 18:43:09,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:09,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:09,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:09,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:09,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:09,356 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:09,804 INFO ]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:09,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:09,804 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-26 18:43:09,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:09,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:09,838 INFO ]: Computing forward predicates... [2018-06-26 18:43:09,911 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:09,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:09,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-26 18:43:09,930 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:43:09,930 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:43:09,930 INFO ]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:43:09,930 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 15 states. [2018-06-26 18:43:10,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:10,069 INFO ]: Finished difference Result 51 states and 64 transitions. [2018-06-26 18:43:10,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:43:10,069 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-26 18:43:10,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:10,070 INFO ]: With dead ends: 51 [2018-06-26 18:43:10,070 INFO ]: Without dead ends: 51 [2018-06-26 18:43:10,070 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:43:10,070 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:43:10,071 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 20. [2018-06-26 18:43:10,071 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:43:10,072 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-26 18:43:10,072 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2018-06-26 18:43:10,072 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:10,072 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-26 18:43:10,072 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:43:10,072 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-26 18:43:10,072 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:43:10,072 INFO ]: Found error trace [2018-06-26 18:43:10,072 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:10,072 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:10,072 INFO ]: Analyzing trace with hash -598315898, now seen corresponding path program 8 times [2018-06-26 18:43:10,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:10,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:10,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:10,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:10,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:10,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:10,233 INFO ]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:10,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:10,233 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-26 18:43:10,238 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:10,266 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:10,266 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:10,268 INFO ]: Computing forward predicates... [2018-06-26 18:43:10,353 INFO ]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:43:10,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:10,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-26 18:43:10,383 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:43:10,383 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:43:10,383 INFO ]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:10,383 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 20 states. [2018-06-26 18:43:10,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:10,749 INFO ]: Finished difference Result 55 states and 70 transitions. [2018-06-26 18:43:10,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 18:43:10,751 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-26 18:43:10,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:10,751 INFO ]: With dead ends: 55 [2018-06-26 18:43:10,751 INFO ]: Without dead ends: 49 [2018-06-26 18:43:10,752 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:43:10,752 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 18:43:10,753 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 21. [2018-06-26 18:43:10,753 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:43:10,753 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-26 18:43:10,753 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-06-26 18:43:10,753 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:10,753 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-26 18:43:10,753 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:43:10,753 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-26 18:43:10,753 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:43:10,754 INFO ]: Found error trace [2018-06-26 18:43:10,754 INFO ]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:10,754 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:10,754 INFO ]: Analyzing trace with hash 100500289, now seen corresponding path program 8 times [2018-06-26 18:43:10,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:10,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:10,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:10,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:10,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:10,774 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:11,098 INFO ]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:11,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:11,098 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-26 18:43:11,109 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:11,140 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:11,140 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:11,143 INFO ]: Computing forward predicates... [2018-06-26 18:43:11,373 INFO ]: Checked inductivity of 36 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:43:11,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:11,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2018-06-26 18:43:11,404 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:43:11,404 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:43:11,404 INFO ]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:11,404 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 20 states. [2018-06-26 18:43:11,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:11,715 INFO ]: Finished difference Result 59 states and 74 transitions. [2018-06-26 18:43:11,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:43:11,716 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-26 18:43:11,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:11,716 INFO ]: With dead ends: 59 [2018-06-26 18:43:11,716 INFO ]: Without dead ends: 53 [2018-06-26 18:43:11,717 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:43:11,717 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:43:11,718 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 20. [2018-06-26 18:43:11,718 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:43:11,718 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-26 18:43:11,718 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2018-06-26 18:43:11,718 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:11,718 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-26 18:43:11,718 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:43:11,718 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-26 18:43:11,719 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:43:11,719 INFO ]: Found error trace [2018-06-26 18:43:11,722 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:11,722 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:11,722 INFO ]: Analyzing trace with hash -910616961, now seen corresponding path program 9 times [2018-06-26 18:43:11,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:11,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:11,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:11,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:11,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:11,736 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:11,909 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:43:11,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:11,909 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-26 18:43:11,915 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:11,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:43:11,947 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:11,950 INFO ]: Computing forward predicates... [2018-06-26 18:43:12,052 INFO ]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:43:12,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:12,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-26 18:43:12,071 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:43:12,071 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:43:12,071 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:43:12,071 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 12 states. [2018-06-26 18:43:12,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:12,171 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-26 18:43:12,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:43:12,172 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-26 18:43:12,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:12,172 INFO ]: With dead ends: 33 [2018-06-26 18:43:12,172 INFO ]: Without dead ends: 27 [2018-06-26 18:43:12,172 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:43:12,172 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 18:43:12,175 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-06-26 18:43:12,175 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:43:12,175 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-26 18:43:12,176 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2018-06-26 18:43:12,176 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:12,176 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-26 18:43:12,176 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:43:12,176 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-26 18:43:12,176 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:43:12,176 INFO ]: Found error trace [2018-06-26 18:43:12,176 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:12,176 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:12,176 INFO ]: Analyzing trace with hash 2104486657, now seen corresponding path program 9 times [2018-06-26 18:43:12,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:12,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:12,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:12,177 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:12,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:12,188 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:12,315 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:12,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:12,315 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-26 18:43:12,321 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:12,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:43:12,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:12,356 INFO ]: Computing forward predicates... [2018-06-26 18:43:12,470 INFO ]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:43:12,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:12,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-06-26 18:43:12,488 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:43:12,488 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:43:12,489 INFO ]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:43:12,489 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 22 states. [2018-06-26 18:43:13,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:13,238 INFO ]: Finished difference Result 68 states and 82 transitions. [2018-06-26 18:43:13,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-26 18:43:13,239 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-26 18:43:13,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:13,239 INFO ]: With dead ends: 68 [2018-06-26 18:43:13,239 INFO ]: Without dead ends: 61 [2018-06-26 18:43:13,241 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=747, Invalid=3035, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 18:43:13,241 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 18:43:13,242 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 28. [2018-06-26 18:43:13,242 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:43:13,242 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-06-26 18:43:13,242 INFO ]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2018-06-26 18:43:13,242 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:13,242 INFO ]: Abstraction has 28 states and 35 transitions. [2018-06-26 18:43:13,242 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:43:13,242 INFO ]: Start isEmpty. Operand 28 states and 35 transitions. [2018-06-26 18:43:13,242 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:43:13,242 INFO ]: Found error trace [2018-06-26 18:43:13,242 INFO ]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:13,242 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:13,242 INFO ]: Analyzing trace with hash -2002015322, now seen corresponding path program 10 times [2018-06-26 18:43:13,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:13,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:13,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:13,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:13,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:13,253 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:13,526 INFO ]: Checked inductivity of 43 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:13,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:13,526 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-26 18:43:13,532 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:13,562 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:13,562 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:13,564 INFO ]: Computing forward predicates... [2018-06-26 18:43:13,671 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:13,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:13,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-26 18:43:13,689 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:43:13,689 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:43:13,689 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:13,689 INFO ]: Start difference. First operand 28 states and 35 transitions. Second operand 17 states. [2018-06-26 18:43:13,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:13,786 INFO ]: Finished difference Result 55 states and 67 transitions. [2018-06-26 18:43:13,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:43:13,786 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-26 18:43:13,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:13,786 INFO ]: With dead ends: 55 [2018-06-26 18:43:13,786 INFO ]: Without dead ends: 55 [2018-06-26 18:43:13,786 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:43:13,787 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 18:43:13,787 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 23. [2018-06-26 18:43:13,787 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:43:13,787 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-26 18:43:13,787 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2018-06-26 18:43:13,787 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:13,787 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-26 18:43:13,787 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:43:13,787 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-26 18:43:13,788 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:43:13,788 INFO ]: Found error trace [2018-06-26 18:43:13,788 INFO ]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:13,788 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:13,788 INFO ]: Analyzing trace with hash -1933228661, now seen corresponding path program 11 times [2018-06-26 18:43:13,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:13,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:13,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:13,789 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:13,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:13,800 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:13,967 INFO ]: Checked inductivity of 49 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:13,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:13,967 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-26 18:43:13,980 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:14,025 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:43:14,025 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:14,027 INFO ]: Computing forward predicates... [2018-06-26 18:43:14,058 INFO ]: Checked inductivity of 49 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:14,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:14,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 18:43:14,077 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:43:14,078 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:43:14,078 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:43:14,078 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 16 states. [2018-06-26 18:43:14,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:14,176 INFO ]: Finished difference Result 55 states and 67 transitions. [2018-06-26 18:43:14,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:43:14,176 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-26 18:43:14,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:14,176 INFO ]: With dead ends: 55 [2018-06-26 18:43:14,176 INFO ]: Without dead ends: 48 [2018-06-26 18:43:14,177 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:43:14,177 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 18:43:14,178 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 23. [2018-06-26 18:43:14,178 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:43:14,178 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-26 18:43:14,178 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2018-06-26 18:43:14,178 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:14,178 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-26 18:43:14,178 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:43:14,178 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-26 18:43:14,178 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:43:14,178 INFO ]: Found error trace [2018-06-26 18:43:14,178 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:14,178 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:14,178 INFO ]: Analyzing trace with hash -247677621, now seen corresponding path program 10 times [2018-06-26 18:43:14,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:14,178 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:14,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:14,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:14,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:14,189 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:14,388 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:14,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:14,388 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-26 18:43:14,393 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:14,426 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:14,426 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:14,428 INFO ]: Computing forward predicates... [2018-06-26 18:43:14,444 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:14,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:14,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 18:43:14,468 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:43:14,468 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:43:14,468 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:14,468 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 17 states. [2018-06-26 18:43:14,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:14,830 INFO ]: Finished difference Result 65 states and 79 transitions. [2018-06-26 18:43:14,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:43:14,831 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-26 18:43:14,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:14,831 INFO ]: With dead ends: 65 [2018-06-26 18:43:14,831 INFO ]: Without dead ends: 65 [2018-06-26 18:43:14,832 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:43:14,832 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 18:43:14,833 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 30. [2018-06-26 18:43:14,833 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:43:14,833 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-26 18:43:14,833 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2018-06-26 18:43:14,834 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:14,834 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-26 18:43:14,834 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:43:14,834 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-26 18:43:14,834 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:43:14,834 INFO ]: Found error trace [2018-06-26 18:43:14,834 INFO ]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:14,834 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:14,834 INFO ]: Analyzing trace with hash 478865584, now seen corresponding path program 12 times [2018-06-26 18:43:14,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:14,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:14,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:14,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:14,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:14,846 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:14,999 INFO ]: Checked inductivity of 57 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:14,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:14,999 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-26 18:43:15,005 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:15,048 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:43:15,048 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:15,051 INFO ]: Computing forward predicates... [2018-06-26 18:43:15,598 INFO ]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:43:15,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:15,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-06-26 18:43:15,628 INFO ]: Interpolant automaton has 27 states [2018-06-26 18:43:15,628 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 18:43:15,628 INFO ]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:43:15,628 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 27 states. [2018-06-26 18:43:16,746 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-26 18:43:16,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:16,866 INFO ]: Finished difference Result 75 states and 90 transitions. [2018-06-26 18:43:16,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-26 18:43:16,867 INFO ]: Start accepts. Automaton has 27 states. Word has length 20 [2018-06-26 18:43:16,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:16,867 INFO ]: With dead ends: 75 [2018-06-26 18:43:16,867 INFO ]: Without dead ends: 67 [2018-06-26 18:43:16,868 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=3854, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 18:43:16,868 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 18:43:16,869 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 23. [2018-06-26 18:43:16,869 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:43:16,869 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-26 18:43:16,869 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 20 [2018-06-26 18:43:16,869 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:16,869 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-26 18:43:16,869 INFO ]: Interpolant automaton has 27 states. [2018-06-26 18:43:16,869 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-26 18:43:16,869 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:43:16,869 INFO ]: Found error trace [2018-06-26 18:43:16,869 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:16,869 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:16,870 INFO ]: Analyzing trace with hash 911632518, now seen corresponding path program 11 times [2018-06-26 18:43:16,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:16,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:16,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:16,870 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:16,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:16,881 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:17,059 INFO ]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:17,059 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:17,059 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-26 18:43:17,065 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:17,152 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:43:17,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:17,154 INFO ]: Computing forward predicates... [2018-06-26 18:43:17,201 INFO ]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:17,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:17,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-26 18:43:17,222 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:43:17,222 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:43:17,222 INFO ]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:43:17,222 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 20 states. [2018-06-26 18:43:17,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:17,360 INFO ]: Finished difference Result 66 states and 79 transitions. [2018-06-26 18:43:17,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:43:17,360 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-26 18:43:17,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:17,361 INFO ]: With dead ends: 66 [2018-06-26 18:43:17,361 INFO ]: Without dead ends: 58 [2018-06-26 18:43:17,361 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:43:17,361 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 18:43:17,362 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 24. [2018-06-26 18:43:17,362 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:43:17,362 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-26 18:43:17,362 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2018-06-26 18:43:17,362 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:17,362 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-26 18:43:17,362 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:43:17,362 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-26 18:43:17,362 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:43:17,362 INFO ]: Found error trace [2018-06-26 18:43:17,362 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:17,363 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:17,363 INFO ]: Analyzing trace with hash -34509313, now seen corresponding path program 13 times [2018-06-26 18:43:17,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:17,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:17,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:17,364 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:17,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:17,376 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:17,542 INFO ]: Checked inductivity of 64 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:43:17,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:17,542 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-26 18:43:17,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:17,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:17,591 INFO ]: Computing forward predicates... [2018-06-26 18:43:17,710 INFO ]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:43:17,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:17,729 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-06-26 18:43:17,729 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:43:17,729 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:43:17,729 INFO ]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:43:17,729 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 14 states. [2018-06-26 18:43:17,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:17,873 INFO ]: Finished difference Result 41 states and 49 transitions. [2018-06-26 18:43:17,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:43:17,875 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-26 18:43:17,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:17,875 INFO ]: With dead ends: 41 [2018-06-26 18:43:17,875 INFO ]: Without dead ends: 33 [2018-06-26 18:43:17,875 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:43:17,875 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:43:17,876 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-06-26 18:43:17,876 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:43:17,877 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-06-26 18:43:17,877 INFO ]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2018-06-26 18:43:17,877 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:17,877 INFO ]: Abstraction has 26 states and 32 transitions. [2018-06-26 18:43:17,877 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:43:17,877 INFO ]: Start isEmpty. Operand 26 states and 32 transitions. [2018-06-26 18:43:17,877 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:43:17,877 INFO ]: Found error trace [2018-06-26 18:43:17,877 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:17,877 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:17,877 INFO ]: Analyzing trace with hash -1723453055, now seen corresponding path program 12 times [2018-06-26 18:43:17,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:17,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:17,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:17,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:17,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:17,889 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:18,124 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:18,124 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:18,124 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:18,130 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:18,170 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:43:18,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:18,172 INFO ]: Computing forward predicates... [2018-06-26 18:43:18,375 INFO ]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:43:18,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:18,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2018-06-26 18:43:18,395 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:43:18,395 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:43:18,395 INFO ]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:43:18,395 INFO ]: Start difference. First operand 26 states and 32 transitions. Second operand 28 states. [2018-06-26 18:43:18,766 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-06-26 18:43:19,879 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-26 18:43:20,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:20,564 INFO ]: Finished difference Result 95 states and 111 transitions. [2018-06-26 18:43:20,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-26 18:43:20,564 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-26 18:43:20,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:20,565 INFO ]: With dead ends: 95 [2018-06-26 18:43:20,565 INFO ]: Without dead ends: 86 [2018-06-26 18:43:20,566 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1442, Invalid=6390, Unknown=0, NotChecked=0, Total=7832 [2018-06-26 18:43:20,566 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 18:43:20,567 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 34. [2018-06-26 18:43:20,567 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:43:20,569 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-26 18:43:20,569 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2018-06-26 18:43:20,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:20,569 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-26 18:43:20,569 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:43:20,569 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-26 18:43:20,569 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:43:20,569 INFO ]: Found error trace [2018-06-26 18:43:20,569 INFO ]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:20,569 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:20,569 INFO ]: Analyzing trace with hash 699864998, now seen corresponding path program 14 times [2018-06-26 18:43:20,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:20,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:20,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:20,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:20,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:20,583 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:20,793 INFO ]: Checked inductivity of 73 backedges. 37 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:20,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:20,817 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:20,822 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:20,867 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:20,867 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:20,869 INFO ]: Computing forward predicates... [2018-06-26 18:43:21,054 INFO ]: Checked inductivity of 73 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:43:21,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:21,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2018-06-26 18:43:21,076 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:43:21,076 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:43:21,076 INFO ]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:43:21,076 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 30 states. [2018-06-26 18:43:21,945 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-06-26 18:43:22,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:22,434 INFO ]: Finished difference Result 79 states and 93 transitions. [2018-06-26 18:43:22,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 18:43:22,436 INFO ]: Start accepts. Automaton has 30 states. Word has length 22 [2018-06-26 18:43:22,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:22,436 INFO ]: With dead ends: 79 [2018-06-26 18:43:22,436 INFO ]: Without dead ends: 70 [2018-06-26 18:43:22,437 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1134, Invalid=4566, Unknown=0, NotChecked=0, Total=5700 [2018-06-26 18:43:22,437 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 18:43:22,438 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 27. [2018-06-26 18:43:22,438 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 18:43:22,438 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-06-26 18:43:22,438 INFO ]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2018-06-26 18:43:22,438 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:22,438 INFO ]: Abstraction has 27 states and 33 transitions. [2018-06-26 18:43:22,438 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:43:22,438 INFO ]: Start isEmpty. Operand 27 states and 33 transitions. [2018-06-26 18:43:22,439 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:43:22,439 INFO ]: Found error trace [2018-06-26 18:43:22,439 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:22,439 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:22,439 INFO ]: Analyzing trace with hash -174263989, now seen corresponding path program 13 times [2018-06-26 18:43:22,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:22,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:22,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:22,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:22,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:22,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:23,893 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:23,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:23,893 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:23,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:23,938 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:23,940 INFO ]: Computing forward predicates... [2018-06-26 18:43:23,959 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:23,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:23,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-26 18:43:23,977 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:43:23,977 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:43:23,977 INFO ]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:43:23,977 INFO ]: Start difference. First operand 27 states and 33 transitions. Second operand 21 states. [2018-06-26 18:43:24,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:24,314 INFO ]: Finished difference Result 90 states and 106 transitions. [2018-06-26 18:43:24,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:43:24,314 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-26 18:43:24,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:24,315 INFO ]: With dead ends: 90 [2018-06-26 18:43:24,315 INFO ]: Without dead ends: 90 [2018-06-26 18:43:24,315 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=489, Invalid=917, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:43:24,315 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-26 18:43:24,316 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 36. [2018-06-26 18:43:24,316 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 18:43:24,316 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-06-26 18:43:24,316 INFO ]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2018-06-26 18:43:24,317 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:24,317 INFO ]: Abstraction has 36 states and 43 transitions. [2018-06-26 18:43:24,317 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:43:24,317 INFO ]: Start isEmpty. Operand 36 states and 43 transitions. [2018-06-26 18:43:24,317 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:43:24,317 INFO ]: Found error trace [2018-06-26 18:43:24,317 INFO ]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:24,317 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:24,317 INFO ]: Analyzing trace with hash 762110512, now seen corresponding path program 15 times [2018-06-26 18:43:24,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:24,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:24,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:24,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:24,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:24,334 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:24,844 INFO ]: Checked inductivity of 91 backedges. 46 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:24,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:24,844 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:24,850 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:24,896 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:43:24,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:24,899 INFO ]: Computing forward predicates... [2018-06-26 18:43:25,071 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:25,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:25,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-26 18:43:25,102 INFO ]: Interpolant automaton has 31 states [2018-06-26 18:43:25,102 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 18:43:25,103 INFO ]: CoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:43:25,103 INFO ]: Start difference. First operand 36 states and 43 transitions. Second operand 31 states. [2018-06-26 18:43:25,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:25,702 INFO ]: Finished difference Result 101 states and 118 transitions. [2018-06-26 18:43:25,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:43:25,702 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-26 18:43:25,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:25,702 INFO ]: With dead ends: 101 [2018-06-26 18:43:25,702 INFO ]: Without dead ends: 101 [2018-06-26 18:43:25,703 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=616, Invalid=1640, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 18:43:25,703 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-26 18:43:25,704 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 28. [2018-06-26 18:43:25,704 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:43:25,704 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-06-26 18:43:25,704 INFO ]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2018-06-26 18:43:25,704 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:25,704 INFO ]: Abstraction has 28 states and 34 transitions. [2018-06-26 18:43:25,704 INFO ]: Interpolant automaton has 31 states. [2018-06-26 18:43:25,704 INFO ]: Start isEmpty. Operand 28 states and 34 transitions. [2018-06-26 18:43:25,704 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:43:25,704 INFO ]: Found error trace [2018-06-26 18:43:25,704 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:25,705 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:25,705 INFO ]: Analyzing trace with hash -1107512186, now seen corresponding path program 14 times [2018-06-26 18:43:25,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:25,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:25,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:25,705 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:25,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:25,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:25,985 INFO ]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:25,985 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:26,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:26,042 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:26,086 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:26,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:26,089 INFO ]: Computing forward predicates... [2018-06-26 18:43:26,261 INFO ]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 18:43:26,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:26,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 32 [2018-06-26 18:43:26,279 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:43:26,279 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:43:26,280 INFO ]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:43:26,280 INFO ]: Start difference. First operand 28 states and 34 transitions. Second operand 32 states. [2018-06-26 18:43:27,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:27,615 INFO ]: Finished difference Result 127 states and 150 transitions. [2018-06-26 18:43:27,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-06-26 18:43:27,615 INFO ]: Start accepts. Automaton has 32 states. Word has length 24 [2018-06-26 18:43:27,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:27,616 INFO ]: With dead ends: 127 [2018-06-26 18:43:27,616 INFO ]: Without dead ends: 117 [2018-06-26 18:43:27,618 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1401, Invalid=6081, Unknown=0, NotChecked=0, Total=7482 [2018-06-26 18:43:27,618 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-26 18:43:27,619 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 29. [2018-06-26 18:43:27,619 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:43:27,619 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-26 18:43:27,619 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2018-06-26 18:43:27,619 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:27,619 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-26 18:43:27,619 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:43:27,620 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-26 18:43:27,620 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:43:27,620 INFO ]: Found error trace [2018-06-26 18:43:27,620 INFO ]: trace histogram [9, 8, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:27,620 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:27,620 INFO ]: Analyzing trace with hash -2144673727, now seen corresponding path program 16 times [2018-06-26 18:43:27,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:27,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:27,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:27,621 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:27,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:27,635 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:27,791 INFO ]: Checked inductivity of 100 backedges. 46 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:27,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:27,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:27,797 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:27,839 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:27,839 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:27,842 INFO ]: Computing forward predicates... [2018-06-26 18:43:28,142 INFO ]: Checked inductivity of 100 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:43:28,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:28,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-26 18:43:28,160 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:43:28,160 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:43:28,160 INFO ]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:43:28,161 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 30 states. [2018-06-26 18:43:28,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:28,380 INFO ]: Finished difference Result 99 states and 114 transitions. [2018-06-26 18:43:28,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:43:28,380 INFO ]: Start accepts. Automaton has 30 states. Word has length 25 [2018-06-26 18:43:28,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:28,380 INFO ]: With dead ends: 99 [2018-06-26 18:43:28,380 INFO ]: Without dead ends: 89 [2018-06-26 18:43:28,381 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1288, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:43:28,381 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-26 18:43:28,382 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 28. [2018-06-26 18:43:28,382 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:43:28,382 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-06-26 18:43:28,382 INFO ]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 25 [2018-06-26 18:43:28,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:28,383 INFO ]: Abstraction has 28 states and 33 transitions. [2018-06-26 18:43:28,383 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:43:28,383 INFO ]: Start isEmpty. Operand 28 states and 33 transitions. [2018-06-26 18:43:28,383 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:43:28,383 INFO ]: Found error trace [2018-06-26 18:43:28,383 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:28,383 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:28,383 INFO ]: Analyzing trace with hash -1925819009, now seen corresponding path program 17 times [2018-06-26 18:43:28,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:28,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:28,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:28,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:28,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:28,396 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:28,669 INFO ]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:43:28,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:28,669 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:28,674 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:28,724 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 18:43:28,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:28,731 INFO ]: Computing forward predicates... [2018-06-26 18:43:28,869 INFO ]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 18:43:28,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:28,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-26 18:43:28,892 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:43:28,892 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:43:28,892 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:43:28,893 INFO ]: Start difference. First operand 28 states and 33 transitions. Second operand 16 states. [2018-06-26 18:43:29,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:29,077 INFO ]: Finished difference Result 49 states and 57 transitions. [2018-06-26 18:43:29,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:43:29,077 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-26 18:43:29,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:29,077 INFO ]: With dead ends: 49 [2018-06-26 18:43:29,077 INFO ]: Without dead ends: 39 [2018-06-26 18:43:29,077 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:43:29,077 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:43:29,078 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-06-26 18:43:29,079 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:43:29,079 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-06-26 18:43:29,079 INFO ]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2018-06-26 18:43:29,079 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:29,079 INFO ]: Abstraction has 30 states and 36 transitions. [2018-06-26 18:43:29,079 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:43:29,079 INFO ]: Start isEmpty. Operand 30 states and 36 transitions. [2018-06-26 18:43:29,079 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:43:29,079 INFO ]: Found error trace [2018-06-26 18:43:29,079 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:29,079 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:29,079 INFO ]: Analyzing trace with hash 563709953, now seen corresponding path program 15 times [2018-06-26 18:43:29,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:29,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:29,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:29,080 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:29,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:29,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:30,001 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:30,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:30,001 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:30,006 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:30,055 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:43:30,055 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:30,059 INFO ]: Computing forward predicates... [2018-06-26 18:43:30,596 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:30,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:30,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-26 18:43:30,615 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:43:30,615 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:43:30,615 INFO ]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:43:30,616 INFO ]: Start difference. First operand 30 states and 36 transitions. Second operand 32 states. [2018-06-26 18:43:31,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:31,021 INFO ]: Finished difference Result 105 states and 122 transitions. [2018-06-26 18:43:31,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:43:31,040 INFO ]: Start accepts. Automaton has 32 states. Word has length 25 [2018-06-26 18:43:31,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:31,041 INFO ]: With dead ends: 105 [2018-06-26 18:43:31,041 INFO ]: Without dead ends: 105 [2018-06-26 18:43:31,041 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=760, Invalid=1790, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 18:43:31,041 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-26 18:43:31,043 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 40. [2018-06-26 18:43:31,043 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 18:43:31,043 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-26 18:43:31,043 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 25 [2018-06-26 18:43:31,043 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:31,043 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-26 18:43:31,043 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:43:31,043 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-26 18:43:31,044 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:43:31,044 INFO ]: Found error trace [2018-06-26 18:43:31,044 INFO ]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:31,044 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:31,044 INFO ]: Analyzing trace with hash -1523526746, now seen corresponding path program 18 times [2018-06-26 18:43:31,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:31,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:31,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:31,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:31,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:31,059 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:31,230 INFO ]: Checked inductivity of 111 backedges. 56 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:31,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:31,230 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:31,235 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:31,286 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:43:31,286 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:31,289 INFO ]: Computing forward predicates... [2018-06-26 18:43:31,322 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:31,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:31,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-26 18:43:31,341 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:43:31,341 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:43:31,341 INFO ]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:43:31,341 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 25 states. [2018-06-26 18:43:31,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:31,619 INFO ]: Finished difference Result 117 states and 135 transitions. [2018-06-26 18:43:31,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 18:43:31,619 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 18:43:31,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:31,620 INFO ]: With dead ends: 117 [2018-06-26 18:43:31,620 INFO ]: Without dead ends: 117 [2018-06-26 18:43:31,620 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=660, Invalid=1232, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:43:31,620 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-26 18:43:31,621 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 31. [2018-06-26 18:43:31,621 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:43:31,621 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-26 18:43:31,621 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2018-06-26 18:43:31,621 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:31,621 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-26 18:43:31,622 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:43:31,622 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-26 18:43:31,622 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:43:31,622 INFO ]: Found error trace [2018-06-26 18:43:31,622 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:31,622 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:31,622 INFO ]: Analyzing trace with hash 294843536, now seen corresponding path program 16 times [2018-06-26 18:43:31,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:31,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:31,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:31,622 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:31,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:31,637 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:31,952 INFO ]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:31,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:31,952 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:31,960 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:32,006 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:32,006 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:32,009 INFO ]: Computing forward predicates... [2018-06-26 18:43:32,054 INFO ]: Checked inductivity of 110 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:32,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:32,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-26 18:43:32,073 INFO ]: Interpolant automaton has 26 states [2018-06-26 18:43:32,073 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 18:43:32,073 INFO ]: CoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:43:32,073 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 26 states. [2018-06-26 18:43:32,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:32,296 INFO ]: Finished difference Result 97 states and 113 transitions. [2018-06-26 18:43:32,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:43:32,297 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-26 18:43:32,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:32,297 INFO ]: With dead ends: 97 [2018-06-26 18:43:32,297 INFO ]: Without dead ends: 86 [2018-06-26 18:43:32,297 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:43:32,297 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 18:43:32,299 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 31. [2018-06-26 18:43:32,299 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:43:32,299 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-26 18:43:32,299 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2018-06-26 18:43:32,299 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:32,299 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-26 18:43:32,299 INFO ]: Interpolant automaton has 26 states. [2018-06-26 18:43:32,299 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-26 18:43:32,299 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:43:32,299 INFO ]: Found error trace [2018-06-26 18:43:32,299 INFO ]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:32,299 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:32,300 INFO ]: Analyzing trace with hash 15015307, now seen corresponding path program 19 times [2018-06-26 18:43:32,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:32,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:32,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:32,300 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:32,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:32,315 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:32,616 INFO ]: Checked inductivity of 121 backedges. 65 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:32,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:32,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:32,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:32,680 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:32,684 INFO ]: Computing forward predicates... [2018-06-26 18:43:32,719 INFO ]: Checked inductivity of 121 backedges. 45 proven. 73 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:43:32,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:32,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-26 18:43:32,737 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:43:32,737 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:43:32,737 INFO ]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:43:32,737 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 24 states. [2018-06-26 18:43:32,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:32,925 INFO ]: Finished difference Result 105 states and 121 transitions. [2018-06-26 18:43:32,925 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:43:32,925 INFO ]: Start accepts. Automaton has 24 states. Word has length 27 [2018-06-26 18:43:32,925 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:32,926 INFO ]: With dead ends: 105 [2018-06-26 18:43:32,926 INFO ]: Without dead ends: 94 [2018-06-26 18:43:32,926 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:43:32,926 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-26 18:43:32,927 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 31. [2018-06-26 18:43:32,927 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:43:32,927 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-26 18:43:32,927 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2018-06-26 18:43:32,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:32,927 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-26 18:43:32,927 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:43:32,927 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-26 18:43:32,927 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:43:32,927 INFO ]: Found error trace [2018-06-26 18:43:32,927 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:32,927 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:32,927 INFO ]: Analyzing trace with hash 21550411, now seen corresponding path program 17 times [2018-06-26 18:43:32,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:32,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:32,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:32,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:32,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:32,940 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:33,380 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:33,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:33,381 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:33,386 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:33,440 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:43:33,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:33,444 INFO ]: Computing forward predicates... [2018-06-26 18:43:33,718 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 18:43:33,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:33,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-06-26 18:43:33,737 INFO ]: Interpolant automaton has 37 states [2018-06-26 18:43:33,737 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 18:43:33,738 INFO ]: CoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:43:33,738 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 37 states. [2018-06-26 18:43:36,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:36,312 INFO ]: Finished difference Result 142 states and 161 transitions. [2018-06-26 18:43:36,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-06-26 18:43:36,313 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-26 18:43:36,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:36,313 INFO ]: With dead ends: 142 [2018-06-26 18:43:36,313 INFO ]: Without dead ends: 130 [2018-06-26 18:43:36,314 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5440 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3202, Invalid=15430, Unknown=0, NotChecked=0, Total=18632 [2018-06-26 18:43:36,314 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-26 18:43:36,315 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 43. [2018-06-26 18:43:36,315 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:43:36,315 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-26 18:43:36,315 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 27 [2018-06-26 18:43:36,316 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:36,316 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-26 18:43:36,316 INFO ]: Interpolant automaton has 37 states. [2018-06-26 18:43:36,316 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-26 18:43:36,316 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:43:36,316 INFO ]: Found error trace [2018-06-26 18:43:36,316 INFO ]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:36,316 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:36,316 INFO ]: Analyzing trace with hash -63190096, now seen corresponding path program 20 times [2018-06-26 18:43:36,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:36,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:36,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:36,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:36,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:36,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:36,835 INFO ]: Checked inductivity of 133 backedges. 67 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:36,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:36,835 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:36,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:43:36,894 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:43:36,894 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:36,898 INFO ]: Computing forward predicates... [2018-06-26 18:43:37,175 INFO ]: Checked inductivity of 133 backedges. 3 proven. 75 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 18:43:37,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:37,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2018-06-26 18:43:37,195 INFO ]: Interpolant automaton has 39 states [2018-06-26 18:43:37,195 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 18:43:37,195 INFO ]: CoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:43:37,195 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 39 states. [2018-06-26 18:43:39,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:39,425 INFO ]: Finished difference Result 110 states and 127 transitions. [2018-06-26 18:43:39,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-06-26 18:43:39,425 INFO ]: Start accepts. Automaton has 39 states. Word has length 28 [2018-06-26 18:43:39,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:39,426 INFO ]: With dead ends: 110 [2018-06-26 18:43:39,426 INFO ]: Without dead ends: 98 [2018-06-26 18:43:39,427 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2539, Invalid=11267, Unknown=0, NotChecked=0, Total=13806 [2018-06-26 18:43:39,427 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-26 18:43:39,428 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 32. [2018-06-26 18:43:39,428 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:43:39,428 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-26 18:43:39,428 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2018-06-26 18:43:39,428 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:39,428 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-26 18:43:39,428 INFO ]: Interpolant automaton has 39 states. [2018-06-26 18:43:39,428 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-26 18:43:39,428 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:43:39,428 INFO ]: Found error trace [2018-06-26 18:43:39,428 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:39,428 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:39,428 INFO ]: Analyzing trace with hash -1897149185, now seen corresponding path program 21 times [2018-06-26 18:43:39,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:39,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:39,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:39,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:39,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:39,448 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:39,743 INFO ]: Checked inductivity of 144 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 18:43:39,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:39,743 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:39,755 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:43:39,824 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 18:43:39,824 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:39,836 INFO ]: Computing forward predicates... [2018-06-26 18:43:41,807 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:41,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:41,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 42 [2018-06-26 18:43:41,839 INFO ]: Interpolant automaton has 42 states [2018-06-26 18:43:41,840 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-26 18:43:41,840 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1614, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:43:41,840 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 42 states. [2018-06-26 18:43:43,924 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-06-26 18:43:45,442 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-26 18:43:48,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:48,138 INFO ]: Finished difference Result 57 states and 64 transitions. [2018-06-26 18:43:48,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:43:48,138 INFO ]: Start accepts. Automaton has 42 states. Word has length 29 [2018-06-26 18:43:48,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:48,138 INFO ]: With dead ends: 57 [2018-06-26 18:43:48,138 INFO ]: Without dead ends: 44 [2018-06-26 18:43:48,138 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=408, Invalid=3252, Unknown=0, NotChecked=0, Total=3660 [2018-06-26 18:43:48,138 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:43:48,139 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-06-26 18:43:48,139 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:43:48,139 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-26 18:43:48,140 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 29 [2018-06-26 18:43:48,140 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:48,140 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-26 18:43:48,140 INFO ]: Interpolant automaton has 42 states. [2018-06-26 18:43:48,140 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-26 18:43:48,140 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:43:48,140 INFO ]: Found error trace [2018-06-26 18:43:48,140 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:48,140 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:48,140 INFO ]: Analyzing trace with hash 26078849, now seen corresponding path program 18 times [2018-06-26 18:43:48,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:48,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:48,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:48,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:48,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:48,153 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:48,355 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:48,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:48,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:48,361 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:48,427 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:43:48,427 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:48,432 INFO ]: Computing forward predicates... [2018-06-26 18:43:48,738 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:48,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:48,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-06-26 18:43:48,758 INFO ]: Interpolant automaton has 39 states [2018-06-26 18:43:48,758 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 18:43:48,758 INFO ]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:43:48,758 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 39 states. [2018-06-26 18:43:49,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:49,357 INFO ]: Finished difference Result 135 states and 154 transitions. [2018-06-26 18:43:49,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 18:43:49,357 INFO ]: Start accepts. Automaton has 39 states. Word has length 29 [2018-06-26 18:43:49,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:49,358 INFO ]: With dead ends: 135 [2018-06-26 18:43:49,358 INFO ]: Without dead ends: 135 [2018-06-26 18:43:49,358 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1017, Invalid=2765, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 18:43:49,358 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-26 18:43:49,360 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 45. [2018-06-26 18:43:49,360 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:43:49,360 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-26 18:43:49,360 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 29 [2018-06-26 18:43:49,360 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:49,360 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-26 18:43:49,360 INFO ]: Interpolant automaton has 39 states. [2018-06-26 18:43:49,360 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-26 18:43:49,360 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:43:49,361 INFO ]: Found error trace [2018-06-26 18:43:49,361 INFO ]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:49,361 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:49,361 INFO ]: Analyzing trace with hash 194830246, now seen corresponding path program 22 times [2018-06-26 18:43:49,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:49,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:49,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:49,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:49,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:49,379 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:49,594 INFO ]: Checked inductivity of 157 backedges. 79 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:49,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:49,594 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:49,600 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:43:49,654 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:43:49,654 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:49,657 INFO ]: Computing forward predicates... [2018-06-26 18:43:49,694 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:49,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:49,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-26 18:43:49,713 INFO ]: Interpolant automaton has 29 states [2018-06-26 18:43:49,713 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 18:43:49,713 INFO ]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:43:49,713 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 29 states. [2018-06-26 18:43:50,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:50,116 INFO ]: Finished difference Result 149 states and 169 transitions. [2018-06-26 18:43:50,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 18:43:50,116 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-26 18:43:50,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:50,116 INFO ]: With dead ends: 149 [2018-06-26 18:43:50,116 INFO ]: Without dead ends: 149 [2018-06-26 18:43:50,116 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=923, Invalid=1729, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 18:43:50,117 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-26 18:43:50,118 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 34. [2018-06-26 18:43:50,118 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:43:50,118 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-06-26 18:43:50,118 INFO ]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 30 [2018-06-26 18:43:50,118 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:50,118 INFO ]: Abstraction has 34 states and 40 transitions. [2018-06-26 18:43:50,118 INFO ]: Interpolant automaton has 29 states. [2018-06-26 18:43:50,118 INFO ]: Start isEmpty. Operand 34 states and 40 transitions. [2018-06-26 18:43:50,118 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:43:50,118 INFO ]: Found error trace [2018-06-26 18:43:50,119 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:50,119 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:50,119 INFO ]: Analyzing trace with hash 808148496, now seen corresponding path program 19 times [2018-06-26 18:43:50,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:50,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:50,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:50,119 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:50,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:50,137 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:50,379 INFO ]: Checked inductivity of 156 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:50,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:50,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:50,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:50,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:50,443 INFO ]: Computing forward predicates... [2018-06-26 18:43:50,494 INFO ]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:43:50,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:50,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2018-06-26 18:43:50,513 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:43:50,513 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:43:50,513 INFO ]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:43:50,513 INFO ]: Start difference. First operand 34 states and 40 transitions. Second operand 30 states. [2018-06-26 18:43:50,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:50,805 INFO ]: Finished difference Result 125 states and 143 transitions. [2018-06-26 18:43:50,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:43:50,805 INFO ]: Start accepts. Automaton has 30 states. Word has length 30 [2018-06-26 18:43:50,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:50,806 INFO ]: With dead ends: 125 [2018-06-26 18:43:50,806 INFO ]: Without dead ends: 112 [2018-06-26 18:43:50,806 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=437, Invalid=1369, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 18:43:50,806 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-26 18:43:50,807 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 35. [2018-06-26 18:43:50,807 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:43:50,808 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-06-26 18:43:50,808 INFO ]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 30 [2018-06-26 18:43:50,808 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:50,808 INFO ]: Abstraction has 35 states and 41 transitions. [2018-06-26 18:43:50,808 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:43:50,808 INFO ]: Start isEmpty. Operand 35 states and 41 transitions. [2018-06-26 18:43:50,808 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:43:50,808 INFO ]: Found error trace [2018-06-26 18:43:50,808 INFO ]: trace histogram [12, 11, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:50,808 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:50,808 INFO ]: Analyzing trace with hash 1744474507, now seen corresponding path program 23 times [2018-06-26 18:43:50,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:50,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:50,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:50,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:43:50,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:50,829 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:51,039 INFO ]: Checked inductivity of 169 backedges. 90 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:51,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:51,039 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:51,046 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:43:51,110 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 18:43:51,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:51,114 INFO ]: Computing forward predicates... [2018-06-26 18:43:51,138 INFO ]: Checked inductivity of 169 backedges. 90 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:43:51,156 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:43:51,156 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-26 18:43:51,157 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:43:51,157 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:43:51,157 INFO ]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:43:51,157 INFO ]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2018-06-26 18:43:51,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:43:51,556 INFO ]: Finished difference Result 147 states and 165 transitions. [2018-06-26 18:43:51,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:43:51,556 INFO ]: Start accepts. Automaton has 28 states. Word has length 31 [2018-06-26 18:43:51,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:43:51,557 INFO ]: With dead ends: 147 [2018-06-26 18:43:51,557 INFO ]: Without dead ends: 134 [2018-06-26 18:43:51,557 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=418, Invalid=1222, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:43:51,558 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 18:43:51,559 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 34. [2018-06-26 18:43:51,559 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:43:51,559 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-06-26 18:43:51,559 INFO ]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-06-26 18:43:51,559 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:43:51,559 INFO ]: Abstraction has 34 states and 39 transitions. [2018-06-26 18:43:51,559 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:43:51,559 INFO ]: Start isEmpty. Operand 34 states and 39 transitions. [2018-06-26 18:43:51,559 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:43:51,559 INFO ]: Found error trace [2018-06-26 18:43:51,559 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:43:51,560 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:43:51,560 INFO ]: Analyzing trace with hash 1235001417, now seen corresponding path program 24 times [2018-06-26 18:43:51,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:43:51,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:43:51,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:51,560 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:43:51,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:43:51,588 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:52,199 INFO ]: Checked inductivity of 169 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 18:43:52,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:43:52,199 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:52,204 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:43:52,282 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 18:43:52,282 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:43:52,292 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 18:43:54,620 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV_MAIN_2_0_Int_222 Int) (v_gotoProc_hhv_INV_MAIN_2_5_Int_62 Int)) (let ((.cse2 (+ c_gotoProc_hhv_INV_MAIN_2_5_Int c_gotoProc_hhv_INV_MAIN_2_4_Int)) (.cse1 (+ v_gotoProc_hhv_INV_MAIN_2_5_Int_62 8)) (.cse0 (+ v_gotoProc_hhv_INV_MAIN_2_0_Int_222 8))) (and (<= .cse0 c_gotoProc_hhv_INV_MAIN_2_1_Int) (<= .cse1 .cse2) (not (= (+ c_gotoProc_hhv_INV_MAIN_2_2_Int (* 10 v_gotoProc_hhv_INV_MAIN_2_0_Int_222) (* 8 c_gotoProc_hhv_INV_MAIN_2_5_Int)) (+ (* 9 v_gotoProc_hhv_INV_MAIN_2_5_Int_62) 1))) (<= .cse2 .cse1) (<= c_gotoProc_hhv_INV_MAIN_2_1_Int .cse0)))) is different from true [2018-06-26 18:43:54,621 INFO ]: Timeout while computing interpolants [2018-06-26 18:43:54,822 WARN ]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:43:54,822 WARN ]: Verification canceled [2018-06-26 18:43:54,823 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:43:54,824 WARN ]: Timeout [2018-06-26 18:43:54,824 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:43:54 BasicIcfg [2018-06-26 18:43:54,824 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:43:54,825 INFO ]: Toolchain (without parser) took 58462.45 ms. Allocated memory was 303.0 MB in the beginning and 806.9 MB in the end (delta: 503.8 MB). Free memory was 258.5 MB in the beginning and 368.8 MB in the end (delta: -110.3 MB). Peak memory consumption was 393.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,826 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:43:54,826 INFO ]: ChcToBoogie took 60.48 ms. Allocated memory is still 303.0 MB. Free memory was 258.5 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,826 INFO ]: Boogie Preprocessor took 43.23 ms. Allocated memory is still 303.0 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,827 INFO ]: RCFGBuilder took 375.80 ms. Allocated memory is still 303.0 MB. Free memory was 254.5 MB in the beginning and 245.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,827 INFO ]: BlockEncodingV2 took 66.76 ms. Allocated memory is still 303.0 MB. Free memory was 244.5 MB in the beginning and 242.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,827 INFO ]: TraceAbstraction took 57907.97 ms. Allocated memory was 303.0 MB in the beginning and 806.9 MB in the end (delta: 503.8 MB). Free memory was 242.5 MB in the beginning and 368.8 MB in the end (delta: -126.3 MB). Peak memory consumption was 377.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:54,830 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 16 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 303.0 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.48 ms. Allocated memory is still 303.0 MB. Free memory was 258.5 MB in the beginning and 256.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 43.23 ms. Allocated memory is still 303.0 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 375.80 ms. Allocated memory is still 303.0 MB. Free memory was 254.5 MB in the beginning and 245.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 66.76 ms. Allocated memory is still 303.0 MB. Free memory was 244.5 MB in the beginning and 242.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57907.97 ms. Allocated memory was 303.0 MB in the beginning and 806.9 MB in the end (delta: 503.8 MB). Free memory was 242.5 MB in the beginning and 368.8 MB in the end (delta: -126.3 MB). Peak memory consumption was 377.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 8 quantified variables from 9 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 57.8s OverallTime, 55 OverallIterations, 12 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 386 SDtfs, 626 SDslu, 2744 SDs, 0 SdLazy, 10671 SolverSat, 2614 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2458 GetRequests, 725 SyntacticMatches, 38 SemanticMatches, 1695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23292 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=51, 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, 54 MinimizatonAttempts, 1734 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 1825 NumberOfCodeBlocks, 1825 NumberOfCodeBlocksAsserted, 193 NumberOfCheckSat, 1722 ConstructedInterpolants, 18 QuantifiedInterpolants, 206723 SizeOfPredicates, 223 NumberOfNonLiveVariables, 16181 ConjunctsInSsa, 3044 ConjunctsInUnsatCore, 103 InterpolantComputations, 6 PerfectInterpolantSequences, 2549/5550 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/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-43-54-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-43-54-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-43-54-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-43-54-839.csv Completed graceful shutdown