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/hopv/lia/mochi/enc-zip_map.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:19:44,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:19:44,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:19:44,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:19:44,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:19:44,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:19:44,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:19:44,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:19:44,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:19:44,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:19:44,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:19:44,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:19:44,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:19:44,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:19:44,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:19:44,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:19:44,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:19:44,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:19:44,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:19:44,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:19:44,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:19:44,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:19:44,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:19:44,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:19:44,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:19:44,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:19:44,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:19:44,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:19:44,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:19:44,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:19:44,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:19:44,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:19:44,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:19:44,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:19:44,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:19:44,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:19:44,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:19:44,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:19:44,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:19:44,940 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:19:44,940 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:19:44,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:19:44,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:19:44,941 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:19:44,941 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:19:44,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:19:44,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:19:44,942 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:19:44,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:19:44,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:19:44,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:19:44,943 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:19:44,943 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:19:44,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:19:44,944 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:19:44,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:19:44,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:19:44,944 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:19:44,947 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:19:44,947 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:19:44,992 INFO ]: Repository-Root is: /tmp [2018-06-26 18:19:45,008 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:19:45,013 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:19:45,014 INFO ]: Initializing SmtParser... [2018-06-26 18:19:45,014 INFO ]: SmtParser initialized [2018-06-26 18:19:45,015 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_map.smt2 [2018-06-26 18:19:45,017 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:19:45,107 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map.smt2 unknown [2018-06-26 18:19:45,306 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map.smt2 [2018-06-26 18:19:45,311 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:19:45,316 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:19:45,316 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:19:45,317 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:19:45,317 INFO ]: ChcToBoogie initialized [2018-06-26 18:19:45,320 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,367 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45 Unit [2018-06-26 18:19:45,367 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:19:45,368 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:19:45,368 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:19:45,368 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:19:45,390 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,391 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,399 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,399 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,403 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,406 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,407 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,410 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:19:45,410 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:19:45,410 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:19:45,410 INFO ]: RCFGBuilder initialized [2018-06-26 18:19:45,411 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:19:45,423 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:19:45,423 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:19:45,423 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:19:45,424 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:19:45,424 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:19:45,424 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:19:45,620 INFO ]: Using library mode [2018-06-26 18:19:45,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:19:45 BoogieIcfgContainer [2018-06-26 18:19:45,620 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:19:45,621 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:19:45,621 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:19:45,622 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:19:45,622 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:19:45" (1/1) ... [2018-06-26 18:19:45,637 INFO ]: Initial Icfg 15 locations, 21 edges [2018-06-26 18:19:45,638 INFO ]: Using Remove infeasible edges [2018-06-26 18:19:45,639 INFO ]: Using Maximize final states [2018-06-26 18:19:45,639 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:19:45,639 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:19:45,641 INFO ]: Using Remove sink states [2018-06-26 18:19:45,642 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:19:45,642 INFO ]: Using Use SBE [2018-06-26 18:19:45,649 INFO ]: SBE split 0 edges [2018-06-26 18:19:45,655 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:19:45,656 INFO ]: 0 new accepting states [2018-06-26 18:19:45,734 INFO ]: Removed 8 edges and 3 locations by large block encoding [2018-06-26 18:19:45,736 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:19:45,737 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:19:45,737 INFO ]: 0 new accepting states [2018-06-26 18:19:45,737 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:19:45,738 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:19:45,738 INFO ]: Encoded RCFG 10 locations, 15 edges [2018-06-26 18:19:45,739 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:19:45 BasicIcfg [2018-06-26 18:19:45,739 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:19:45,740 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:19:45,740 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:19:45,755 INFO ]: TraceAbstraction initialized [2018-06-26 18:19:45,755 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:19:45" (1/4) ... [2018-06-26 18:19:45,756 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237d0a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:19:45, skipping insertion in model container [2018-06-26 18:19:45,756 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:19:45" (2/4) ... [2018-06-26 18:19:45,756 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237d0a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:19:45, skipping insertion in model container [2018-06-26 18:19:45,756 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:19:45" (3/4) ... [2018-06-26 18:19:45,757 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237d0a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:19:45, skipping insertion in model container [2018-06-26 18:19:45,757 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:19:45" (4/4) ... [2018-06-26 18:19:45,759 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:19:45,783 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:19:45,793 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:19:45,827 INFO ]: Using default assertion order modulation [2018-06-26 18:19:45,828 INFO ]: Interprodecural is true [2018-06-26 18:19:45,828 INFO ]: Hoare is false [2018-06-26 18:19:45,828 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:19:45,828 INFO ]: Backedges is TWOTRACK [2018-06-26 18:19:45,828 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:19:45,828 INFO ]: Difference is false [2018-06-26 18:19:45,828 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:19:45,828 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:19:45,838 INFO ]: Start isEmpty. Operand 10 states. [2018-06-26 18:19:45,846 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:19:45,846 INFO ]: Found error trace [2018-06-26 18:19:45,847 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:19:45,847 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:45,852 INFO ]: Analyzing trace with hash 34849379, now seen corresponding path program 1 times [2018-06-26 18:19:45,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:45,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:45,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:45,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:45,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:45,921 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:45,978 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:19:45,979 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:19:45,979 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:19:45,981 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:19:45,992 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:19:45,992 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:19:45,994 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-26 18:19:46,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:46,133 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-26 18:19:46,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:19:46,134 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:19:46,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:46,142 INFO ]: With dead ends: 15 [2018-06-26 18:19:46,142 INFO ]: Without dead ends: 14 [2018-06-26 18:19:46,143 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:19:46,155 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:19:46,190 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:19:46,191 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:19:46,192 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-26 18:19:46,193 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 5 [2018-06-26 18:19:46,194 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:46,194 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-26 18:19:46,194 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:19:46,194 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-26 18:19:46,195 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:19:46,195 INFO ]: Found error trace [2018-06-26 18:19:46,195 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:46,195 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:46,195 INFO ]: Analyzing trace with hash -1660751652, now seen corresponding path program 1 times [2018-06-26 18:19:46,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:46,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:46,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:46,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:46,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:46,215 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:46,535 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:46,535 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:19:46,535 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-26 18:19:46,536 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:19:46,536 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:19:46,536 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:19:46,536 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-06-26 18:19:47,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:47,096 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-26 18:19:47,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:19:47,096 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-26 18:19:47,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:47,097 INFO ]: With dead ends: 22 [2018-06-26 18:19:47,097 INFO ]: Without dead ends: 15 [2018-06-26 18:19:47,098 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:19:47,098 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:19:47,101 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 18:19:47,101 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:19:47,102 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-26 18:19:47,102 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2018-06-26 18:19:47,102 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:47,102 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-26 18:19:47,102 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:19:47,102 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-26 18:19:47,103 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:19:47,103 INFO ]: Found error trace [2018-06-26 18:19:47,103 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:47,103 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:47,103 INFO ]: Analyzing trace with hash -224800113, now seen corresponding path program 1 times [2018-06-26 18:19:47,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:47,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:47,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:47,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:47,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:47,120 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:47,313 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:47,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:47,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:47,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:47,340 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:47,346 INFO ]: Computing forward predicates... [2018-06-26 18:19:47,553 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:47,590 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:19:47,590 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-26 18:19:47,591 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:19:47,591 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:19:47,591 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:19:47,591 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 12 states. [2018-06-26 18:19:47,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:47,683 INFO ]: Finished difference Result 20 states and 25 transitions. [2018-06-26 18:19:47,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:19:47,683 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-26 18:19:47,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:47,684 INFO ]: With dead ends: 20 [2018-06-26 18:19:47,684 INFO ]: Without dead ends: 20 [2018-06-26 18:19:47,684 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:19:47,684 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:19:47,688 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 18:19:47,688 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:19:47,689 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-26 18:19:47,689 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2018-06-26 18:19:47,689 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:47,689 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-26 18:19:47,689 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:19:47,689 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-26 18:19:47,690 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:19:47,690 INFO ]: Found error trace [2018-06-26 18:19:47,690 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:47,690 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:47,690 INFO ]: Analyzing trace with hash 1620480632, now seen corresponding path program 1 times [2018-06-26 18:19:47,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:47,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:47,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:47,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:47,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:47,705 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:48,142 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:48,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:48,181 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:48,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:48,218 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:48,220 INFO ]: Computing forward predicates... [2018-06-26 18:19:48,333 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:48,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:48,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-26 18:19:48,353 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:19:48,353 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:19:48,353 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:19:48,353 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 12 states. [2018-06-26 18:19:48,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:48,836 INFO ]: Finished difference Result 28 states and 35 transitions. [2018-06-26 18:19:48,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:19:48,836 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-26 18:19:48,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:48,837 INFO ]: With dead ends: 28 [2018-06-26 18:19:48,837 INFO ]: Without dead ends: 21 [2018-06-26 18:19:48,837 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:19:48,837 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:19:48,840 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 18:19:48,840 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:19:48,840 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-26 18:19:48,841 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2018-06-26 18:19:48,841 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:48,841 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-26 18:19:48,841 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:19:48,841 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-26 18:19:48,842 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:19:48,842 INFO ]: Found error trace [2018-06-26 18:19:48,842 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:48,842 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:48,842 INFO ]: Analyzing trace with hash -1409559701, now seen corresponding path program 2 times [2018-06-26 18:19:48,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:48,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:48,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:48,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:48,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:48,866 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:48,999 INFO ]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:48,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:48,999 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:49,006 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:19:49,029 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:19:49,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:49,031 INFO ]: Computing forward predicates... [2018-06-26 18:19:49,171 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:49,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:49,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-26 18:19:49,194 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:19:49,194 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:19:49,194 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:19:49,194 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 14 states. [2018-06-26 18:19:49,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:49,246 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-26 18:19:49,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:19:49,246 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-26 18:19:49,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:49,247 INFO ]: With dead ends: 23 [2018-06-26 18:19:49,247 INFO ]: Without dead ends: 23 [2018-06-26 18:19:49,247 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:19:49,248 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:19:49,250 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 18:19:49,250 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:19:49,251 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-26 18:19:49,251 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2018-06-26 18:19:49,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:49,251 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-26 18:19:49,251 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:19:49,251 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-26 18:19:49,252 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:19:49,252 INFO ]: Found error trace [2018-06-26 18:19:49,252 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:49,252 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:49,252 INFO ]: Analyzing trace with hash -747328228, now seen corresponding path program 3 times [2018-06-26 18:19:49,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:49,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:49,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:49,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:49,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:49,268 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:49,356 INFO ]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:49,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:49,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:49,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:19:49,404 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:19:49,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:49,406 INFO ]: Computing forward predicates... [2018-06-26 18:19:49,592 INFO ]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:49,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:49,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-26 18:19:49,613 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:19:49,613 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:19:49,613 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:19:49,613 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 16 states. [2018-06-26 18:19:49,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:49,868 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-26 18:19:49,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:19:49,868 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 18:19:49,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:49,869 INFO ]: With dead ends: 33 [2018-06-26 18:19:49,869 INFO ]: Without dead ends: 24 [2018-06-26 18:19:49,870 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:19:49,870 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:19:49,872 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 18:19:49,872 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:19:49,873 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-26 18:19:49,873 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 14 [2018-06-26 18:19:49,873 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:49,873 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-26 18:19:49,873 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:19:49,873 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-26 18:19:49,874 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:19:49,874 INFO ]: Found error trace [2018-06-26 18:19:49,874 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:49,874 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:49,874 INFO ]: Analyzing trace with hash -628261553, now seen corresponding path program 4 times [2018-06-26 18:19:49,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:49,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:49,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:49,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:49,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:49,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:50,122 INFO ]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:50,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:50,122 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:50,128 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:19:50,162 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:19:50,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:50,164 INFO ]: Computing forward predicates... [2018-06-26 18:19:50,253 INFO ]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:50,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:50,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-26 18:19:50,272 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:19:50,272 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:19:50,272 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:19:50,273 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 16 states. [2018-06-26 18:19:50,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:50,341 INFO ]: Finished difference Result 26 states and 31 transitions. [2018-06-26 18:19:50,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:19:50,342 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-26 18:19:50,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:50,342 INFO ]: With dead ends: 26 [2018-06-26 18:19:50,342 INFO ]: Without dead ends: 26 [2018-06-26 18:19:50,343 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:19:50,343 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:19:50,346 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 18:19:50,346 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:19:50,347 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-26 18:19:50,348 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-06-26 18:19:50,348 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:50,348 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-26 18:19:50,348 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:19:50,348 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-26 18:19:50,348 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:19:50,348 INFO ]: Found error trace [2018-06-26 18:19:50,348 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:50,349 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:50,349 INFO ]: Analyzing trace with hash 1998077880, now seen corresponding path program 5 times [2018-06-26 18:19:50,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:50,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:50,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:50,349 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:50,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:50,372 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:50,460 INFO ]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:50,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:50,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:50,468 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:19:50,492 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:19:50,492 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:50,493 INFO ]: Computing forward predicates... [2018-06-26 18:19:50,592 INFO ]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:50,617 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:50,617 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-26 18:19:50,618 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:19:50,618 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:19:50,618 INFO ]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:19:50,618 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 19 states. [2018-06-26 18:19:51,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:51,296 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-26 18:19:51,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:19:51,297 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-26 18:19:51,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:51,298 INFO ]: With dead ends: 38 [2018-06-26 18:19:51,298 INFO ]: Without dead ends: 27 [2018-06-26 18:19:51,298 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:19:51,298 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 18:19:51,301 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 18:19:51,301 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 18:19:51,301 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-26 18:19:51,301 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-06-26 18:19:51,302 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:51,302 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-26 18:19:51,302 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:19:51,302 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-26 18:19:51,302 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:19:51,302 INFO ]: Found error trace [2018-06-26 18:19:51,302 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:51,302 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:51,302 INFO ]: Analyzing trace with hash 457035563, now seen corresponding path program 6 times [2018-06-26 18:19:51,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:51,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:51,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:51,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:51,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:51,326 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:51,460 INFO ]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:51,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:51,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:51,467 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:19:51,507 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:19:51,507 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:51,509 INFO ]: Computing forward predicates... [2018-06-26 18:19:51,567 INFO ]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:51,590 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:51,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-26 18:19:51,590 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:19:51,590 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:19:51,590 INFO ]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:19:51,590 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 18 states. [2018-06-26 18:19:51,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:51,652 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-26 18:19:51,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:19:51,652 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-26 18:19:51,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:51,653 INFO ]: With dead ends: 29 [2018-06-26 18:19:51,653 INFO ]: Without dead ends: 29 [2018-06-26 18:19:51,653 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:19:51,653 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:19:51,656 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 18:19:51,656 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:19:51,656 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-06-26 18:19:51,656 INFO ]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 17 [2018-06-26 18:19:51,657 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:51,657 INFO ]: Abstraction has 29 states and 34 transitions. [2018-06-26 18:19:51,657 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:19:51,657 INFO ]: Start isEmpty. Operand 29 states and 34 transitions. [2018-06-26 18:19:51,657 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:19:51,657 INFO ]: Found error trace [2018-06-26 18:19:51,657 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:51,658 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:51,658 INFO ]: Analyzing trace with hash 1282550108, now seen corresponding path program 7 times [2018-06-26 18:19:51,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:51,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:51,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:51,659 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:51,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:51,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:51,880 INFO ]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:51,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:51,881 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:51,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:51,922 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:51,924 INFO ]: Computing forward predicates... [2018-06-26 18:19:52,210 INFO ]: Checked inductivity of 22 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:52,230 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:52,230 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 18:19:52,230 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:19:52,230 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:19:52,230 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:19:52,230 INFO ]: Start difference. First operand 29 states and 34 transitions. Second operand 16 states. [2018-06-26 18:19:52,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:52,508 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-26 18:19:52,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:19:52,508 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-26 18:19:52,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:52,508 INFO ]: With dead ends: 43 [2018-06-26 18:19:52,508 INFO ]: Without dead ends: 30 [2018-06-26 18:19:52,509 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:19:52,509 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:19:52,511 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 18:19:52,511 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:19:52,512 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-26 18:19:52,512 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2018-06-26 18:19:52,512 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:52,512 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-26 18:19:52,512 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:19:52,512 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-26 18:19:52,513 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:19:52,513 INFO ]: Found error trace [2018-06-26 18:19:52,513 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:52,513 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:52,513 INFO ]: Analyzing trace with hash 2104600591, now seen corresponding path program 8 times [2018-06-26 18:19:52,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:52,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:52,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:52,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:52,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:52,540 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:52,798 INFO ]: Checked inductivity of 27 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:52,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:52,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:52,804 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:19:52,852 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:19:52,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:52,854 INFO ]: Computing forward predicates... [2018-06-26 18:19:52,927 INFO ]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:52,946 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:52,946 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-26 18:19:52,946 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:19:52,947 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:19:52,947 INFO ]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:19:52,947 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 20 states. [2018-06-26 18:19:53,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:53,034 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-26 18:19:53,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:19:53,034 INFO ]: Start accepts. Automaton has 20 states. Word has length 19 [2018-06-26 18:19:53,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:53,036 INFO ]: With dead ends: 32 [2018-06-26 18:19:53,036 INFO ]: Without dead ends: 32 [2018-06-26 18:19:53,036 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:19:53,036 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 18:19:53,039 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 18:19:53,039 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:19:53,039 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-26 18:19:53,040 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2018-06-26 18:19:53,040 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:53,040 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-26 18:19:53,040 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:19:53,040 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-26 18:19:53,040 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:19:53,040 INFO ]: Found error trace [2018-06-26 18:19:53,040 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:53,041 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:53,041 INFO ]: Analyzing trace with hash 817458424, now seen corresponding path program 9 times [2018-06-26 18:19:53,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:53,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:53,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:53,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:53,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:53,058 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:53,223 INFO ]: Checked inductivity of 32 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:53,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:53,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:53,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:19:53,323 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:19:53,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:53,325 INFO ]: Computing forward predicates... [2018-06-26 18:19:53,539 INFO ]: Checked inductivity of 32 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:53,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:53,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-26 18:19:53,559 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:19:53,559 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:19:53,559 INFO ]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:19:53,559 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 25 states. [2018-06-26 18:19:53,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:53,943 INFO ]: Finished difference Result 48 states and 55 transitions. [2018-06-26 18:19:53,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:19:53,943 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-26 18:19:53,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:53,944 INFO ]: With dead ends: 48 [2018-06-26 18:19:53,944 INFO ]: Without dead ends: 33 [2018-06-26 18:19:53,944 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1462, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:19:53,944 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:19:53,947 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 18:19:53,947 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:19:53,947 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-06-26 18:19:53,947 INFO ]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-06-26 18:19:53,947 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:53,947 INFO ]: Abstraction has 33 states and 38 transitions. [2018-06-26 18:19:53,947 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:19:53,948 INFO ]: Start isEmpty. Operand 33 states and 38 transitions. [2018-06-26 18:19:53,948 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:19:53,948 INFO ]: Found error trace [2018-06-26 18:19:53,948 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:53,948 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:53,948 INFO ]: Analyzing trace with hash 533990123, now seen corresponding path program 10 times [2018-06-26 18:19:53,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:53,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:53,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:53,949 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:53,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:53,962 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:54,701 INFO ]: Checked inductivity of 38 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:54,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:54,701 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:54,707 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:19:54,733 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:19:54,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:54,737 INFO ]: Computing forward predicates... [2018-06-26 18:19:54,808 INFO ]: Checked inductivity of 38 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:54,826 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:54,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2018-06-26 18:19:54,827 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:19:54,827 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:19:54,827 INFO ]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:19:54,827 INFO ]: Start difference. First operand 33 states and 38 transitions. Second operand 20 states. [2018-06-26 18:19:54,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:54,887 INFO ]: Finished difference Result 35 states and 40 transitions. [2018-06-26 18:19:54,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:19:54,887 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-26 18:19:54,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:54,887 INFO ]: With dead ends: 35 [2018-06-26 18:19:54,887 INFO ]: Without dead ends: 35 [2018-06-26 18:19:54,888 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:19:54,888 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:19:54,890 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 18:19:54,890 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:19:54,891 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-26 18:19:54,891 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2018-06-26 18:19:54,891 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:54,891 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-26 18:19:54,891 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:19:54,891 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-26 18:19:54,892 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:19:54,892 INFO ]: Found error trace [2018-06-26 18:19:54,892 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:54,892 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:54,892 INFO ]: Analyzing trace with hash -626825828, now seen corresponding path program 11 times [2018-06-26 18:19:54,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:54,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:54,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:54,893 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:54,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:54,905 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:55,360 INFO ]: Checked inductivity of 44 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:55,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:55,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:55,374 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:19:55,441 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:19:55,441 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:55,444 INFO ]: Computing forward predicates... [2018-06-26 18:19:55,676 INFO ]: Checked inductivity of 44 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:55,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:55,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-26 18:19:55,696 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:19:55,696 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:19:55,696 INFO ]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:19:55,696 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 28 states. [2018-06-26 18:19:56,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:56,499 INFO ]: Finished difference Result 53 states and 60 transitions. [2018-06-26 18:19:56,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:19:56,499 INFO ]: Start accepts. Automaton has 28 states. Word has length 22 [2018-06-26 18:19:56,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:56,499 INFO ]: With dead ends: 53 [2018-06-26 18:19:56,499 INFO ]: Without dead ends: 36 [2018-06-26 18:19:56,500 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=346, Invalid=1816, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 18:19:56,500 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 18:19:56,502 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 18:19:56,502 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 18:19:56,502 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-06-26 18:19:56,503 INFO ]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2018-06-26 18:19:56,503 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:56,503 INFO ]: Abstraction has 36 states and 41 transitions. [2018-06-26 18:19:56,503 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:19:56,503 INFO ]: Start isEmpty. Operand 36 states and 41 transitions. [2018-06-26 18:19:56,503 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:19:56,503 INFO ]: Found error trace [2018-06-26 18:19:56,503 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:56,503 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:56,504 INFO ]: Analyzing trace with hash 1838043855, now seen corresponding path program 12 times [2018-06-26 18:19:56,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:56,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:56,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:56,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:56,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:56,522 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:56,742 INFO ]: Checked inductivity of 51 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:56,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:56,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:56,749 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:19:56,776 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:19:56,776 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:56,779 INFO ]: Computing forward predicates... [2018-06-26 18:19:56,835 INFO ]: Checked inductivity of 51 backedges. 29 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:56,854 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:56,854 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 22 [2018-06-26 18:19:56,854 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:19:56,854 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:19:56,854 INFO ]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:19:56,854 INFO ]: Start difference. First operand 36 states and 41 transitions. Second operand 22 states. [2018-06-26 18:19:56,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:56,929 INFO ]: Finished difference Result 38 states and 43 transitions. [2018-06-26 18:19:56,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:19:56,929 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-26 18:19:56,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:56,930 INFO ]: With dead ends: 38 [2018-06-26 18:19:56,930 INFO ]: Without dead ends: 38 [2018-06-26 18:19:56,930 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:19:56,930 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:19:56,934 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 18:19:56,934 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 18:19:56,934 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-26 18:19:56,934 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 23 [2018-06-26 18:19:56,935 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:56,935 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-26 18:19:56,935 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:19:56,935 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-26 18:19:56,935 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:19:56,935 INFO ]: Found error trace [2018-06-26 18:19:56,935 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:56,935 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:56,936 INFO ]: Analyzing trace with hash 1144134200, now seen corresponding path program 13 times [2018-06-26 18:19:56,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:56,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:56,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:56,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:56,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:56,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:57,208 INFO ]: Checked inductivity of 58 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:57,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:57,208 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-26 18:19:57,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:57,240 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:57,243 INFO ]: Computing forward predicates... [2018-06-26 18:19:57,294 INFO ]: Checked inductivity of 58 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:57,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:57,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2018-06-26 18:19:57,313 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:19:57,313 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:19:57,313 INFO ]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:19:57,313 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 24 states. [2018-06-26 18:19:58,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:58,263 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-26 18:19:58,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 18:19:58,263 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-26 18:19:58,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:58,263 INFO ]: With dead ends: 58 [2018-06-26 18:19:58,263 INFO ]: Without dead ends: 39 [2018-06-26 18:19:58,264 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1011, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:19:58,264 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:19:58,266 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 18:19:58,266 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 18:19:58,266 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-26 18:19:58,267 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2018-06-26 18:19:58,267 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:58,267 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-26 18:19:58,267 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:19:58,267 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-26 18:19:58,267 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:19:58,267 INFO ]: Found error trace [2018-06-26 18:19:58,267 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:58,268 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:58,268 INFO ]: Analyzing trace with hash -938047829, now seen corresponding path program 14 times [2018-06-26 18:19:58,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:58,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:58,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:58,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:19:58,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:58,284 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:58,950 INFO ]: Checked inductivity of 66 backedges. 29 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:58,950 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:58,950 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:58,956 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:19:58,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:19:58,983 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:58,985 INFO ]: Computing forward predicates... [2018-06-26 18:19:59,050 INFO ]: Checked inductivity of 66 backedges. 37 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:59,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:59,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2018-06-26 18:19:59,069 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:19:59,069 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:19:59,069 INFO ]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:19:59,070 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 24 states. [2018-06-26 18:19:59,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:19:59,150 INFO ]: Finished difference Result 41 states and 46 transitions. [2018-06-26 18:19:59,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:19:59,150 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-26 18:19:59,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:19:59,151 INFO ]: With dead ends: 41 [2018-06-26 18:19:59,151 INFO ]: Without dead ends: 41 [2018-06-26 18:19:59,151 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:19:59,151 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 18:19:59,154 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 18:19:59,154 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:19:59,154 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-26 18:19:59,154 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2018-06-26 18:19:59,154 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:19:59,154 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-26 18:19:59,154 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:19:59,154 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-26 18:19:59,155 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:19:59,155 INFO ]: Found error trace [2018-06-26 18:19:59,155 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:19:59,155 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:19:59,155 INFO ]: Analyzing trace with hash 984637916, now seen corresponding path program 15 times [2018-06-26 18:19:59,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:19:59,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:19:59,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:59,156 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:19:59,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:19:59,171 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:59,374 INFO ]: Checked inductivity of 74 backedges. 29 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:59,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:19:59,374 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:19:59,380 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:19:59,415 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:19:59,415 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:19:59,418 INFO ]: Computing forward predicates... [2018-06-26 18:19:59,638 INFO ]: Checked inductivity of 74 backedges. 37 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:19:59,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:19:59,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-26 18:19:59,659 INFO ]: Interpolant automaton has 34 states [2018-06-26 18:19:59,659 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 18:19:59,659 INFO ]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:19:59,660 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 34 states. [2018-06-26 18:20:00,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:00,236 INFO ]: Finished difference Result 63 states and 70 transitions. [2018-06-26 18:20:00,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:20:00,236 INFO ]: Start accepts. Automaton has 34 states. Word has length 26 [2018-06-26 18:20:00,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:00,237 INFO ]: With dead ends: 63 [2018-06-26 18:20:00,237 INFO ]: Without dead ends: 42 [2018-06-26 18:20:00,238 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=502, Invalid=2690, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 18:20:00,238 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 18:20:00,240 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-26 18:20:00,240 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 18:20:00,241 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-26 18:20:00,241 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2018-06-26 18:20:00,241 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:00,241 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-26 18:20:00,241 INFO ]: Interpolant automaton has 34 states. [2018-06-26 18:20:00,241 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-26 18:20:00,241 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:20:00,242 INFO ]: Found error trace [2018-06-26 18:20:00,242 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:00,242 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:00,242 INFO ]: Analyzing trace with hash 1462467983, now seen corresponding path program 16 times [2018-06-26 18:20:00,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:00,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:00,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:00,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:00,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:00,255 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:00,500 INFO ]: Checked inductivity of 83 backedges. 37 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:00,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:00,500 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-26 18:20:00,506 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:20:00,536 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:20:00,536 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:00,538 INFO ]: Computing forward predicates... [2018-06-26 18:20:00,727 INFO ]: Checked inductivity of 83 backedges. 46 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:00,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:00,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 26 [2018-06-26 18:20:00,746 INFO ]: Interpolant automaton has 26 states [2018-06-26 18:20:00,746 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 18:20:00,746 INFO ]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:20:00,746 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 26 states. [2018-06-26 18:20:00,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:00,820 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-26 18:20:00,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:20:00,820 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 18:20:00,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:00,820 INFO ]: With dead ends: 44 [2018-06-26 18:20:00,820 INFO ]: Without dead ends: 44 [2018-06-26 18:20:00,821 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:20:00,821 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:20:00,823 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 18:20:00,823 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 18:20:00,823 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-06-26 18:20:00,823 INFO ]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 27 [2018-06-26 18:20:00,824 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:00,824 INFO ]: Abstraction has 44 states and 49 transitions. [2018-06-26 18:20:00,824 INFO ]: Interpolant automaton has 26 states. [2018-06-26 18:20:00,824 INFO ]: Start isEmpty. Operand 44 states and 49 transitions. [2018-06-26 18:20:00,824 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:20:00,824 INFO ]: Found error trace [2018-06-26 18:20:00,824 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:00,824 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:00,824 INFO ]: Analyzing trace with hash -1908783240, now seen corresponding path program 17 times [2018-06-26 18:20:00,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:00,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:00,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:00,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:00,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:00,837 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:01,030 INFO ]: Checked inductivity of 92 backedges. 37 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:01,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:01,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:01,037 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:20:01,074 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:20:01,074 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:01,076 INFO ]: Computing forward predicates... [2018-06-26 18:20:01,634 INFO ]: Checked inductivity of 92 backedges. 46 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:01,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:01,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-26 18:20:01,655 INFO ]: Interpolant automaton has 37 states [2018-06-26 18:20:01,655 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 18:20:01,655 INFO ]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:20:01,656 INFO ]: Start difference. First operand 44 states and 49 transitions. Second operand 37 states. [2018-06-26 18:20:02,429 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 18:20:02,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:02,774 INFO ]: Finished difference Result 68 states and 75 transitions. [2018-06-26 18:20:02,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:20:02,774 INFO ]: Start accepts. Automaton has 37 states. Word has length 28 [2018-06-26 18:20:02,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:02,774 INFO ]: With dead ends: 68 [2018-06-26 18:20:02,774 INFO ]: Without dead ends: 45 [2018-06-26 18:20:02,775 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=592, Invalid=3190, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 18:20:02,775 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 18:20:02,778 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-26 18:20:02,778 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:20:02,778 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-06-26 18:20:02,778 INFO ]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 28 [2018-06-26 18:20:02,778 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:02,778 INFO ]: Abstraction has 45 states and 50 transitions. [2018-06-26 18:20:02,778 INFO ]: Interpolant automaton has 37 states. [2018-06-26 18:20:02,778 INFO ]: Start isEmpty. Operand 45 states and 50 transitions. [2018-06-26 18:20:02,779 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:20:02,779 INFO ]: Found error trace [2018-06-26 18:20:02,779 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:02,779 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:02,779 INFO ]: Analyzing trace with hash 2019377771, now seen corresponding path program 18 times [2018-06-26 18:20:02,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:02,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:02,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:02,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:02,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:02,795 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:03,261 INFO ]: Checked inductivity of 102 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:03,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:03,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:03,275 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:20:03,320 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:20:03,320 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:03,322 INFO ]: Computing forward predicates... [2018-06-26 18:20:03,382 INFO ]: Checked inductivity of 102 backedges. 56 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:03,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:03,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-06-26 18:20:03,402 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:20:03,402 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:20:03,402 INFO ]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:20:03,403 INFO ]: Start difference. First operand 45 states and 50 transitions. Second operand 28 states. [2018-06-26 18:20:03,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:03,507 INFO ]: Finished difference Result 47 states and 52 transitions. [2018-06-26 18:20:03,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:20:03,507 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-26 18:20:03,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:03,508 INFO ]: With dead ends: 47 [2018-06-26 18:20:03,508 INFO ]: Without dead ends: 47 [2018-06-26 18:20:03,508 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:20:03,508 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 18:20:03,510 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-26 18:20:03,510 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 18:20:03,511 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-06-26 18:20:03,511 INFO ]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 29 [2018-06-26 18:20:03,511 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:03,511 INFO ]: Abstraction has 47 states and 52 transitions. [2018-06-26 18:20:03,511 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:20:03,511 INFO ]: Start isEmpty. Operand 47 states and 52 transitions. [2018-06-26 18:20:03,512 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:20:03,512 INFO ]: Found error trace [2018-06-26 18:20:03,512 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:03,512 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:03,512 INFO ]: Analyzing trace with hash -1824448996, now seen corresponding path program 19 times [2018-06-26 18:20:03,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:03,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:03,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:03,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:03,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:03,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:04,792 INFO ]: Checked inductivity of 112 backedges. 46 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:04,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:04,792 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:04,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:04,850 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:04,853 INFO ]: Computing forward predicates... [2018-06-26 18:20:05,046 INFO ]: Checked inductivity of 112 backedges. 56 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:05,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:05,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 30 [2018-06-26 18:20:05,065 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:20:05,065 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:20:05,066 INFO ]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:20:05,066 INFO ]: Start difference. First operand 47 states and 52 transitions. Second operand 30 states. [2018-06-26 18:20:05,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:05,398 INFO ]: Finished difference Result 73 states and 80 transitions. [2018-06-26 18:20:05,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:20:05,400 INFO ]: Start accepts. Automaton has 30 states. Word has length 30 [2018-06-26 18:20:05,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:05,401 INFO ]: With dead ends: 73 [2018-06-26 18:20:05,401 INFO ]: Without dead ends: 48 [2018-06-26 18:20:05,401 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=393, Invalid=1587, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:20:05,401 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 18:20:05,403 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 18:20:05,403 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 18:20:05,404 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-06-26 18:20:05,404 INFO ]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-06-26 18:20:05,404 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:05,404 INFO ]: Abstraction has 48 states and 53 transitions. [2018-06-26 18:20:05,404 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:20:05,404 INFO ]: Start isEmpty. Operand 48 states and 53 transitions. [2018-06-26 18:20:05,404 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:20:05,404 INFO ]: Found error trace [2018-06-26 18:20:05,405 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:05,405 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:05,405 INFO ]: Analyzing trace with hash -2137970609, now seen corresponding path program 20 times [2018-06-26 18:20:05,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:05,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:05,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:05,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:05,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:05,422 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:05,811 INFO ]: Checked inductivity of 123 backedges. 56 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:05,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:05,811 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:05,817 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:20:05,859 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:20:05,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:05,863 INFO ]: Computing forward predicates... [2018-06-26 18:20:05,917 INFO ]: Checked inductivity of 123 backedges. 67 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:05,941 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:05,941 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 30 [2018-06-26 18:20:05,941 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:20:05,942 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:20:05,942 INFO ]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:20:05,942 INFO ]: Start difference. First operand 48 states and 53 transitions. Second operand 30 states. [2018-06-26 18:20:06,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:06,022 INFO ]: Finished difference Result 50 states and 55 transitions. [2018-06-26 18:20:06,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:20:06,022 INFO ]: Start accepts. Automaton has 30 states. Word has length 31 [2018-06-26 18:20:06,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:06,022 INFO ]: With dead ends: 50 [2018-06-26 18:20:06,022 INFO ]: Without dead ends: 50 [2018-06-26 18:20:06,022 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:20:06,023 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 18:20:06,024 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-26 18:20:06,024 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:20:06,024 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-06-26 18:20:06,024 INFO ]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 31 [2018-06-26 18:20:06,024 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:06,024 INFO ]: Abstraction has 50 states and 55 transitions. [2018-06-26 18:20:06,024 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:20:06,024 INFO ]: Start isEmpty. Operand 50 states and 55 transitions. [2018-06-26 18:20:06,025 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:20:06,025 INFO ]: Found error trace [2018-06-26 18:20:06,025 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:06,025 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:06,025 INFO ]: Analyzing trace with hash -1853229896, now seen corresponding path program 21 times [2018-06-26 18:20:06,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:06,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:06,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:06,026 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:06,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:06,039 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:06,642 INFO ]: Checked inductivity of 134 backedges. 56 proven. 77 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:06,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:06,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:06,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:20:06,698 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-26 18:20:06,698 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:06,702 INFO ]: Computing forward predicates... [2018-06-26 18:20:06,973 INFO ]: Checked inductivity of 134 backedges. 67 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:06,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:06,992 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-26 18:20:06,992 INFO ]: Interpolant automaton has 43 states [2018-06-26 18:20:06,992 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 18:20:06,993 INFO ]: CoverageRelationStatistics Valid=283, Invalid=1523, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 18:20:06,993 INFO ]: Start difference. First operand 50 states and 55 transitions. Second operand 43 states. [2018-06-26 18:20:07,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:07,638 INFO ]: Finished difference Result 78 states and 85 transitions. [2018-06-26 18:20:07,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-26 18:20:07,638 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-26 18:20:07,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:07,639 INFO ]: With dead ends: 78 [2018-06-26 18:20:07,639 INFO ]: Without dead ends: 51 [2018-06-26 18:20:07,640 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=796, Invalid=4316, Unknown=0, NotChecked=0, Total=5112 [2018-06-26 18:20:07,640 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:20:07,642 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-26 18:20:07,642 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:20:07,642 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-06-26 18:20:07,642 INFO ]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 32 [2018-06-26 18:20:07,643 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:07,643 INFO ]: Abstraction has 51 states and 56 transitions. [2018-06-26 18:20:07,643 INFO ]: Interpolant automaton has 43 states. [2018-06-26 18:20:07,643 INFO ]: Start isEmpty. Operand 51 states and 56 transitions. [2018-06-26 18:20:07,646 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:20:07,646 INFO ]: Found error trace [2018-06-26 18:20:07,646 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:07,646 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:07,646 INFO ]: Analyzing trace with hash 1795178027, now seen corresponding path program 22 times [2018-06-26 18:20:07,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:07,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:07,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:07,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:07,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:07,660 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:07,998 INFO ]: Checked inductivity of 146 backedges. 67 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:07,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:07,998 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:08,004 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:20:08,044 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:20:08,044 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:08,047 INFO ]: Computing forward predicates... [2018-06-26 18:20:08,145 INFO ]: Checked inductivity of 146 backedges. 79 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:08,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:08,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 32 [2018-06-26 18:20:08,164 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:20:08,164 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:20:08,164 INFO ]: CoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:20:08,164 INFO ]: Start difference. First operand 51 states and 56 transitions. Second operand 32 states. [2018-06-26 18:20:08,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:08,290 INFO ]: Finished difference Result 53 states and 58 transitions. [2018-06-26 18:20:08,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:20:08,315 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-26 18:20:08,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:08,316 INFO ]: With dead ends: 53 [2018-06-26 18:20:08,316 INFO ]: Without dead ends: 53 [2018-06-26 18:20:08,317 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:20:08,317 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:20:08,320 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-26 18:20:08,320 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 18:20:08,321 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-06-26 18:20:08,321 INFO ]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 33 [2018-06-26 18:20:08,321 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:08,321 INFO ]: Abstraction has 53 states and 58 transitions. [2018-06-26 18:20:08,321 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:20:08,321 INFO ]: Start isEmpty. Operand 53 states and 58 transitions. [2018-06-26 18:20:08,322 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:20:08,322 INFO ]: Found error trace [2018-06-26 18:20:08,322 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:08,322 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:08,322 INFO ]: Analyzing trace with hash -184706468, now seen corresponding path program 23 times [2018-06-26 18:20:08,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:08,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:08,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:08,323 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:08,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:08,338 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:08,805 INFO ]: Checked inductivity of 158 backedges. 67 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:08,805 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:08,805 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:08,812 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:20:08,960 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 18:20:08,960 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:08,964 INFO ]: Computing forward predicates... [2018-06-26 18:20:09,430 INFO ]: Checked inductivity of 158 backedges. 79 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:09,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:09,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-26 18:20:09,454 INFO ]: Interpolant automaton has 46 states [2018-06-26 18:20:09,454 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 18:20:09,454 INFO ]: CoverageRelationStatistics Valid=325, Invalid=1745, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 18:20:09,454 INFO ]: Start difference. First operand 53 states and 58 transitions. Second operand 46 states. [2018-06-26 18:20:10,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:10,163 INFO ]: Finished difference Result 83 states and 90 transitions. [2018-06-26 18:20:10,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 18:20:10,163 INFO ]: Start accepts. Automaton has 46 states. Word has length 34 [2018-06-26 18:20:10,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:10,163 INFO ]: With dead ends: 83 [2018-06-26 18:20:10,164 INFO ]: Without dead ends: 54 [2018-06-26 18:20:10,165 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=910, Invalid=4942, Unknown=0, NotChecked=0, Total=5852 [2018-06-26 18:20:10,165 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 18:20:10,167 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-26 18:20:10,167 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 18:20:10,167 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-06-26 18:20:10,167 INFO ]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-06-26 18:20:10,167 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:10,167 INFO ]: Abstraction has 54 states and 59 transitions. [2018-06-26 18:20:10,167 INFO ]: Interpolant automaton has 46 states. [2018-06-26 18:20:10,167 INFO ]: Start isEmpty. Operand 54 states and 59 transitions. [2018-06-26 18:20:10,167 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 18:20:10,167 INFO ]: Found error trace [2018-06-26 18:20:10,167 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:10,167 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:10,168 INFO ]: Analyzing trace with hash 1241993999, now seen corresponding path program 24 times [2018-06-26 18:20:10,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:10,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:10,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:10,168 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:10,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:10,183 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:10,551 INFO ]: Checked inductivity of 171 backedges. 79 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:10,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:10,551 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:10,560 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:20:10,608 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 18:20:10,608 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:10,611 INFO ]: Computing forward predicates... [2018-06-26 18:20:10,740 INFO ]: Checked inductivity of 171 backedges. 92 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:10,759 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:10,759 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 34 [2018-06-26 18:20:10,759 INFO ]: Interpolant automaton has 34 states [2018-06-26 18:20:10,759 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 18:20:10,760 INFO ]: CoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:20:10,760 INFO ]: Start difference. First operand 54 states and 59 transitions. Second operand 34 states. [2018-06-26 18:20:10,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:10,845 INFO ]: Finished difference Result 56 states and 61 transitions. [2018-06-26 18:20:10,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 18:20:10,845 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-26 18:20:10,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:10,845 INFO ]: With dead ends: 56 [2018-06-26 18:20:10,845 INFO ]: Without dead ends: 56 [2018-06-26 18:20:10,846 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:20:10,846 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-26 18:20:10,848 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-26 18:20:10,848 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 18:20:10,848 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-06-26 18:20:10,848 INFO ]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 35 [2018-06-26 18:20:10,848 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:10,848 INFO ]: Abstraction has 56 states and 61 transitions. [2018-06-26 18:20:10,848 INFO ]: Interpolant automaton has 34 states. [2018-06-26 18:20:10,848 INFO ]: Start isEmpty. Operand 56 states and 61 transitions. [2018-06-26 18:20:10,849 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 18:20:10,849 INFO ]: Found error trace [2018-06-26 18:20:10,849 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:10,849 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:10,849 INFO ]: Analyzing trace with hash -153542152, now seen corresponding path program 25 times [2018-06-26 18:20:10,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:10,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:10,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:10,850 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:10,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:10,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:11,317 INFO ]: Checked inductivity of 184 backedges. 79 proven. 104 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:11,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:11,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:11,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:11,379 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:11,381 INFO ]: Computing forward predicates... [2018-06-26 18:20:11,927 INFO ]: Checked inductivity of 184 backedges. 92 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:11,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:11,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-06-26 18:20:11,946 INFO ]: Interpolant automaton has 36 states [2018-06-26 18:20:11,946 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 18:20:11,946 INFO ]: CoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:20:11,946 INFO ]: Start difference. First operand 56 states and 61 transitions. Second operand 36 states. [2018-06-26 18:20:12,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:12,358 INFO ]: Finished difference Result 88 states and 95 transitions. [2018-06-26 18:20:12,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-26 18:20:12,358 INFO ]: Start accepts. Automaton has 36 states. Word has length 36 [2018-06-26 18:20:12,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:12,359 INFO ]: With dead ends: 88 [2018-06-26 18:20:12,359 INFO ]: Without dead ends: 57 [2018-06-26 18:20:12,360 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=573, Invalid=2289, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 18:20:12,360 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 18:20:12,362 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-26 18:20:12,362 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 18:20:12,362 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-26 18:20:12,362 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 36 [2018-06-26 18:20:12,362 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:12,362 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-26 18:20:12,362 INFO ]: Interpolant automaton has 36 states. [2018-06-26 18:20:12,363 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-26 18:20:12,365 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 18:20:12,365 INFO ]: Found error trace [2018-06-26 18:20:12,365 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:12,366 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:12,366 INFO ]: Analyzing trace with hash 811039211, now seen corresponding path program 26 times [2018-06-26 18:20:12,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:12,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:12,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:12,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:12,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:12,380 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:12,783 INFO ]: Checked inductivity of 198 backedges. 92 proven. 105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:12,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:12,784 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:12,789 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:20:12,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:20:12,835 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:12,837 INFO ]: Computing forward predicates... [2018-06-26 18:20:12,897 INFO ]: Checked inductivity of 198 backedges. 106 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:12,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:12,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-06-26 18:20:12,928 INFO ]: Interpolant automaton has 36 states [2018-06-26 18:20:12,928 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 18:20:12,929 INFO ]: CoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:20:12,929 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 36 states. [2018-06-26 18:20:13,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:13,040 INFO ]: Finished difference Result 59 states and 64 transitions. [2018-06-26 18:20:13,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 18:20:13,040 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-26 18:20:13,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:13,040 INFO ]: With dead ends: 59 [2018-06-26 18:20:13,040 INFO ]: Without dead ends: 59 [2018-06-26 18:20:13,041 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:20:13,041 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 18:20:13,042 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-26 18:20:13,043 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 18:20:13,043 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-06-26 18:20:13,043 INFO ]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 37 [2018-06-26 18:20:13,043 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:13,043 INFO ]: Abstraction has 59 states and 64 transitions. [2018-06-26 18:20:13,043 INFO ]: Interpolant automaton has 36 states. [2018-06-26 18:20:13,043 INFO ]: Start isEmpty. Operand 59 states and 64 transitions. [2018-06-26 18:20:13,043 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 18:20:13,043 INFO ]: Found error trace [2018-06-26 18:20:13,044 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:13,044 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:13,044 INFO ]: Analyzing trace with hash -628238692, now seen corresponding path program 27 times [2018-06-26 18:20:13,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:13,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:13,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:13,044 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:13,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:13,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:13,934 INFO ]: Checked inductivity of 212 backedges. 92 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:13,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:13,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:13,940 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:20:14,010 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 18:20:14,010 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:14,013 INFO ]: Computing forward predicates... [2018-06-26 18:20:14,491 INFO ]: Checked inductivity of 212 backedges. 106 proven. 105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:14,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:14,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-26 18:20:14,511 INFO ]: Interpolant automaton has 52 states [2018-06-26 18:20:14,511 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 18:20:14,511 INFO ]: CoverageRelationStatistics Valid=418, Invalid=2234, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 18:20:14,511 INFO ]: Start difference. First operand 59 states and 64 transitions. Second operand 52 states. [2018-06-26 18:20:15,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:15,716 INFO ]: Finished difference Result 93 states and 100 transitions. [2018-06-26 18:20:15,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-26 18:20:15,716 INFO ]: Start accepts. Automaton has 52 states. Word has length 38 [2018-06-26 18:20:15,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:15,716 INFO ]: With dead ends: 93 [2018-06-26 18:20:15,716 INFO ]: Without dead ends: 60 [2018-06-26 18:20:15,718 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1162, Invalid=6320, Unknown=0, NotChecked=0, Total=7482 [2018-06-26 18:20:15,718 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 18:20:15,719 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-26 18:20:15,719 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-26 18:20:15,719 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-06-26 18:20:15,719 INFO ]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2018-06-26 18:20:15,720 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:15,720 INFO ]: Abstraction has 60 states and 65 transitions. [2018-06-26 18:20:15,720 INFO ]: Interpolant automaton has 52 states. [2018-06-26 18:20:15,720 INFO ]: Start isEmpty. Operand 60 states and 65 transitions. [2018-06-26 18:20:15,720 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:20:15,720 INFO ]: Found error trace [2018-06-26 18:20:15,720 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:15,720 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:15,720 INFO ]: Analyzing trace with hash -1378484785, now seen corresponding path program 28 times [2018-06-26 18:20:15,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:15,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:15,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:15,721 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:15,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:15,729 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:16,146 INFO ]: Checked inductivity of 227 backedges. 106 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:16,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:16,146 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:16,152 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:20:16,199 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:20:16,199 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:16,202 INFO ]: Computing forward predicates... [2018-06-26 18:20:16,633 INFO ]: Checked inductivity of 227 backedges. 121 proven. 105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:16,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:16,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 38 [2018-06-26 18:20:16,653 INFO ]: Interpolant automaton has 38 states [2018-06-26 18:20:16,653 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 18:20:16,653 INFO ]: CoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:20:16,653 INFO ]: Start difference. First operand 60 states and 65 transitions. Second operand 38 states. [2018-06-26 18:20:16,745 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:16,745 INFO ]: Finished difference Result 62 states and 67 transitions. [2018-06-26 18:20:16,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:20:16,745 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-26 18:20:16,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:16,745 INFO ]: With dead ends: 62 [2018-06-26 18:20:16,745 INFO ]: Without dead ends: 62 [2018-06-26 18:20:16,746 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:20:16,746 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-26 18:20:16,748 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-26 18:20:16,748 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 18:20:16,748 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-06-26 18:20:16,749 INFO ]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 39 [2018-06-26 18:20:16,749 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:16,749 INFO ]: Abstraction has 62 states and 67 transitions. [2018-06-26 18:20:16,749 INFO ]: Interpolant automaton has 38 states. [2018-06-26 18:20:16,749 INFO ]: Start isEmpty. Operand 62 states and 67 transitions. [2018-06-26 18:20:16,749 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 18:20:16,749 INFO ]: Found error trace [2018-06-26 18:20:16,749 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:16,749 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:16,749 INFO ]: Analyzing trace with hash 215994168, now seen corresponding path program 29 times [2018-06-26 18:20:16,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:16,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:16,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:16,750 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:16,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:16,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:17,348 INFO ]: Checked inductivity of 242 backedges. 106 proven. 135 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:17,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:17,348 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:17,353 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:20:17,413 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 18:20:17,413 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:17,415 INFO ]: Computing forward predicates... [2018-06-26 18:20:17,878 INFO ]: Checked inductivity of 242 backedges. 121 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:17,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:17,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2018-06-26 18:20:17,897 INFO ]: Interpolant automaton has 55 states [2018-06-26 18:20:17,897 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-26 18:20:17,898 INFO ]: CoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 18:20:17,898 INFO ]: Start difference. First operand 62 states and 67 transitions. Second operand 55 states. [2018-06-26 18:20:19,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:19,004 INFO ]: Finished difference Result 98 states and 105 transitions. [2018-06-26 18:20:19,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-26 18:20:19,004 INFO ]: Start accepts. Automaton has 55 states. Word has length 40 [2018-06-26 18:20:19,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:19,005 INFO ]: With dead ends: 98 [2018-06-26 18:20:19,005 INFO ]: Without dead ends: 63 [2018-06-26 18:20:19,006 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1300, Invalid=7072, Unknown=0, NotChecked=0, Total=8372 [2018-06-26 18:20:19,006 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-26 18:20:19,008 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-26 18:20:19,008 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 18:20:19,008 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-06-26 18:20:19,008 INFO ]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2018-06-26 18:20:19,008 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:19,008 INFO ]: Abstraction has 63 states and 68 transitions. [2018-06-26 18:20:19,008 INFO ]: Interpolant automaton has 55 states. [2018-06-26 18:20:19,008 INFO ]: Start isEmpty. Operand 63 states and 68 transitions. [2018-06-26 18:20:19,009 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 18:20:19,009 INFO ]: Found error trace [2018-06-26 18:20:19,009 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:19,009 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:19,009 INFO ]: Analyzing trace with hash 784004523, now seen corresponding path program 30 times [2018-06-26 18:20:19,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:19,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:19,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:19,010 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:19,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:19,021 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:19,545 INFO ]: Checked inductivity of 258 backedges. 121 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:19,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:19,545 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:19,551 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:20:19,612 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 18:20:19,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:19,615 INFO ]: Computing forward predicates... [2018-06-26 18:20:19,866 INFO ]: Checked inductivity of 258 backedges. 137 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:19,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:19,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 40 [2018-06-26 18:20:19,885 INFO ]: Interpolant automaton has 40 states [2018-06-26 18:20:19,885 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 18:20:19,885 INFO ]: CoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:20:19,886 INFO ]: Start difference. First operand 63 states and 68 transitions. Second operand 40 states. [2018-06-26 18:20:19,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:19,998 INFO ]: Finished difference Result 65 states and 70 transitions. [2018-06-26 18:20:19,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 18:20:19,998 INFO ]: Start accepts. Automaton has 40 states. Word has length 41 [2018-06-26 18:20:19,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:19,998 INFO ]: With dead ends: 65 [2018-06-26 18:20:19,998 INFO ]: Without dead ends: 65 [2018-06-26 18:20:19,999 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=1255, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:20:19,999 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 18:20:20,000 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-06-26 18:20:20,000 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 18:20:20,001 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-06-26 18:20:20,001 INFO ]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 41 [2018-06-26 18:20:20,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:20,001 INFO ]: Abstraction has 65 states and 70 transitions. [2018-06-26 18:20:20,001 INFO ]: Interpolant automaton has 40 states. [2018-06-26 18:20:20,001 INFO ]: Start isEmpty. Operand 65 states and 70 transitions. [2018-06-26 18:20:20,001 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 18:20:20,002 INFO ]: Found error trace [2018-06-26 18:20:20,002 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:20,002 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:20,002 INFO ]: Analyzing trace with hash -1466314020, now seen corresponding path program 31 times [2018-06-26 18:20:20,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:20,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:20,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:20,002 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:20,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:20,014 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:20,425 INFO ]: Checked inductivity of 274 backedges. 121 proven. 152 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:20,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:20,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:20,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:20,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:20,483 INFO ]: Computing forward predicates... [2018-06-26 18:20:20,613 INFO ]: Checked inductivity of 274 backedges. 137 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:20,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:20,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 42 [2018-06-26 18:20:20,632 INFO ]: Interpolant automaton has 42 states [2018-06-26 18:20:20,632 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-26 18:20:20,632 INFO ]: CoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:20:20,632 INFO ]: Start difference. First operand 65 states and 70 transitions. Second operand 42 states. [2018-06-26 18:20:21,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:21,034 INFO ]: Finished difference Result 103 states and 110 transitions. [2018-06-26 18:20:21,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-26 18:20:21,038 INFO ]: Start accepts. Automaton has 42 states. Word has length 42 [2018-06-26 18:20:21,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:21,039 INFO ]: With dead ends: 103 [2018-06-26 18:20:21,039 INFO ]: Without dead ends: 66 [2018-06-26 18:20:21,039 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=789, Invalid=3117, Unknown=0, NotChecked=0, Total=3906 [2018-06-26 18:20:21,039 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-26 18:20:21,041 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-26 18:20:21,041 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-26 18:20:21,042 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-06-26 18:20:21,042 INFO ]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 42 [2018-06-26 18:20:21,042 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:21,042 INFO ]: Abstraction has 66 states and 71 transitions. [2018-06-26 18:20:21,042 INFO ]: Interpolant automaton has 42 states. [2018-06-26 18:20:21,042 INFO ]: Start isEmpty. Operand 66 states and 71 transitions. [2018-06-26 18:20:21,043 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 18:20:21,043 INFO ]: Found error trace [2018-06-26 18:20:21,043 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:21,043 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:21,043 INFO ]: Analyzing trace with hash -1069209457, now seen corresponding path program 32 times [2018-06-26 18:20:21,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:21,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:21,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:21,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:21,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:21,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:21,816 INFO ]: Checked inductivity of 291 backedges. 106 proven. 184 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:21,816 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:21,816 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:21,821 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:20:21,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:20:21,873 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:21,877 INFO ]: Computing forward predicates... [2018-06-26 18:20:22,041 INFO ]: Checked inductivity of 291 backedges. 154 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:22,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:22,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-06-26 18:20:22,060 INFO ]: Interpolant automaton has 44 states [2018-06-26 18:20:22,060 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 18:20:22,060 INFO ]: CoverageRelationStatistics Valid=411, Invalid=1481, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:20:22,060 INFO ]: Start difference. First operand 66 states and 71 transitions. Second operand 44 states. [2018-06-26 18:20:22,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:22,181 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-26 18:20:22,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 18:20:22,181 INFO ]: Start accepts. Automaton has 44 states. Word has length 43 [2018-06-26 18:20:22,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:22,182 INFO ]: With dead ends: 68 [2018-06-26 18:20:22,182 INFO ]: Without dead ends: 68 [2018-06-26 18:20:22,182 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=434, Invalid=1546, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:20:22,182 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 18:20:22,184 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-26 18:20:22,184 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-26 18:20:22,184 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-06-26 18:20:22,184 INFO ]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 43 [2018-06-26 18:20:22,185 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:22,185 INFO ]: Abstraction has 68 states and 73 transitions. [2018-06-26 18:20:22,185 INFO ]: Interpolant automaton has 44 states. [2018-06-26 18:20:22,185 INFO ]: Start isEmpty. Operand 68 states and 73 transitions. [2018-06-26 18:20:22,185 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 18:20:22,185 INFO ]: Found error trace [2018-06-26 18:20:22,185 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:22,185 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:22,185 INFO ]: Analyzing trace with hash 1213594744, now seen corresponding path program 33 times [2018-06-26 18:20:22,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:22,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:22,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:22,186 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:22,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:22,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:23,456 INFO ]: Checked inductivity of 308 backedges. 137 proven. 170 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:23,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:23,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-26 18:20:23,461 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:20:23,533 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-26 18:20:23,533 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:23,537 INFO ]: Computing forward predicates... [2018-06-26 18:20:23,998 INFO ]: Checked inductivity of 308 backedges. 154 proven. 153 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:24,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:24,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 61 [2018-06-26 18:20:24,073 INFO ]: Interpolant automaton has 61 states [2018-06-26 18:20:24,073 INFO ]: Constructing interpolant automaton starting with 61 interpolants. [2018-06-26 18:20:24,073 INFO ]: CoverageRelationStatistics Valid=579, Invalid=3081, Unknown=0, NotChecked=0, Total=3660 [2018-06-26 18:20:24,073 INFO ]: Start difference. First operand 68 states and 73 transitions. Second operand 61 states. [2018-06-26 18:20:25,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:25,174 INFO ]: Finished difference Result 108 states and 115 transitions. [2018-06-26 18:20:25,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-26 18:20:25,174 INFO ]: Start accepts. Automaton has 61 states. Word has length 44 [2018-06-26 18:20:25,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:25,175 INFO ]: With dead ends: 108 [2018-06-26 18:20:25,175 INFO ]: Without dead ends: 69 [2018-06-26 18:20:25,176 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2206 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1556, Invalid=8746, Unknown=0, NotChecked=0, Total=10302 [2018-06-26 18:20:25,176 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 18:20:25,178 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-26 18:20:25,178 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 18:20:25,178 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-06-26 18:20:25,179 INFO ]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 44 [2018-06-26 18:20:25,179 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:25,179 INFO ]: Abstraction has 69 states and 74 transitions. [2018-06-26 18:20:25,179 INFO ]: Interpolant automaton has 61 states. [2018-06-26 18:20:25,179 INFO ]: Start isEmpty. Operand 69 states and 74 transitions. [2018-06-26 18:20:25,179 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 18:20:25,179 INFO ]: Found error trace [2018-06-26 18:20:25,179 INFO ]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:25,179 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:25,179 INFO ]: Analyzing trace with hash 578990443, now seen corresponding path program 34 times [2018-06-26 18:20:25,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:25,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:25,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:25,180 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:25,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:25,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:26,048 INFO ]: Checked inductivity of 326 backedges. 121 proven. 204 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:26,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:26,048 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:26,054 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:20:26,112 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:20:26,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:26,116 INFO ]: Computing forward predicates... [2018-06-26 18:20:26,253 INFO ]: Checked inductivity of 326 backedges. 172 proven. 153 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:26,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:26,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 46 [2018-06-26 18:20:26,272 INFO ]: Interpolant automaton has 46 states [2018-06-26 18:20:26,273 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 18:20:26,273 INFO ]: CoverageRelationStatistics Valid=452, Invalid=1618, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 18:20:26,273 INFO ]: Start difference. First operand 69 states and 74 transitions. Second operand 46 states. [2018-06-26 18:20:26,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:26,498 INFO ]: Finished difference Result 71 states and 76 transitions. [2018-06-26 18:20:26,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:20:26,499 INFO ]: Start accepts. Automaton has 46 states. Word has length 45 [2018-06-26 18:20:26,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:26,499 INFO ]: With dead ends: 71 [2018-06-26 18:20:26,499 INFO ]: Without dead ends: 71 [2018-06-26 18:20:26,499 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=476, Invalid=1686, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 18:20:26,499 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-26 18:20:26,501 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-06-26 18:20:26,501 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:20:26,502 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-06-26 18:20:26,502 INFO ]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 45 [2018-06-26 18:20:26,502 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:26,502 INFO ]: Abstraction has 71 states and 76 transitions. [2018-06-26 18:20:26,502 INFO ]: Interpolant automaton has 46 states. [2018-06-26 18:20:26,502 INFO ]: Start isEmpty. Operand 71 states and 76 transitions. [2018-06-26 18:20:26,503 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 18:20:26,503 INFO ]: Found error trace [2018-06-26 18:20:26,503 INFO ]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:26,503 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:26,503 INFO ]: Analyzing trace with hash 768184092, now seen corresponding path program 35 times [2018-06-26 18:20:26,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:26,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:26,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:26,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:26,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:26,515 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:27,062 INFO ]: Checked inductivity of 344 backedges. 154 proven. 189 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:27,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:27,063 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:27,068 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:20:27,139 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-26 18:20:27,139 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:27,143 INFO ]: Computing forward predicates... [2018-06-26 18:20:27,715 INFO ]: Checked inductivity of 344 backedges. 172 proven. 171 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:27,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:27,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 64 [2018-06-26 18:20:27,735 INFO ]: Interpolant automaton has 64 states [2018-06-26 18:20:27,735 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-26 18:20:27,736 INFO ]: CoverageRelationStatistics Valid=639, Invalid=3393, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 18:20:27,736 INFO ]: Start difference. First operand 71 states and 76 transitions. Second operand 64 states. [2018-06-26 18:20:29,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:29,271 INFO ]: Finished difference Result 113 states and 120 transitions. [2018-06-26 18:20:29,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-26 18:20:29,272 INFO ]: Start accepts. Automaton has 64 states. Word has length 46 [2018-06-26 18:20:29,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:29,272 INFO ]: With dead ends: 113 [2018-06-26 18:20:29,272 INFO ]: Without dead ends: 72 [2018-06-26 18:20:29,273 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1716, Invalid=9626, Unknown=0, NotChecked=0, Total=11342 [2018-06-26 18:20:29,273 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 18:20:29,275 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-26 18:20:29,275 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 18:20:29,276 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-06-26 18:20:29,276 INFO ]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 46 [2018-06-26 18:20:29,276 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:29,276 INFO ]: Abstraction has 72 states and 77 transitions. [2018-06-26 18:20:29,276 INFO ]: Interpolant automaton has 64 states. [2018-06-26 18:20:29,276 INFO ]: Start isEmpty. Operand 72 states and 77 transitions. [2018-06-26 18:20:29,276 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-26 18:20:29,276 INFO ]: Found error trace [2018-06-26 18:20:29,277 INFO ]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:29,277 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:29,277 INFO ]: Analyzing trace with hash 798806863, now seen corresponding path program 36 times [2018-06-26 18:20:29,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:29,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:29,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:29,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:29,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:29,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:30,121 INFO ]: Checked inductivity of 363 backedges. 137 proven. 225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:30,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:30,121 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:30,127 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:20:30,200 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-26 18:20:30,200 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:30,203 INFO ]: Computing forward predicates... [2018-06-26 18:20:30,323 INFO ]: Checked inductivity of 363 backedges. 191 proven. 171 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:30,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:30,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 48 [2018-06-26 18:20:30,343 INFO ]: Interpolant automaton has 48 states [2018-06-26 18:20:30,343 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-26 18:20:30,343 INFO ]: CoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 18:20:30,343 INFO ]: Start difference. First operand 72 states and 77 transitions. Second operand 48 states. [2018-06-26 18:20:30,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:30,624 INFO ]: Finished difference Result 74 states and 79 transitions. [2018-06-26 18:20:30,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 18:20:30,625 INFO ]: Start accepts. Automaton has 48 states. Word has length 47 [2018-06-26 18:20:30,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:30,625 INFO ]: With dead ends: 74 [2018-06-26 18:20:30,625 INFO ]: Without dead ends: 74 [2018-06-26 18:20:30,625 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=520, Invalid=1832, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 18:20:30,625 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 18:20:30,627 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-26 18:20:30,627 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 18:20:30,627 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-06-26 18:20:30,627 INFO ]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 47 [2018-06-26 18:20:30,627 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:30,627 INFO ]: Abstraction has 74 states and 79 transitions. [2018-06-26 18:20:30,627 INFO ]: Interpolant automaton has 48 states. [2018-06-26 18:20:30,627 INFO ]: Start isEmpty. Operand 74 states and 79 transitions. [2018-06-26 18:20:30,628 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-26 18:20:30,628 INFO ]: Found error trace [2018-06-26 18:20:30,628 INFO ]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:30,628 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:30,628 INFO ]: Analyzing trace with hash -1007441480, now seen corresponding path program 37 times [2018-06-26 18:20:30,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:30,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:30,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:30,628 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:30,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:30,642 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:31,235 INFO ]: Checked inductivity of 382 backedges. 172 proven. 209 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:31,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:31,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:31,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:31,312 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:31,316 INFO ]: Computing forward predicates... [2018-06-26 18:20:31,385 INFO ]: Checked inductivity of 382 backedges. 191 proven. 190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:31,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:31,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-06-26 18:20:31,404 INFO ]: Interpolant automaton has 46 states [2018-06-26 18:20:31,404 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 18:20:31,404 INFO ]: CoverageRelationStatistics Valid=470, Invalid=1600, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 18:20:31,404 INFO ]: Start difference. First operand 74 states and 79 transitions. Second operand 46 states. [2018-06-26 18:20:32,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:32,026 INFO ]: Finished difference Result 118 states and 125 transitions. [2018-06-26 18:20:32,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-26 18:20:32,026 INFO ]: Start accepts. Automaton has 46 states. Word has length 48 [2018-06-26 18:20:32,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:32,027 INFO ]: With dead ends: 118 [2018-06-26 18:20:32,027 INFO ]: Without dead ends: 75 [2018-06-26 18:20:32,027 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=950, Invalid=3880, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 18:20:32,027 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 18:20:32,029 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-26 18:20:32,029 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 18:20:32,030 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-06-26 18:20:32,030 INFO ]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 48 [2018-06-26 18:20:32,030 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:32,030 INFO ]: Abstraction has 75 states and 80 transitions. [2018-06-26 18:20:32,030 INFO ]: Interpolant automaton has 46 states. [2018-06-26 18:20:32,030 INFO ]: Start isEmpty. Operand 75 states and 80 transitions. [2018-06-26 18:20:32,031 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-26 18:20:32,031 INFO ]: Found error trace [2018-06-26 18:20:32,031 INFO ]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:32,031 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:32,031 INFO ]: Analyzing trace with hash -1643729621, now seen corresponding path program 38 times [2018-06-26 18:20:32,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:32,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:32,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:32,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:32,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:32,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:32,776 INFO ]: Checked inductivity of 402 backedges. 154 proven. 247 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:32,776 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:32,776 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:32,781 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:20:32,841 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:20:32,841 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:32,844 INFO ]: Computing forward predicates... [2018-06-26 18:20:32,993 INFO ]: Checked inductivity of 402 backedges. 211 proven. 190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:33,013 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:33,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 50 [2018-06-26 18:20:33,013 INFO ]: Interpolant automaton has 50 states [2018-06-26 18:20:33,013 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-26 18:20:33,013 INFO ]: CoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 18:20:33,013 INFO ]: Start difference. First operand 75 states and 80 transitions. Second operand 50 states. [2018-06-26 18:20:33,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:33,284 INFO ]: Finished difference Result 77 states and 82 transitions. [2018-06-26 18:20:33,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 18:20:33,284 INFO ]: Start accepts. Automaton has 50 states. Word has length 49 [2018-06-26 18:20:33,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:33,285 INFO ]: With dead ends: 77 [2018-06-26 18:20:33,285 INFO ]: Without dead ends: 77 [2018-06-26 18:20:33,285 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=566, Invalid=1984, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 18:20:33,285 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-26 18:20:33,287 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-06-26 18:20:33,287 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 18:20:33,287 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-06-26 18:20:33,287 INFO ]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 49 [2018-06-26 18:20:33,287 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:33,288 INFO ]: Abstraction has 77 states and 82 transitions. [2018-06-26 18:20:33,288 INFO ]: Interpolant automaton has 50 states. [2018-06-26 18:20:33,288 INFO ]: Start isEmpty. Operand 77 states and 82 transitions. [2018-06-26 18:20:33,288 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 18:20:33,288 INFO ]: Found error trace [2018-06-26 18:20:33,288 INFO ]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:33,288 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:33,288 INFO ]: Analyzing trace with hash 583338844, now seen corresponding path program 39 times [2018-06-26 18:20:33,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:33,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:33,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:33,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:33,302 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:33,997 INFO ]: Checked inductivity of 422 backedges. 191 proven. 230 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:33,997 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:33,997 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:34,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:20:34,088 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 18:20:34,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:34,092 INFO ]: Computing forward predicates... [2018-06-26 18:20:34,756 INFO ]: Checked inductivity of 422 backedges. 211 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:34,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:34,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 70 [2018-06-26 18:20:34,775 INFO ]: Interpolant automaton has 70 states [2018-06-26 18:20:34,776 INFO ]: Constructing interpolant automaton starting with 70 interpolants. [2018-06-26 18:20:34,776 INFO ]: CoverageRelationStatistics Valid=768, Invalid=4062, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 18:20:34,776 INFO ]: Start difference. First operand 77 states and 82 transitions. Second operand 70 states. [2018-06-26 18:20:36,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:36,934 INFO ]: Finished difference Result 123 states and 130 transitions. [2018-06-26 18:20:36,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-26 18:20:36,934 INFO ]: Start accepts. Automaton has 70 states. Word has length 50 [2018-06-26 18:20:36,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:36,935 INFO ]: With dead ends: 123 [2018-06-26 18:20:36,935 INFO ]: Without dead ends: 78 [2018-06-26 18:20:36,935 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2060, Invalid=11512, Unknown=0, NotChecked=0, Total=13572 [2018-06-26 18:20:36,935 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-26 18:20:36,937 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-06-26 18:20:36,937 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-26 18:20:36,938 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-06-26 18:20:36,938 INFO ]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 50 [2018-06-26 18:20:36,938 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:36,938 INFO ]: Abstraction has 78 states and 83 transitions. [2018-06-26 18:20:36,938 INFO ]: Interpolant automaton has 70 states. [2018-06-26 18:20:36,938 INFO ]: Start isEmpty. Operand 78 states and 83 transitions. [2018-06-26 18:20:36,938 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-26 18:20:36,938 INFO ]: Found error trace [2018-06-26 18:20:36,938 INFO ]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:36,938 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:36,938 INFO ]: Analyzing trace with hash -1004208625, now seen corresponding path program 40 times [2018-06-26 18:20:36,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:36,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:36,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:36,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:36,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:36,952 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:37,992 INFO ]: Checked inductivity of 443 backedges. 172 proven. 270 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:37,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:37,992 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:37,998 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:20:38,061 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:20:38,061 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:38,066 INFO ]: Computing forward predicates... [2018-06-26 18:20:38,209 INFO ]: Checked inductivity of 443 backedges. 232 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:38,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:38,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 52 [2018-06-26 18:20:38,228 INFO ]: Interpolant automaton has 52 states [2018-06-26 18:20:38,228 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 18:20:38,228 INFO ]: CoverageRelationStatistics Valid=587, Invalid=2065, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 18:20:38,228 INFO ]: Start difference. First operand 78 states and 83 transitions. Second operand 52 states. [2018-06-26 18:20:38,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:38,416 INFO ]: Finished difference Result 80 states and 85 transitions. [2018-06-26 18:20:38,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 18:20:38,417 INFO ]: Start accepts. Automaton has 52 states. Word has length 51 [2018-06-26 18:20:38,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:38,417 INFO ]: With dead ends: 80 [2018-06-26 18:20:38,417 INFO ]: Without dead ends: 80 [2018-06-26 18:20:38,418 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=614, Invalid=2142, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 18:20:38,418 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-26 18:20:38,420 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-06-26 18:20:38,420 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:20:38,421 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-06-26 18:20:38,421 INFO ]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 51 [2018-06-26 18:20:38,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:38,421 INFO ]: Abstraction has 80 states and 85 transitions. [2018-06-26 18:20:38,421 INFO ]: Interpolant automaton has 52 states. [2018-06-26 18:20:38,421 INFO ]: Start isEmpty. Operand 80 states and 85 transitions. [2018-06-26 18:20:38,421 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 18:20:38,421 INFO ]: Found error trace [2018-06-26 18:20:38,421 INFO ]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:38,422 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:38,422 INFO ]: Analyzing trace with hash -1066346760, now seen corresponding path program 41 times [2018-06-26 18:20:38,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:38,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:38,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:38,422 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:38,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:38,434 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:39,780 INFO ]: Checked inductivity of 464 backedges. 211 proven. 252 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:39,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:39,780 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:39,786 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:20:39,871 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 18:20:39,872 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:39,876 INFO ]: Computing forward predicates... [2018-06-26 18:20:40,595 INFO ]: Checked inductivity of 464 backedges. 232 proven. 231 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:40,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:40,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 73 [2018-06-26 18:20:40,614 INFO ]: Interpolant automaton has 73 states [2018-06-26 18:20:40,615 INFO ]: Constructing interpolant automaton starting with 73 interpolants. [2018-06-26 18:20:40,615 INFO ]: CoverageRelationStatistics Valid=837, Invalid=4419, Unknown=0, NotChecked=0, Total=5256 [2018-06-26 18:20:40,615 INFO ]: Start difference. First operand 80 states and 85 transitions. Second operand 73 states. [2018-06-26 18:20:42,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:42,236 INFO ]: Finished difference Result 128 states and 135 transitions. [2018-06-26 18:20:42,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-06-26 18:20:42,237 INFO ]: Start accepts. Automaton has 73 states. Word has length 52 [2018-06-26 18:20:42,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:42,237 INFO ]: With dead ends: 128 [2018-06-26 18:20:42,237 INFO ]: Without dead ends: 81 [2018-06-26 18:20:42,237 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3226 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2244, Invalid=12518, Unknown=0, NotChecked=0, Total=14762 [2018-06-26 18:20:42,238 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-26 18:20:42,239 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-26 18:20:42,239 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-26 18:20:42,240 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-06-26 18:20:42,240 INFO ]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 52 [2018-06-26 18:20:42,240 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:42,240 INFO ]: Abstraction has 81 states and 86 transitions. [2018-06-26 18:20:42,240 INFO ]: Interpolant automaton has 73 states. [2018-06-26 18:20:42,240 INFO ]: Start isEmpty. Operand 81 states and 86 transitions. [2018-06-26 18:20:42,240 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-26 18:20:42,240 INFO ]: Found error trace [2018-06-26 18:20:42,240 INFO ]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:42,241 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:42,241 INFO ]: Analyzing trace with hash -1986074389, now seen corresponding path program 42 times [2018-06-26 18:20:42,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:42,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:42,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:42,241 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:20:42,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:42,256 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:43,139 INFO ]: Checked inductivity of 486 backedges. 232 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:43,139 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:43,139 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:43,145 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-06-26 18:20:43,246 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 18:20:43,247 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:43,251 INFO ]: Computing forward predicates... [2018-06-26 18:20:43,276 INFO ]: Timeout while computing interpolants [2018-06-26 18:20:43,477 WARN ]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:43,477 WARN ]: Verification canceled [2018-06-26 18:20:43,479 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:20:43,480 WARN ]: Timeout [2018-06-26 18:20:43,481 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:20:43 BasicIcfg [2018-06-26 18:20:43,481 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:20:43,481 INFO ]: Toolchain (without parser) took 58170.39 ms. Allocated memory was 306.2 MB in the beginning and 875.0 MB in the end (delta: 568.9 MB). Free memory was 260.7 MB in the beginning and 597.6 MB in the end (delta: -336.9 MB). Peak memory consumption was 232.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,482 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:20:43,482 INFO ]: ChcToBoogie took 50.94 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,483 INFO ]: Boogie Preprocessor took 41.69 ms. Allocated memory is still 306.2 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,483 INFO ]: RCFGBuilder took 210.29 ms. Allocated memory is still 306.2 MB. Free memory was 256.7 MB in the beginning and 248.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,483 INFO ]: BlockEncodingV2 took 117.90 ms. Allocated memory is still 306.2 MB. Free memory was 248.7 MB in the beginning and 244.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,487 INFO ]: TraceAbstraction took 57741.04 ms. Allocated memory was 306.2 MB in the beginning and 875.0 MB in the end (delta: 568.9 MB). Free memory was 244.7 MB in the beginning and 597.6 MB in the end (delta: -352.8 MB). Peak memory consumption was 216.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:20:43,489 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 21 edges - StatisticsResult: Encoded RCFG 10 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.94 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.69 ms. Allocated memory is still 306.2 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 210.29 ms. Allocated memory is still 306.2 MB. Free memory was 256.7 MB in the beginning and 248.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 117.90 ms. Allocated memory is still 306.2 MB. Free memory was 248.7 MB in the beginning and 244.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57741.04 ms. Allocated memory was 306.2 MB in the beginning and 875.0 MB in the end (delta: 568.9 MB). Free memory was 244.7 MB in the beginning and 597.6 MB in the end (delta: -352.8 MB). Peak memory consumption was 216.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 22, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 57.6s OverallTime, 45 OverallIterations, 22 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 360 SDtfs, 405 SDslu, 3494 SDs, 0 SdLazy, 15830 SolverSat, 1114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3032 GetRequests, 1059 SyntacticMatches, 21 SemanticMatches, 1952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26224 ImplicationChecksByTransitivity, 39.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=44, 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, 44 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 2661 NumberOfCodeBlocks, 2661 NumberOfCodeBlocksAsserted, 230 NumberOfCheckSat, 2575 ConstructedInterpolants, 0 QuantifiedInterpolants, 329294 SizeOfPredicates, 168 NumberOfNonLiveVariables, 15477 ConjunctsInSsa, 2121 ConjunctsInUnsatCore, 86 InterpolantComputations, 3 PerfectInterpolantSequences, 6601/13876 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/enc-zip_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-20-43-505.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-20-43-505.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-20-43-505.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-20-43-505.csv Completed graceful shutdown