java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:54:05,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:54:05,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:54:05,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:54:05,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:54:05,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:54:05,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:54:05,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:54:05,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:54:05,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:54:05,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:54:05,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:54:05,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:54:05,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:54:05,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:54:05,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:54:05,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:54:05,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:54:05,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:54:05,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:54:05,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:54:05,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:54:05,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:54:05,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:54:05,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:54:05,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:54:05,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:54:05,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:54:05,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:54:05,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:54:05,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:54:05,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:54:05,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:54:05,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:54:05,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:54:05,803 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:54:05,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:54:05,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:54:05,822 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:54:05,822 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:54:05,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:54:05,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:54:05,823 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:54:05,823 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:54:05,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:54:05,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:54:05,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:54:05,824 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:54:05,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:54:05,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:54:05,825 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:54:05,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:54:05,825 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:54:05,825 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:54:05,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:54:05,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:54:05,826 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:54:05,827 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:54:05,827 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:54:05,880 INFO ]: Repository-Root is: /tmp [2018-06-24 20:54:05,899 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:54:05,905 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:54:05,906 INFO ]: Initializing SmtParser... [2018-06-24 20:54:05,907 INFO ]: SmtParser initialized [2018-06-24 20:54:05,907 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 [2018-06-24 20:54:05,908 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:54:05,991 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 unknown [2018-06-24 20:54:06,228 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 [2018-06-24 20:54:06,233 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:54:06,240 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:54:06,240 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:54:06,240 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:54:06,241 INFO ]: ChcToBoogie initialized [2018-06-24 20:54:06,244 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,294 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06 Unit [2018-06-24 20:54:06,294 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:54:06,295 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:54:06,295 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:54:06,295 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:54:06,315 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,315 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,321 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,322 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,325 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,327 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,327 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,329 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:54:06,329 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:54:06,329 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:54:06,329 INFO ]: RCFGBuilder initialized [2018-06-24 20:54:06,332 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:54:06,345 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:54:06,345 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:54:06,345 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:54:06,345 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:54:06,345 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:54:06,345 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:54:06,569 INFO ]: Using library mode [2018-06-24 20:54:06,570 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:06 BoogieIcfgContainer [2018-06-24 20:54:06,570 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:54:06,570 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:54:06,570 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:54:06,577 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:54:06,577 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:06" (1/1) ... [2018-06-24 20:54:06,607 INFO ]: Initial Icfg 13 locations, 14 edges [2018-06-24 20:54:06,610 INFO ]: Using Remove infeasible edges [2018-06-24 20:54:06,610 INFO ]: Using Maximize final states [2018-06-24 20:54:06,611 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:54:06,611 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:54:06,613 INFO ]: Using Remove sink states [2018-06-24 20:54:06,617 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:54:06,617 INFO ]: Using Use SBE [2018-06-24 20:54:06,624 INFO ]: SBE split 0 edges [2018-06-24 20:54:06,630 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:54:06,632 INFO ]: 0 new accepting states [2018-06-24 20:54:06,669 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:54:06,671 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:54:06,674 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:54:06,674 INFO ]: 0 new accepting states [2018-06-24 20:54:06,674 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:54:06,675 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:54:06,675 INFO ]: Encoded RCFG 7 locations, 8 edges [2018-06-24 20:54:06,675 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:54:06 BasicIcfg [2018-06-24 20:54:06,675 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:54:06,676 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:54:06,676 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:54:06,679 INFO ]: TraceAbstraction initialized [2018-06-24 20:54:06,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:54:06" (1/4) ... [2018-06-24 20:54:06,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:54:06, skipping insertion in model container [2018-06-24 20:54:06,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:06" (2/4) ... [2018-06-24 20:54:06,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:54:06, skipping insertion in model container [2018-06-24 20:54:06,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:06" (3/4) ... [2018-06-24 20:54:06,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970deae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:54:06, skipping insertion in model container [2018-06-24 20:54:06,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:54:06" (4/4) ... [2018-06-24 20:54:06,682 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:54:06,691 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:54:06,698 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:54:06,738 INFO ]: Using default assertion order modulation [2018-06-24 20:54:06,738 INFO ]: Interprodecural is true [2018-06-24 20:54:06,738 INFO ]: Hoare is false [2018-06-24 20:54:06,738 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:54:06,738 INFO ]: Backedges is TWOTRACK [2018-06-24 20:54:06,738 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:54:06,738 INFO ]: Difference is false [2018-06-24 20:54:06,738 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:54:06,738 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:54:06,751 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:54:06,769 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:54:06,769 INFO ]: Found error trace [2018-06-24 20:54:06,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:54:06,770 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:06,775 INFO ]: Analyzing trace with hash 987439445, now seen corresponding path program 1 times [2018-06-24 20:54:06,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:06,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:06,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:06,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:06,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:06,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:06,943 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:06,945 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:06,945 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:54:06,946 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:54:06,958 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:54:06,958 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:54:06,960 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-24 20:54:07,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:07,042 INFO ]: Finished difference Result 8 states and 9 transitions. [2018-06-24 20:54:07,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:54:07,043 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:54:07,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:07,049 INFO ]: With dead ends: 8 [2018-06-24 20:54:07,049 INFO ]: Without dead ends: 8 [2018-06-24 20:54:07,051 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:07,067 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:54:07,083 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:54:07,084 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:54:07,086 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:54:07,087 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-24 20:54:07,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:07,087 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:54:07,087 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:54:07,087 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:54:07,088 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:54:07,088 INFO ]: Found error trace [2018-06-24 20:54:07,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:07,088 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:07,088 INFO ]: Analyzing trace with hash 545379014, now seen corresponding path program 1 times [2018-06-24 20:54:07,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:07,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:07,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:07,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:07,374 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:07,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:07,374 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:07,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:07,433 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:07,440 INFO ]: Computing forward predicates... [2018-06-24 20:54:07,533 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:07,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:07,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:54:07,554 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:54:07,554 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:54:07,555 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:07,555 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-06-24 20:54:07,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:07,703 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-24 20:54:07,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:54:07,703 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:54:07,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:07,705 INFO ]: With dead ends: 13 [2018-06-24 20:54:07,705 INFO ]: Without dead ends: 13 [2018-06-24 20:54:07,706 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:07,706 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:54:07,708 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:54:07,708 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:54:07,708 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:54:07,708 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-06-24 20:54:07,708 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:07,708 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:54:07,708 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:54:07,708 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:54:07,709 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:07,709 INFO ]: Found error trace [2018-06-24 20:54:07,709 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:07,709 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:07,709 INFO ]: Analyzing trace with hash -273592459, now seen corresponding path program 2 times [2018-06-24 20:54:07,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:07,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:07,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:07,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:07,725 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:07,955 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:07,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:07,955 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:07,963 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:08,017 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:08,017 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,019 INFO ]: Computing forward predicates... [2018-06-24 20:54:08,210 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:08,230 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:54:08,230 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-24 20:54:08,230 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:54:08,230 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:54:08,230 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:54:08,230 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 10 states. [2018-06-24 20:54:08,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:08,420 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-24 20:54:08,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:54:08,421 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 20:54:08,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:08,421 INFO ]: With dead ends: 12 [2018-06-24 20:54:08,421 INFO ]: Without dead ends: 9 [2018-06-24 20:54:08,422 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:08,422 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:54:08,423 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:54:08,423 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:54:08,424 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:54:08,424 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-24 20:54:08,424 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:08,424 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:54:08,424 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:54:08,424 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:54:08,424 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:08,424 INFO ]: Found error trace [2018-06-24 20:54:08,424 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:08,424 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:08,424 INFO ]: Analyzing trace with hash -240345703, now seen corresponding path program 1 times [2018-06-24 20:54:08,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:08,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:08,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,425 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:08,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,437 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,497 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:08,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:08,497 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:08,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:08,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:08,528 INFO ]: Computing forward predicates... [2018-06-24 20:54:08,557 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:08,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:08,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:54:08,581 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:54:08,581 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:54:08,581 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:08,581 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2018-06-24 20:54:08,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:08,919 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-24 20:54:08,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:54:08,921 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:54:08,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:08,921 INFO ]: With dead ends: 10 [2018-06-24 20:54:08,921 INFO ]: Without dead ends: 10 [2018-06-24 20:54:08,922 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:54:08,922 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:54:08,923 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:54:08,923 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:54:08,923 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:54:08,923 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-24 20:54:08,923 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:08,923 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:54:08,923 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:54:08,923 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:54:08,923 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:54:08,923 INFO ]: Found error trace [2018-06-24 20:54:08,924 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:08,924 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:08,924 INFO ]: Analyzing trace with hash 1138745090, now seen corresponding path program 2 times [2018-06-24 20:54:08,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:08,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:08,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:08,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:08,949 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,021 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:09,021 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:09,029 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:09,056 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:09,056 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,058 INFO ]: Computing forward predicates... [2018-06-24 20:54:09,095 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:09,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:54:09,116 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:54:09,116 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:54:09,117 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:09,117 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2018-06-24 20:54:09,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:09,275 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:54:09,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:54:09,275 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:54:09,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:09,275 INFO ]: With dead ends: 16 [2018-06-24 20:54:09,275 INFO ]: Without dead ends: 16 [2018-06-24 20:54:09,277 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:54:09,277 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:54:09,278 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-24 20:54:09,278 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:54:09,279 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:54:09,279 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-24 20:54:09,279 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:09,279 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:54:09,279 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:54:09,279 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:54:09,279 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:54:09,279 INFO ]: Found error trace [2018-06-24 20:54:09,279 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:09,279 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:09,280 INFO ]: Analyzing trace with hash 940886713, now seen corresponding path program 3 times [2018-06-24 20:54:09,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:09,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:09,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:09,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,293 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,369 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:09,369 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:09,376 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:09,427 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:54:09,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,429 INFO ]: Computing forward predicates... [2018-06-24 20:54:09,562 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:09,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:54:09,582 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:54:09,582 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:54:09,582 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:54:09,582 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2018-06-24 20:54:09,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:09,677 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-24 20:54:09,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:54:09,677 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 20:54:09,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:09,678 INFO ]: With dead ends: 15 [2018-06-24 20:54:09,678 INFO ]: Without dead ends: 11 [2018-06-24 20:54:09,678 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:54:09,678 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:54:09,679 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:54:09,679 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:54:09,680 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:54:09,680 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-24 20:54:09,680 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:09,680 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:54:09,680 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:54:09,680 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:54:09,680 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:54:09,680 INFO ]: Found error trace [2018-06-24 20:54:09,680 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:09,680 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:09,680 INFO ]: Analyzing trace with hash 1971536149, now seen corresponding path program 4 times [2018-06-24 20:54:09,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:09,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:09,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,681 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:09,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,795 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:09,795 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:09,801 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:09,820 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:09,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:09,822 INFO ]: Computing forward predicates... [2018-06-24 20:54:09,880 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:09,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:09,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:54:09,901 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:54:09,901 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:54:09,901 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:54:09,901 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-06-24 20:54:09,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:09,955 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-24 20:54:09,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:54:09,955 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:54:09,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:09,956 INFO ]: With dead ends: 12 [2018-06-24 20:54:09,956 INFO ]: Without dead ends: 12 [2018-06-24 20:54:09,956 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:09,956 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:54:09,957 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:54:09,957 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:54:09,957 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:54:09,958 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-24 20:54:09,958 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:09,958 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:54:09,958 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:54:09,958 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:54:09,958 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:54:09,958 INFO ]: Found error trace [2018-06-24 20:54:09,958 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:09,958 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:09,958 INFO ]: Analyzing trace with hash 987605766, now seen corresponding path program 5 times [2018-06-24 20:54:09,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:09,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:09,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:09,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:09,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,088 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:10,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:10,088 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:10,094 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:10,134 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:54:10,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,137 INFO ]: Computing forward predicates... [2018-06-24 20:54:10,197 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:10,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:10,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:54:10,216 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:54:10,216 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:54:10,216 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:54:10,216 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2018-06-24 20:54:10,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:10,325 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:54:10,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:54:10,325 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:54:10,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:10,326 INFO ]: With dead ends: 19 [2018-06-24 20:54:10,326 INFO ]: Without dead ends: 19 [2018-06-24 20:54:10,326 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:54:10,327 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:54:10,328 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 20:54:10,328 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:54:10,329 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:54:10,329 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-24 20:54:10,329 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:10,329 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:54:10,329 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:54:10,329 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:54:10,329 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:54:10,329 INFO ]: Found error trace [2018-06-24 20:54:10,329 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:10,330 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:10,330 INFO ]: Analyzing trace with hash 550534965, now seen corresponding path program 6 times [2018-06-24 20:54:10,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:10,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:10,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,330 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:10,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,342 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,661 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:10,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:10,661 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:10,667 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:10,685 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:54:10,685 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:10,687 INFO ]: Computing forward predicates... [2018-06-24 20:54:10,774 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:10,795 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:10,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:54:10,795 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:54:10,795 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:54:10,796 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:54:10,796 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 14 states. [2018-06-24 20:54:10,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:10,915 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-24 20:54:10,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:54:10,916 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-24 20:54:10,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:10,916 INFO ]: With dead ends: 18 [2018-06-24 20:54:10,916 INFO ]: Without dead ends: 13 [2018-06-24 20:54:10,916 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:10,916 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:54:10,917 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:54:10,917 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:54:10,918 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:54:10,918 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-24 20:54:10,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:10,918 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:54:10,918 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:54:10,918 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:54:10,918 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:54:10,918 INFO ]: Found error trace [2018-06-24 20:54:10,918 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:10,918 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:10,919 INFO ]: Analyzing trace with hash -1859070887, now seen corresponding path program 7 times [2018-06-24 20:54:10,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:10,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:10,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:10,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:10,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,006 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:11,006 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:11,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:11,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,033 INFO ]: Computing forward predicates... [2018-06-24 20:54:11,094 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:11,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:54:11,114 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:54:11,115 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:54:11,115 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:11,115 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 13 states. [2018-06-24 20:54:11,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:11,177 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-24 20:54:11,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:54:11,177 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 20:54:11,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:11,177 INFO ]: With dead ends: 14 [2018-06-24 20:54:11,177 INFO ]: Without dead ends: 14 [2018-06-24 20:54:11,178 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:11,178 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:54:11,179 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:54:11,179 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:54:11,179 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:54:11,179 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 20:54:11,180 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:11,180 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:54:11,180 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:54:11,180 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:54:11,180 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:54:11,180 INFO ]: Found error trace [2018-06-24 20:54:11,180 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:11,180 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:11,180 INFO ]: Analyzing trace with hash -1797095358, now seen corresponding path program 8 times [2018-06-24 20:54:11,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:11,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:11,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:11,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,196 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,291 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:11,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:54:11,306 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:11,353 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:11,353 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,356 INFO ]: Computing forward predicates... [2018-06-24 20:54:11,464 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:11,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:54:11,483 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:54:11,483 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:54:11,483 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:54:11,483 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2018-06-24 20:54:11,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:11,655 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-24 20:54:11,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:11,655 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:54:11,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:11,656 INFO ]: With dead ends: 22 [2018-06-24 20:54:11,656 INFO ]: Without dead ends: 22 [2018-06-24 20:54:11,656 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:54:11,656 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:54:11,660 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 20:54:11,660 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:54:11,660 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:54:11,660 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-24 20:54:11,660 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:11,660 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:54:11,660 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:54:11,660 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:54:11,661 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:54:11,661 INFO ]: Found error trace [2018-06-24 20:54:11,661 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:11,661 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:11,661 INFO ]: Analyzing trace with hash 124146041, now seen corresponding path program 9 times [2018-06-24 20:54:11,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:11,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:11,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:11,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:11,672 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,889 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:11,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:11,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:11,915 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:11,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:54:11,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:11,956 INFO ]: Computing forward predicates... [2018-06-24 20:54:12,190 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:12,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:12,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 20:54:12,210 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:54:12,211 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:54:12,211 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:12,211 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 17 states. [2018-06-24 20:54:12,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:12,441 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-24 20:54:12,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:12,441 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-24 20:54:12,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:12,441 INFO ]: With dead ends: 21 [2018-06-24 20:54:12,441 INFO ]: Without dead ends: 15 [2018-06-24 20:54:12,442 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:12,442 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:54:12,443 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:54:12,443 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:54:12,443 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 20:54:12,443 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-24 20:54:12,443 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:12,443 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 20:54:12,443 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:54:12,443 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 20:54:12,444 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:54:12,444 INFO ]: Found error trace [2018-06-24 20:54:12,444 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:12,444 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:12,444 INFO ]: Analyzing trace with hash -1559191339, now seen corresponding path program 10 times [2018-06-24 20:54:12,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:12,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:12,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:12,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,453 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:12,603 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:12,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:12,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:12,609 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:12,629 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:12,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:12,630 INFO ]: Computing forward predicates... [2018-06-24 20:54:12,766 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:12,786 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:12,786 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:54:12,786 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:54:12,787 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:54:12,787 INFO ]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:54:12,787 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2018-06-24 20:54:12,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:12,859 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-24 20:54:12,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:54:12,859 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:54:12,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:12,859 INFO ]: With dead ends: 16 [2018-06-24 20:54:12,859 INFO ]: Without dead ends: 16 [2018-06-24 20:54:12,859 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:12,859 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:54:12,861 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:54:12,861 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:54:12,861 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:54:12,861 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-24 20:54:12,861 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:12,861 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:54:12,861 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:54:12,861 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:54:12,862 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:54:12,862 INFO ]: Found error trace [2018-06-24 20:54:12,862 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:12,862 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:12,862 INFO ]: Analyzing trace with hash -1090763962, now seen corresponding path program 11 times [2018-06-24 20:54:12,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:12,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:12,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,862 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:12,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:12,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:13,186 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:13,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:13,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:13,192 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:13,214 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:54:13,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:13,216 INFO ]: Computing forward predicates... [2018-06-24 20:54:13,314 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:13,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:13,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:54:13,333 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:54:13,333 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:54:13,333 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:54:13,333 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2018-06-24 20:54:13,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:13,543 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:54:13,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:13,543 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:54:13,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:13,544 INFO ]: With dead ends: 25 [2018-06-24 20:54:13,544 INFO ]: Without dead ends: 25 [2018-06-24 20:54:13,544 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:13,544 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:13,546 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-24 20:54:13,546 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:54:13,546 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:54:13,546 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-24 20:54:13,547 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:13,547 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:54:13,547 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:54:13,547 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:54:13,547 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:54:13,547 INFO ]: Found error trace [2018-06-24 20:54:13,547 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:13,547 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:13,547 INFO ]: Analyzing trace with hash 545582837, now seen corresponding path program 12 times [2018-06-24 20:54:13,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:13,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:13,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:13,548 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:13,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:13,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,309 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:14,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:14,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:14,315 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:14,377 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:54:14,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,379 INFO ]: Computing forward predicates... [2018-06-24 20:54:14,508 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:14,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:14,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-24 20:54:14,527 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:54:14,527 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:54:14,527 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:54:14,527 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 20 states. [2018-06-24 20:54:14,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:14,636 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-24 20:54:14,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:14,636 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-24 20:54:14,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:14,636 INFO ]: With dead ends: 24 [2018-06-24 20:54:14,636 INFO ]: Without dead ends: 17 [2018-06-24 20:54:14,637 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:14,637 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:54:14,638 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:54:14,638 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:54:14,638 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 20:54:14,638 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-24 20:54:14,638 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:14,638 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 20:54:14,638 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:54:14,638 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 20:54:14,639 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:54:14,639 INFO ]: Found error trace [2018-06-24 20:54:14,639 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:14,639 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:14,639 INFO ]: Analyzing trace with hash -98268391, now seen corresponding path program 13 times [2018-06-24 20:54:14,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:14,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:14,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:14,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:14,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:14,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,786 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:14,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:14,786 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:14,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:14,813 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:14,815 INFO ]: Computing forward predicates... [2018-06-24 20:54:14,932 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:14,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:14,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-24 20:54:14,953 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:54:14,953 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:54:14,953 INFO ]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:14,953 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 19 states. [2018-06-24 20:54:15,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:15,191 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-24 20:54:15,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:54:15,191 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:54:15,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:15,192 INFO ]: With dead ends: 18 [2018-06-24 20:54:15,192 INFO ]: Without dead ends: 18 [2018-06-24 20:54:15,192 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:15,192 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:54:15,193 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:54:15,193 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:54:15,194 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:54:15,194 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-24 20:54:15,194 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:15,194 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:54:15,194 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:54:15,194 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:54:15,194 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:54:15,194 INFO ]: Found error trace [2018-06-24 20:54:15,194 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:15,194 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:15,195 INFO ]: Analyzing trace with hash 1248174466, now seen corresponding path program 14 times [2018-06-24 20:54:15,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:15,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:15,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:15,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:15,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:15,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:15,737 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:15,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:15,737 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:15,743 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:15,766 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:15,766 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:15,769 INFO ]: Computing forward predicates... [2018-06-24 20:54:15,840 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:15,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:15,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:54:15,859 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:54:15,859 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:54:15,860 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:54:15,860 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 15 states. [2018-06-24 20:54:16,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:16,081 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-24 20:54:16,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:16,081 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:54:16,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:16,082 INFO ]: With dead ends: 28 [2018-06-24 20:54:16,082 INFO ]: Without dead ends: 28 [2018-06-24 20:54:16,082 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:54:16,083 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:54:16,084 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-24 20:54:16,084 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:54:16,085 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:54:16,085 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-24 20:54:16,085 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:16,085 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:54:16,085 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:54:16,085 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:54:16,085 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:54:16,085 INFO ]: Found error trace [2018-06-24 20:54:16,085 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:16,085 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:16,086 INFO ]: Analyzing trace with hash 38230073, now seen corresponding path program 15 times [2018-06-24 20:54:16,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:16,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:16,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:16,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:16,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:16,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:16,507 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:16,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:16,507 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:16,512 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:16,540 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:54:16,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:16,542 INFO ]: Computing forward predicates... [2018-06-24 20:54:16,647 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:16,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:16,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-24 20:54:16,667 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:54:16,667 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:54:16,667 INFO ]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:16,667 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-24 20:54:16,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:16,782 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-24 20:54:16,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:16,783 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-24 20:54:16,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:16,783 INFO ]: With dead ends: 27 [2018-06-24 20:54:16,783 INFO ]: Without dead ends: 19 [2018-06-24 20:54:16,784 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:16,784 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:54:16,785 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:54:16,785 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:54:16,786 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:54:16,786 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-24 20:54:16,786 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:16,786 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:54:16,786 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:54:16,786 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:54:16,786 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:54:16,786 INFO ]: Found error trace [2018-06-24 20:54:16,786 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:16,786 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:16,786 INFO ]: Analyzing trace with hash 1553678485, now seen corresponding path program 16 times [2018-06-24 20:54:16,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:16,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:16,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:16,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:16,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:16,796 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:17,086 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:17,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:17,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:17,115 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:17,151 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:17,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:17,153 INFO ]: Computing forward predicates... [2018-06-24 20:54:17,267 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:17,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:17,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-24 20:54:17,287 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:54:17,287 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:54:17,287 INFO ]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:54:17,287 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 22 states. [2018-06-24 20:54:17,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:17,401 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-24 20:54:17,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:54:17,401 INFO ]: Start accepts. Automaton has 22 states. Word has length 18 [2018-06-24 20:54:17,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:17,401 INFO ]: With dead ends: 20 [2018-06-24 20:54:17,401 INFO ]: Without dead ends: 20 [2018-06-24 20:54:17,402 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:17,402 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:54:17,403 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:54:17,403 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:54:17,403 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 20:54:17,403 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-24 20:54:17,403 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:17,403 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 20:54:17,403 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:54:17,403 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 20:54:17,404 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:54:17,404 INFO ]: Found error trace [2018-06-24 20:54:17,404 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:17,404 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:17,404 INFO ]: Analyzing trace with hash 918920070, now seen corresponding path program 17 times [2018-06-24 20:54:17,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:17,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:17,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:17,405 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:17,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:17,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:17,652 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:17,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:17,652 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) [2018-06-24 20:54:17,668 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:17,700 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:54:17,700 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:17,703 INFO ]: Computing forward predicates... [2018-06-24 20:54:17,772 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:17,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:17,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:54:17,792 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:54:17,792 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:54:17,792 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:54:17,792 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-06-24 20:54:18,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:18,145 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-24 20:54:18,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:18,145 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:54:18,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:18,145 INFO ]: With dead ends: 31 [2018-06-24 20:54:18,145 INFO ]: Without dead ends: 31 [2018-06-24 20:54:18,146 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:18,146 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:54:18,147 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-24 20:54:18,148 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:54:18,148 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-24 20:54:18,148 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-24 20:54:18,148 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:18,148 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-24 20:54:18,148 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:54:18,148 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-24 20:54:18,148 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:54:18,149 INFO ]: Found error trace [2018-06-24 20:54:18,149 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:18,149 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:18,149 INFO ]: Analyzing trace with hash -1578721611, now seen corresponding path program 18 times [2018-06-24 20:54:18,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:18,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:18,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:18,149 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:18,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:18,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:18,353 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:18,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:18,353 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:18,360 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:18,393 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:54:18,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:18,395 INFO ]: Computing forward predicates... [2018-06-24 20:54:18,529 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:18,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:18,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-24 20:54:18,556 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:54:18,556 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:54:18,556 INFO ]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:54:18,556 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 26 states. [2018-06-24 20:54:18,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:18,718 INFO ]: Finished difference Result 30 states and 32 transitions. [2018-06-24 20:54:18,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:18,718 INFO ]: Start accepts. Automaton has 26 states. Word has length 20 [2018-06-24 20:54:18,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:18,719 INFO ]: With dead ends: 30 [2018-06-24 20:54:18,719 INFO ]: Without dead ends: 21 [2018-06-24 20:54:18,719 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:18,719 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:54:18,721 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:54:18,721 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:54:18,721 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:54:18,721 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-24 20:54:18,721 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:18,721 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:54:18,721 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:54:18,721 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:54:18,722 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:54:18,722 INFO ]: Found error trace [2018-06-24 20:54:18,722 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:18,722 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:18,722 INFO ]: Analyzing trace with hash -1844461095, now seen corresponding path program 19 times [2018-06-24 20:54:18,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:18,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:18,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:18,723 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:18,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:18,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:18,987 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:18,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:18,987 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:18,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:19,022 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:19,024 INFO ]: Computing forward predicates... [2018-06-24 20:54:19,155 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:19,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:19,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:54:19,174 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:54:19,174 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:54:19,174 INFO ]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:19,175 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-24 20:54:19,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:19,306 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-24 20:54:19,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:54:19,307 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-24 20:54:19,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:19,307 INFO ]: With dead ends: 22 [2018-06-24 20:54:19,307 INFO ]: Without dead ends: 22 [2018-06-24 20:54:19,308 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=724, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:19,308 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:54:19,309 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:54:19,309 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:54:19,310 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-24 20:54:19,310 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-24 20:54:19,310 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:19,310 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-24 20:54:19,310 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:54:19,310 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-24 20:54:19,310 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:54:19,310 INFO ]: Found error trace [2018-06-24 20:54:19,310 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:19,310 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:19,310 INFO ]: Analyzing trace with hash -1344191806, now seen corresponding path program 20 times [2018-06-24 20:54:19,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:19,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:19,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:19,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:19,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:19,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:19,598 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:19,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:19,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:19,603 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:19,643 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:19,643 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:19,646 INFO ]: Computing forward predicates... [2018-06-24 20:54:19,743 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:19,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:19,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:54:19,761 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:54:19,761 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:54:19,762 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:54:19,762 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 19 states. [2018-06-24 20:54:20,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:20,155 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-24 20:54:20,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:20,155 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:54:20,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:20,156 INFO ]: With dead ends: 34 [2018-06-24 20:54:20,156 INFO ]: Without dead ends: 34 [2018-06-24 20:54:20,156 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:54:20,156 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:54:20,157 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-24 20:54:20,157 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:54:20,157 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:54:20,157 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-24 20:54:20,157 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:20,157 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:54:20,157 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:54:20,157 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:54:20,158 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:54:20,158 INFO ]: Found error trace [2018-06-24 20:54:20,158 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:20,158 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:20,158 INFO ]: Analyzing trace with hash 1279254265, now seen corresponding path program 21 times [2018-06-24 20:54:20,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:20,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:20,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,162 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:20,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:20,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:20,314 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:20,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:20,314 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:20,320 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:20,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:54:20,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:20,356 INFO ]: Computing forward predicates... [2018-06-24 20:54:20,633 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:20,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:20,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-24 20:54:20,656 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:54:20,656 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:54:20,656 INFO ]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:20,656 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 29 states. [2018-06-24 20:54:21,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:21,466 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-24 20:54:21,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:21,466 INFO ]: Start accepts. Automaton has 29 states. Word has length 22 [2018-06-24 20:54:21,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:21,466 INFO ]: With dead ends: 33 [2018-06-24 20:54:21,466 INFO ]: Without dead ends: 23 [2018-06-24 20:54:21,467 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:54:21,467 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:54:21,468 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:54:21,468 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:54:21,469 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:54:21,469 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-24 20:54:21,469 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:21,469 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:54:21,469 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:54:21,469 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:54:21,469 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:54:21,469 INFO ]: Found error trace [2018-06-24 20:54:21,469 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:21,469 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:21,469 INFO ]: Analyzing trace with hash 1631264853, now seen corresponding path program 22 times [2018-06-24 20:54:21,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:21,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:21,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:21,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:21,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:21,479 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:21,874 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:21,874 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:21,874 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:21,881 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:21,910 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:21,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:21,912 INFO ]: Computing forward predicates... [2018-06-24 20:54:22,141 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:22,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:22,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:54:22,165 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:54:22,166 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:54:22,166 INFO ]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:54:22,166 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 28 states. [2018-06-24 20:54:22,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:22,345 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-24 20:54:22,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:54:22,345 INFO ]: Start accepts. Automaton has 28 states. Word has length 22 [2018-06-24 20:54:22,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:22,345 INFO ]: With dead ends: 24 [2018-06-24 20:54:22,345 INFO ]: Without dead ends: 24 [2018-06-24 20:54:22,346 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=918, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:22,346 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:54:22,348 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:54:22,348 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:54:22,348 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:54:22,348 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-24 20:54:22,348 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:22,348 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:54:22,348 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:54:22,348 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:54:22,348 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:54:22,348 INFO ]: Found error trace [2018-06-24 20:54:22,348 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:22,349 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:22,349 INFO ]: Analyzing trace with hash -970869818, now seen corresponding path program 23 times [2018-06-24 20:54:22,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:22,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:22,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:22,349 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:22,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:22,373 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:22,635 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:22,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:22,635 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:22,644 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:22,680 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:54:22,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:22,683 INFO ]: Computing forward predicates... [2018-06-24 20:54:22,731 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:22,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:22,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:54:22,752 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:54:22,752 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:54:22,752 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:54:22,752 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2018-06-24 20:54:23,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:23,134 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:54:23,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:23,134 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:54:23,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:23,135 INFO ]: With dead ends: 37 [2018-06-24 20:54:23,135 INFO ]: Without dead ends: 37 [2018-06-24 20:54:23,135 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:23,135 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:54:23,137 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-24 20:54:23,137 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:54:23,137 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:54:23,137 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:54:23,137 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:23,137 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:54:23,137 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:54:23,137 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:54:23,138 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:54:23,138 INFO ]: Found error trace [2018-06-24 20:54:23,138 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:23,138 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:23,138 INFO ]: Analyzing trace with hash -32665995, now seen corresponding path program 24 times [2018-06-24 20:54:23,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:23,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:23,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:23,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:23,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:23,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:23,839 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:23,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:23,839 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:23,845 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:23,880 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:54:23,880 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:23,883 INFO ]: Computing forward predicates... [2018-06-24 20:54:24,052 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:24,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:24,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-24 20:54:24,071 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:54:24,071 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:54:24,072 INFO ]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:54:24,072 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 32 states. [2018-06-24 20:54:24,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:24,535 INFO ]: Finished difference Result 36 states and 38 transitions. [2018-06-24 20:54:24,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:24,535 INFO ]: Start accepts. Automaton has 32 states. Word has length 24 [2018-06-24 20:54:24,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:24,536 INFO ]: With dead ends: 36 [2018-06-24 20:54:24,536 INFO ]: Without dead ends: 25 [2018-06-24 20:54:24,536 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:54:24,536 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:24,537 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:54:24,537 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:54:24,538 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:54:24,538 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-24 20:54:24,538 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:24,538 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:54:24,538 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:54:24,538 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:54:24,538 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:54:24,538 INFO ]: Found error trace [2018-06-24 20:54:24,538 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:24,538 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:24,538 INFO ]: Analyzing trace with hash -2005239655, now seen corresponding path program 25 times [2018-06-24 20:54:24,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:24,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:24,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:24,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:24,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:24,549 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:24,911 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:24,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:24,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:24,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:24,970 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:24,973 INFO ]: Computing forward predicates... [2018-06-24 20:54:25,316 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:25,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:25,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:54:25,335 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:54:25,335 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:54:25,335 INFO ]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:25,336 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 31 states. [2018-06-24 20:54:25,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:25,515 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 20:54:25,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:54:25,517 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-24 20:54:25,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:25,517 INFO ]: With dead ends: 26 [2018-06-24 20:54:25,517 INFO ]: Without dead ends: 26 [2018-06-24 20:54:25,517 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1135, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:54:25,518 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:54:25,519 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:54:25,519 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:54:25,519 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:54:25,519 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-24 20:54:25,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:25,520 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:54:25,520 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:54:25,520 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:54:25,520 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:54:25,520 INFO ]: Found error trace [2018-06-24 20:54:25,520 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:25,520 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:25,520 INFO ]: Analyzing trace with hash -2033359870, now seen corresponding path program 26 times [2018-06-24 20:54:25,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:25,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:25,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:25,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:25,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:25,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:25,953 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:25,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:25,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:25,959 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:25,992 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:25,992 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:25,997 INFO ]: Computing forward predicates... [2018-06-24 20:54:26,256 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:26,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:26,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:54:26,287 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:54:26,287 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:54:26,287 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:54:26,287 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-06-24 20:54:27,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:27,145 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:54:27,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:27,145 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:54:27,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:27,145 INFO ]: With dead ends: 40 [2018-06-24 20:54:27,145 INFO ]: Without dead ends: 40 [2018-06-24 20:54:27,146 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:54:27,146 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:54:27,148 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-24 20:54:27,148 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:54:27,149 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:54:27,149 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-24 20:54:27,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:27,149 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:54:27,149 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:54:27,149 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:54:27,149 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:54:27,149 INFO ]: Found error trace [2018-06-24 20:54:27,149 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:27,149 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:27,150 INFO ]: Analyzing trace with hash 1389880761, now seen corresponding path program 27 times [2018-06-24 20:54:27,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:27,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:27,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:27,150 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:27,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:27,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:27,362 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:27,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:27,362 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:27,368 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:27,412 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:54:27,412 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:27,414 INFO ]: Computing forward predicates... [2018-06-24 20:54:28,085 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:28,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:28,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-24 20:54:28,104 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:54:28,104 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:54:28,105 INFO ]: CoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:28,105 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 35 states. [2018-06-24 20:54:28,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:28,649 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-24 20:54:28,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:28,650 INFO ]: Start accepts. Automaton has 35 states. Word has length 26 [2018-06-24 20:54:28,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:28,650 INFO ]: With dead ends: 39 [2018-06-24 20:54:28,650 INFO ]: Without dead ends: 27 [2018-06-24 20:54:28,651 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:54:28,651 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:54:28,652 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:54:28,652 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:54:28,652 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:54:28,652 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-24 20:54:28,652 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:28,652 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:54:28,652 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:54:28,652 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:54:28,653 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:54:28,653 INFO ]: Found error trace [2018-06-24 20:54:28,653 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:28,653 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:28,653 INFO ]: Analyzing trace with hash 369639445, now seen corresponding path program 28 times [2018-06-24 20:54:28,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:28,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:28,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:28,653 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:28,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:28,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:29,390 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:29,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:29,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:29,395 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:29,439 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:29,439 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:29,442 INFO ]: Computing forward predicates... [2018-06-24 20:54:29,581 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:29,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:29,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-24 20:54:29,599 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:54:29,600 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:54:29,600 INFO ]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:54:29,600 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 34 states. [2018-06-24 20:54:30,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:30,238 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-24 20:54:30,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:54:30,239 INFO ]: Start accepts. Automaton has 34 states. Word has length 26 [2018-06-24 20:54:30,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:30,239 INFO ]: With dead ends: 28 [2018-06-24 20:54:30,239 INFO ]: Without dead ends: 28 [2018-06-24 20:54:30,240 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=1375, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:54:30,240 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:54:30,241 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:54:30,241 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:54:30,241 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:54:30,241 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-24 20:54:30,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:30,241 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:54:30,241 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:54:30,241 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:54:30,242 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:54:30,242 INFO ]: Found error trace [2018-06-24 20:54:30,242 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:30,242 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:30,242 INFO ]: Analyzing trace with hash -1426551802, now seen corresponding path program 29 times [2018-06-24 20:54:30,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:30,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:30,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:30,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:30,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:30,262 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:30,681 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:30,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:30,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:30,686 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:30,782 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:54:30,782 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:30,786 INFO ]: Computing forward predicates... [2018-06-24 20:54:30,860 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:30,879 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:30,879 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:54:30,879 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:54:30,879 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:54:30,879 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:54:30,880 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2018-06-24 20:54:31,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:31,376 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-24 20:54:31,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:31,376 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:54:31,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:31,376 INFO ]: With dead ends: 43 [2018-06-24 20:54:31,376 INFO ]: Without dead ends: 43 [2018-06-24 20:54:31,377 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:54:31,377 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:54:31,379 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-24 20:54:31,379 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:54:31,379 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-24 20:54:31,379 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-24 20:54:31,379 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:31,379 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-24 20:54:31,379 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:54:31,379 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-24 20:54:31,379 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:54:31,379 INFO ]: Found error trace [2018-06-24 20:54:31,379 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:31,379 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:31,380 INFO ]: Analyzing trace with hash -1273905611, now seen corresponding path program 30 times [2018-06-24 20:54:31,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:31,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:31,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:31,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:31,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:31,389 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:31,838 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:31,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:31,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:31,849 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:31,891 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:54:31,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:31,893 INFO ]: Computing forward predicates... [2018-06-24 20:54:32,518 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:32,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:32,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-24 20:54:32,537 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:54:32,538 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:54:32,538 INFO ]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:54:32,538 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 38 states. [2018-06-24 20:54:32,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:32,769 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-24 20:54:32,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:32,771 INFO ]: Start accepts. Automaton has 38 states. Word has length 28 [2018-06-24 20:54:32,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:32,771 INFO ]: With dead ends: 42 [2018-06-24 20:54:32,771 INFO ]: Without dead ends: 29 [2018-06-24 20:54:32,772 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:54:32,772 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:54:32,773 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:54:32,773 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:54:32,774 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-24 20:54:32,774 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-24 20:54:32,774 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:32,774 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-24 20:54:32,774 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:54:32,774 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-24 20:54:32,774 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:54:32,774 INFO ]: Found error trace [2018-06-24 20:54:32,774 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:32,774 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:32,774 INFO ]: Analyzing trace with hash 1458351961, now seen corresponding path program 31 times [2018-06-24 20:54:32,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:32,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:32,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:32,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:32,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:32,787 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:33,575 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:33,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:33,575 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:33,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:33,617 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:33,620 INFO ]: Computing forward predicates... [2018-06-24 20:54:33,790 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:33,810 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:33,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-24 20:54:33,810 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:54:33,811 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:54:33,811 INFO ]: CoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:33,811 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 37 states. [2018-06-24 20:54:33,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:33,994 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-24 20:54:33,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:54:33,994 INFO ]: Start accepts. Automaton has 37 states. Word has length 28 [2018-06-24 20:54:33,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:33,995 INFO ]: With dead ends: 30 [2018-06-24 20:54:33,995 INFO ]: Without dead ends: 30 [2018-06-24 20:54:33,995 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=714, Invalid=1638, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:54:33,995 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:54:33,997 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:54:33,997 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:54:33,997 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:54:33,997 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-24 20:54:33,997 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:33,997 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:54:33,997 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:54:33,997 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:54:33,998 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:54:33,998 INFO ]: Found error trace [2018-06-24 20:54:33,998 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:33,998 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:33,998 INFO ]: Analyzing trace with hash -2036202174, now seen corresponding path program 32 times [2018-06-24 20:54:33,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:33,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:33,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:33,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:33,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:34,015 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:34,456 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:34,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:34,456 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:34,462 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:34,500 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:34,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:34,504 INFO ]: Computing forward predicates... [2018-06-24 20:54:34,604 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:34,622 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:34,622 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 20:54:34,623 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:54:34,623 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:54:34,623 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:54:34,623 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 27 states. [2018-06-24 20:54:35,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:35,581 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-24 20:54:35,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:35,581 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:54:35,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:35,581 INFO ]: With dead ends: 46 [2018-06-24 20:54:35,581 INFO ]: Without dead ends: 46 [2018-06-24 20:54:35,582 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:54:35,582 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:54:35,584 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-24 20:54:35,584 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:54:35,584 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:54:35,584 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-24 20:54:35,584 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:35,584 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:54:35,584 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:54:35,584 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:54:35,584 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:54:35,584 INFO ]: Found error trace [2018-06-24 20:54:35,584 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:35,584 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:35,585 INFO ]: Analyzing trace with hash 1301769337, now seen corresponding path program 33 times [2018-06-24 20:54:35,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:35,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:35,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:35,585 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:35,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:35,597 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:36,788 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:36,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:36,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:36,793 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:36,842 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:54:36,842 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:36,845 INFO ]: Computing forward predicates... [2018-06-24 20:54:37,207 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:37,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:37,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-06-24 20:54:37,226 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:54:37,226 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:54:37,226 INFO ]: CoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:54:37,226 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 41 states. [2018-06-24 20:54:37,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:37,482 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-24 20:54:37,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:37,499 INFO ]: Start accepts. Automaton has 41 states. Word has length 30 [2018-06-24 20:54:37,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:37,500 INFO ]: With dead ends: 45 [2018-06-24 20:54:37,500 INFO ]: Without dead ends: 31 [2018-06-24 20:54:37,500 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:54:37,500 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:54:37,501 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:54:37,501 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:54:37,501 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-24 20:54:37,501 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-24 20:54:37,501 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:37,501 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-24 20:54:37,501 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:54:37,501 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-24 20:54:37,502 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:54:37,502 INFO ]: Found error trace [2018-06-24 20:54:37,502 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:37,502 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:37,502 INFO ]: Analyzing trace with hash 102408149, now seen corresponding path program 34 times [2018-06-24 20:54:37,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:37,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:37,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:37,502 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:37,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:37,511 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:37,920 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:37,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:37,920 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:37,926 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:37,965 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:37,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:37,968 INFO ]: Computing forward predicates... [2018-06-24 20:54:38,178 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:38,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:38,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-24 20:54:38,198 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:54:38,198 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:54:38,198 INFO ]: CoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:54:38,198 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 40 states. [2018-06-24 20:54:38,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:38,456 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-24 20:54:38,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:54:38,456 INFO ]: Start accepts. Automaton has 40 states. Word has length 30 [2018-06-24 20:54:38,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:38,456 INFO ]: With dead ends: 32 [2018-06-24 20:54:38,456 INFO ]: Without dead ends: 32 [2018-06-24 20:54:38,457 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:54:38,457 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:54:38,458 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:54:38,458 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:54:38,458 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-24 20:54:38,459 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-24 20:54:38,459 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:38,459 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-24 20:54:38,459 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:54:38,459 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-24 20:54:38,459 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:54:38,459 INFO ]: Found error trace [2018-06-24 20:54:38,459 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:38,459 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:38,459 INFO ]: Analyzing trace with hash -1120787386, now seen corresponding path program 35 times [2018-06-24 20:54:38,459 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:38,459 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:38,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:38,460 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:38,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:38,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:38,929 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:38,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:38,929 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-24 20:54:38,935 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:38,982 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:54:38,982 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:38,986 INFO ]: Computing forward predicates... [2018-06-24 20:54:39,063 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:39,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:39,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:54:39,082 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:54:39,082 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:54:39,082 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:54:39,082 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2018-06-24 20:54:39,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:39,741 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:54:39,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:39,741 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:54:39,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:39,742 INFO ]: With dead ends: 49 [2018-06-24 20:54:39,742 INFO ]: Without dead ends: 49 [2018-06-24 20:54:39,742 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:54:39,742 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:54:39,743 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-24 20:54:39,743 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:54:39,744 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:54:39,744 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-24 20:54:39,744 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:39,744 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:54:39,744 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:54:39,744 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:54:39,744 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:54:39,744 INFO ]: Found error trace [2018-06-24 20:54:39,744 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:39,744 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:39,744 INFO ]: Analyzing trace with hash -385143307, now seen corresponding path program 36 times [2018-06-24 20:54:39,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:39,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:39,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:39,745 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:39,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:39,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:40,043 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:40,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:40,043 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-24 20:54:40,048 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:40,096 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:54:40,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:40,099 INFO ]: Computing forward predicates... [2018-06-24 20:54:40,397 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:40,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:40,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-06-24 20:54:40,416 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:54:40,416 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:54:40,417 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:54:40,417 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 44 states. [2018-06-24 20:54:40,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:40,680 INFO ]: Finished difference Result 48 states and 50 transitions. [2018-06-24 20:54:40,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:40,681 INFO ]: Start accepts. Automaton has 44 states. Word has length 32 [2018-06-24 20:54:40,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:40,681 INFO ]: With dead ends: 48 [2018-06-24 20:54:40,681 INFO ]: Without dead ends: 33 [2018-06-24 20:54:40,681 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=826, Invalid=2596, Unknown=0, NotChecked=0, Total=3422 [2018-06-24 20:54:40,681 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:54:40,682 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:54:40,682 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:54:40,682 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-24 20:54:40,682 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-24 20:54:40,682 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:40,682 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-24 20:54:40,683 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:54:40,683 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-24 20:54:40,683 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:54:40,683 INFO ]: Found error trace [2018-06-24 20:54:40,683 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:40,683 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:40,683 INFO ]: Analyzing trace with hash 1089365529, now seen corresponding path program 37 times [2018-06-24 20:54:40,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:40,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:40,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:40,683 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:40,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:40,690 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:41,077 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:41,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:41,077 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-24 20:54:41,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:41,131 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:41,134 INFO ]: Computing forward predicates... [2018-06-24 20:54:41,360 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:41,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:41,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-24 20:54:41,379 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:54:41,379 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:54:41,379 INFO ]: CoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:54:41,379 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 43 states. [2018-06-24 20:54:41,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:41,648 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-24 20:54:41,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:54:41,648 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-24 20:54:41,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:41,648 INFO ]: With dead ends: 34 [2018-06-24 20:54:41,648 INFO ]: Without dead ends: 34 [2018-06-24 20:54:41,649 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=959, Invalid=2233, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:54:41,649 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:54:41,650 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:54:41,650 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:54:41,650 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-24 20:54:41,650 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-24 20:54:41,650 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:41,650 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-24 20:54:41,651 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:54:41,651 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-24 20:54:41,651 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:54:41,651 INFO ]: Found error trace [2018-06-24 20:54:41,651 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:41,651 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:41,651 INFO ]: Analyzing trace with hash -589879678, now seen corresponding path program 38 times [2018-06-24 20:54:41,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:41,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:41,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:41,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:41,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:41,666 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:42,147 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:42,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:42,147 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-24 20:54:42,152 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:42,197 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:42,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:42,201 INFO ]: Computing forward predicates... [2018-06-24 20:54:42,283 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:42,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:42,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 20:54:42,303 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:54:42,304 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:54:42,304 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:54:42,304 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2018-06-24 20:54:43,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:43,061 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-24 20:54:43,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:43,061 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:54:43,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:43,062 INFO ]: With dead ends: 52 [2018-06-24 20:54:43,062 INFO ]: Without dead ends: 52 [2018-06-24 20:54:43,062 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:54:43,062 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:54:43,063 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-24 20:54:43,063 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:54:43,063 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-24 20:54:43,063 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-24 20:54:43,063 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:43,063 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-24 20:54:43,063 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:54:43,063 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-24 20:54:43,063 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:54:43,063 INFO ]: Found error trace [2018-06-24 20:54:43,063 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:43,064 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:43,064 INFO ]: Analyzing trace with hash -1106873543, now seen corresponding path program 39 times [2018-06-24 20:54:43,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:43,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:43,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:43,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:43,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:43,071 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:43,411 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:43,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:43,411 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-24 20:54:43,417 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:43,470 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:54:43,470 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:43,473 INFO ]: Computing forward predicates... [2018-06-24 20:54:43,844 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:43,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:43,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-06-24 20:54:43,863 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:54:43,863 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:54:43,863 INFO ]: CoverageRelationStatistics Valid=513, Invalid=1649, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:54:43,863 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 47 states. [2018-06-24 20:54:44,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:44,183 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-24 20:54:44,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:44,184 INFO ]: Start accepts. Automaton has 47 states. Word has length 34 [2018-06-24 20:54:44,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:44,184 INFO ]: With dead ends: 51 [2018-06-24 20:54:44,184 INFO ]: Without dead ends: 35 [2018-06-24 20:54:44,184 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=937, Invalid=2969, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:54:44,184 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:54:44,185 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:54:44,185 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:54:44,185 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-24 20:54:44,185 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-24 20:54:44,185 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:44,185 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-24 20:54:44,186 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:54:44,186 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-24 20:54:44,186 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:54:44,186 INFO ]: Found error trace [2018-06-24 20:54:44,186 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:44,186 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:44,186 INFO ]: Analyzing trace with hash 1653227413, now seen corresponding path program 40 times [2018-06-24 20:54:44,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:44,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:44,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:44,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:44,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:44,201 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:44,571 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:44,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:44,571 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-24 20:54:44,578 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:44,632 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:44,632 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:44,636 INFO ]: Computing forward predicates... [2018-06-24 20:54:44,872 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:44,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:44,890 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-24 20:54:44,890 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:54:44,891 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:54:44,891 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:54:44,891 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 46 states. [2018-06-24 20:54:45,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:45,248 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-24 20:54:45,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:54:45,248 INFO ]: Start accepts. Automaton has 46 states. Word has length 34 [2018-06-24 20:54:45,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:45,248 INFO ]: With dead ends: 36 [2018-06-24 20:54:45,248 INFO ]: Without dead ends: 36 [2018-06-24 20:54:45,249 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1095, Invalid=2565, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 20:54:45,249 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:54:45,250 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:54:45,250 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:54:45,250 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-24 20:54:45,250 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-24 20:54:45,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:45,250 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-24 20:54:45,250 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:54:45,250 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-24 20:54:45,250 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:54:45,250 INFO ]: Found error trace [2018-06-24 20:54:45,250 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:45,250 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:45,250 INFO ]: Analyzing trace with hash -290030458, now seen corresponding path program 41 times [2018-06-24 20:54:45,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:45,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:45,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:45,251 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:45,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:45,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:45,911 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:45,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:45,911 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-24 20:54:45,916 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:45,983 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:54:45,983 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:45,987 INFO ]: Computing forward predicates... [2018-06-24 20:54:46,088 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:46,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:46,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 20:54:46,108 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:54:46,108 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:54:46,108 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:54:46,108 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2018-06-24 20:54:46,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:46,962 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-24 20:54:46,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:46,962 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:54:46,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:46,962 INFO ]: With dead ends: 55 [2018-06-24 20:54:46,962 INFO ]: Without dead ends: 55 [2018-06-24 20:54:46,963 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=2372, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:54:46,963 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:54:46,964 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-24 20:54:46,964 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:54:46,964 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:54:46,964 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:54:46,964 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:46,964 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:54:46,964 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:54:46,964 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:54:46,964 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:54:46,965 INFO ]: Found error trace [2018-06-24 20:54:46,965 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:46,965 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:46,965 INFO ]: Analyzing trace with hash -401482315, now seen corresponding path program 42 times [2018-06-24 20:54:46,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:46,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:46,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:46,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:46,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:46,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:47,683 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:47,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:47,684 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-24 20:54:47,689 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:47,748 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:54:47,748 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:47,751 INFO ]: Computing forward predicates... [2018-06-24 20:54:48,169 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:48,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:48,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-06-24 20:54:48,238 INFO ]: Interpolant automaton has 50 states [2018-06-24 20:54:48,238 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-24 20:54:48,238 INFO ]: CoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:54:48,238 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 50 states. [2018-06-24 20:54:48,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:48,581 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-24 20:54:48,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:48,581 INFO ]: Start accepts. Automaton has 50 states. Word has length 36 [2018-06-24 20:54:48,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:48,581 INFO ]: With dead ends: 54 [2018-06-24 20:54:48,581 INFO ]: Without dead ends: 37 [2018-06-24 20:54:48,582 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:54:48,582 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:54:48,582 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:54:48,582 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:54:48,583 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-24 20:54:48,583 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-24 20:54:48,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:48,583 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-24 20:54:48,583 INFO ]: Interpolant automaton has 50 states. [2018-06-24 20:54:48,583 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-24 20:54:48,583 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:54:48,583 INFO ]: Found error trace [2018-06-24 20:54:48,583 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:48,583 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:48,583 INFO ]: Analyzing trace with hash -737698599, now seen corresponding path program 43 times [2018-06-24 20:54:48,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:48,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:48,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:48,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:48,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:48,591 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:49,108 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:49,108 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:49,108 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-24 20:54:49,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:49,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:49,164 INFO ]: Computing forward predicates... [2018-06-24 20:54:49,463 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:49,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:49,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-24 20:54:49,482 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:54:49,482 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:54:49,482 INFO ]: CoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:54:49,483 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 49 states. [2018-06-24 20:54:49,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:49,803 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-24 20:54:49,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:54:49,803 INFO ]: Start accepts. Automaton has 49 states. Word has length 36 [2018-06-24 20:54:49,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:49,804 INFO ]: With dead ends: 38 [2018-06-24 20:54:49,804 INFO ]: Without dead ends: 38 [2018-06-24 20:54:49,804 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1240, Invalid=2920, Unknown=0, NotChecked=0, Total=4160 [2018-06-24 20:54:49,804 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:54:49,805 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:54:49,805 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:54:49,805 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-24 20:54:49,805 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-24 20:54:49,805 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:49,805 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-24 20:54:49,805 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:54:49,805 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-24 20:54:49,805 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:54:49,805 INFO ]: Found error trace [2018-06-24 20:54:49,805 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:49,805 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:49,805 INFO ]: Analyzing trace with hash -1394292798, now seen corresponding path program 44 times [2018-06-24 20:54:49,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:49,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:49,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:49,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:49,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:49,815 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:50,942 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:50,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:50,942 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-24 20:54:50,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:54:51,003 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:54:51,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:51,008 INFO ]: Computing forward predicates... [2018-06-24 20:54:51,126 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:51,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:51,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 20:54:51,145 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:54:51,145 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:54:51,145 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:54:51,145 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2018-06-24 20:54:52,182 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-24 20:54:52,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:52,183 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-24 20:54:52,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:54:52,183 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:54:52,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:52,183 INFO ]: With dead ends: 58 [2018-06-24 20:54:52,183 INFO ]: Without dead ends: 58 [2018-06-24 20:54:52,184 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:54:52,184 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:54:52,185 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-24 20:54:52,185 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:54:52,185 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-24 20:54:52,185 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-24 20:54:52,185 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:52,185 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-24 20:54:52,186 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:54:52,186 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-24 20:54:52,186 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:54:52,186 INFO ]: Found error trace [2018-06-24 20:54:52,186 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:52,186 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:52,186 INFO ]: Analyzing trace with hash -273876487, now seen corresponding path program 45 times [2018-06-24 20:54:52,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:52,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:52,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:52,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:52,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:52,196 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:52,672 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:52,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:52,672 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-24 20:54:52,677 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:54:52,745 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:54:52,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:52,748 INFO ]: Computing forward predicates... [2018-06-24 20:54:53,385 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:53,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:53,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-06-24 20:54:53,416 INFO ]: Interpolant automaton has 53 states [2018-06-24 20:54:53,417 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-24 20:54:53,417 INFO ]: CoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:54:53,417 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 53 states. [2018-06-24 20:54:53,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:53,790 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-24 20:54:53,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:54:53,790 INFO ]: Start accepts. Automaton has 53 states. Word has length 38 [2018-06-24 20:54:53,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:53,790 INFO ]: With dead ends: 57 [2018-06-24 20:54:53,790 INFO ]: Without dead ends: 39 [2018-06-24 20:54:53,791 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1180, Invalid=3790, Unknown=0, NotChecked=0, Total=4970 [2018-06-24 20:54:53,791 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:54:53,792 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:54:53,792 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:54:53,792 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-24 20:54:53,792 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-24 20:54:53,792 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:53,792 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-24 20:54:53,792 INFO ]: Interpolant automaton has 53 states. [2018-06-24 20:54:53,792 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-24 20:54:53,793 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:54:53,793 INFO ]: Found error trace [2018-06-24 20:54:53,793 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:53,793 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:53,793 INFO ]: Analyzing trace with hash -2106646699, now seen corresponding path program 46 times [2018-06-24 20:54:53,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:53,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:53,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:53,794 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:53,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:53,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:54,231 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:54,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:54,231 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-24 20:54:54,237 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:54,288 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:54,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:54,292 INFO ]: Computing forward predicates... [2018-06-24 20:54:54,568 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:54,587 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:54,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-24 20:54:54,587 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:54:54,587 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:54:54,587 INFO ]: CoverageRelationStatistics Valid=646, Invalid=2006, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:54:54,588 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 52 states. [2018-06-24 20:54:55,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:55,169 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-24 20:54:55,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:54:55,169 INFO ]: Start accepts. Automaton has 52 states. Word has length 38 [2018-06-24 20:54:55,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:55,169 INFO ]: With dead ends: 40 [2018-06-24 20:54:55,169 INFO ]: Without dead ends: 40 [2018-06-24 20:54:55,169 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1394, Invalid=3298, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:54:55,170 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:54:55,171 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:54:55,171 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:54:55,171 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-24 20:54:55,171 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-24 20:54:55,171 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:55,171 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-24 20:54:55,171 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:54:55,171 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-24 20:54:55,171 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:54:55,171 INFO ]: Found error trace [2018-06-24 20:54:55,171 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:55,171 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:55,171 INFO ]: Analyzing trace with hash -882010938, now seen corresponding path program 47 times [2018-06-24 20:54:55,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:55,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:55,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:55,172 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:55,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:55,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,225 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:57,225 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-24 20:54:57,233 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:54:57,343 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:54:57,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,348 INFO ]: Computing forward predicates... [2018-06-24 20:54:57,650 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:57,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 20:54:57,669 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:54:57,669 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:54:57,669 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:54:57,669 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 37 states. [2018-06-24 20:54:58,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:58,787 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-24 20:54:58,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:54:58,787 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:54:58,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:58,787 INFO ]: With dead ends: 61 [2018-06-24 20:54:58,787 INFO ]: Without dead ends: 61 [2018-06-24 20:54:58,787 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:54:58,787 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:54:58,788 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-24 20:54:58,789 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:54:58,789 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-24 20:54:58,789 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-24 20:54:58,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:58,789 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-24 20:54:58,789 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:54:58,789 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-24 20:54:58,789 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:54:58,789 INFO ]: Found error trace [2018-06-24 20:54:58,789 INFO ]: trace histogram [18, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:58,789 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:58,790 INFO ]: Analyzing trace with hash -1573008011, now seen corresponding path program 48 times [2018-06-24 20:54:58,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:58,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:58,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:58,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,797 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,210 INFO ]: Checked inductivity of 307 backedges. 136 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:59,211 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-24 20:54:59,216 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:54:59,277 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:54:59,277 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,281 INFO ]: Computing forward predicates... [2018-06-24 20:55:00,797 INFO ]: Checked inductivity of 307 backedges. 171 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:00,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-06-24 20:55:00,816 INFO ]: Interpolant automaton has 56 states [2018-06-24 20:55:00,816 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-24 20:55:00,816 INFO ]: CoverageRelationStatistics Valid=723, Invalid=2357, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:55:00,816 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 56 states. [2018-06-24 20:55:01,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:01,198 INFO ]: Finished difference Result 60 states and 62 transitions. [2018-06-24 20:55:01,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:55:01,199 INFO ]: Start accepts. Automaton has 56 states. Word has length 40 [2018-06-24 20:55:01,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:01,199 INFO ]: With dead ends: 60 [2018-06-24 20:55:01,199 INFO ]: Without dead ends: 41 [2018-06-24 20:55:01,199 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1312, Invalid=4238, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 20:55:01,199 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:55:01,200 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:55:01,200 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:55:01,201 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-24 20:55:01,201 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-24 20:55:01,201 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:01,201 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-24 20:55:01,201 INFO ]: Interpolant automaton has 56 states. [2018-06-24 20:55:01,201 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-24 20:55:01,201 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:55:01,201 INFO ]: Found error trace [2018-06-24 20:55:01,201 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:01,201 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:01,201 INFO ]: Analyzing trace with hash 1740657561, now seen corresponding path program 49 times [2018-06-24 20:55:01,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:01,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:01,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:01,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,703 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:01,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:01,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:01,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:01,765 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,768 INFO ]: Computing forward predicates... [2018-06-24 20:55:02,232 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:02,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:02,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2018-06-24 20:55:02,252 INFO ]: Interpolant automaton has 55 states [2018-06-24 20:55:02,253 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-24 20:55:02,253 INFO ]: CoverageRelationStatistics Valid=720, Invalid=2250, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:55:02,253 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 55 states. Received shutdown request... [2018-06-24 20:55:02,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:55:02,602 WARN ]: Verification canceled [2018-06-24 20:55:02,603 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:55:02,604 WARN ]: Timeout [2018-06-24 20:55:02,604 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:55:02 BasicIcfg [2018-06-24 20:55:02,604 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:55:02,605 INFO ]: Toolchain (without parser) took 56371.47 ms. Allocated memory was 309.9 MB in the beginning and 815.3 MB in the end (delta: 505.4 MB). Free memory was 264.2 MB in the beginning and 555.8 MB in the end (delta: -291.6 MB). Peak memory consumption was 213.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,606 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:55:02,606 INFO ]: ChcToBoogie took 53.92 ms. Allocated memory is still 309.9 MB. Free memory was 264.2 MB in the beginning and 262.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,606 INFO ]: Boogie Preprocessor took 33.98 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,608 INFO ]: RCFGBuilder took 240.83 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,608 INFO ]: BlockEncodingV2 took 104.77 ms. Allocated memory is still 309.9 MB. Free memory was 252.3 MB in the beginning and 248.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,608 INFO ]: TraceAbstraction took 55928.18 ms. Allocated memory was 309.9 MB in the beginning and 815.3 MB in the end (delta: 505.4 MB). Free memory was 248.3 MB in the beginning and 555.8 MB in the end (delta: -307.5 MB). Peak memory consumption was 197.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:02,611 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.92 ms. Allocated memory is still 309.9 MB. Free memory was 264.2 MB in the beginning and 262.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.98 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 240.83 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 104.77 ms. Allocated memory is still 309.9 MB. Free memory was 252.3 MB in the beginning and 248.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55928.18 ms. Allocated memory was 309.9 MB in the beginning and 815.3 MB in the end (delta: 505.4 MB). Free memory was 248.3 MB in the beginning and 555.8 MB in the end (delta: -307.5 MB). Peak memory consumption was 197.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (41states) and interpolant automaton (currently 27 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 55.8s OverallTime, 52 OverallIterations, 18 TraceHistogramMax, 18.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 274 SDtfs, 410 SDslu, 3369 SDs, 0 SdLazy, 14640 SolverSat, 2097 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2816 GetRequests, 827 SyntacticMatches, 108 SemanticMatches, 1880 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16731 ImplicationChecksByTransitivity, 39.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 187 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 2420 NumberOfCodeBlocks, 2420 NumberOfCodeBlocksAsserted, 244 NumberOfCheckSat, 2317 ConstructedInterpolants, 0 QuantifiedInterpolants, 318736 SizeOfPredicates, 272 NumberOfNonLiveVariables, 16677 ConjunctsInSsa, 3740 ConjunctsInUnsatCore, 103 InterpolantComputations, 2 PerfectInterpolantSequences, 3893/11356 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/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-55-02-621.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-55-02-621.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-55-02-621.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-55-02-621.csv Completed graceful shutdown