java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:46:56,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:46:56,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:46:56,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:46:56,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:46:56,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:46:56,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:46:56,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:46:56,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:46:56,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:46:56,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:46:56,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:46:56,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:46:56,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:46:56,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:46:56,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:46:56,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:46:56,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:46:56,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:46:56,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:46:56,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:46:56,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:46:56,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:46:56,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:46:56,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:46:56,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:46:56,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:46:56,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:46:56,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:46:56,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:46:56,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:46:56,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:46:56,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:46:56,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:46:56,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:46:56,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:46:56,932 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:46:56,946 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:46:56,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:46:56,947 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:46:56,947 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:46:56,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:46:56,948 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:46:56,948 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:46:56,949 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:46:56,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:46:56,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:46:56,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:46:56,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:46:56,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:46:56,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:46:56,950 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:46:56,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:46:56,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:46:56,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:46:56,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:46:56,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:46:56,951 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:46:56,953 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:46:56,953 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:46:57,001 INFO ]: Repository-Root is: /tmp [2018-06-26 17:46:57,017 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:46:57,023 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:46:57,025 INFO ]: Initializing SmtParser... [2018-06-26 17:46:57,025 INFO ]: SmtParser initialized [2018-06-26 17:46:57,026 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 [2018-06-26 17:46:57,027 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 17:46:57,112 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 unknown [2018-06-26 17:46:57,295 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 [2018-06-26 17:46:57,300 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:46:57,306 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:46:57,307 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:46:57,307 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:46:57,307 INFO ]: ChcToBoogie initialized [2018-06-26 17:46:57,310 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,369 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57 Unit [2018-06-26 17:46:57,369 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:46:57,373 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:46:57,373 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:46:57,373 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:46:57,394 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,394 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,402 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,402 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,406 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,407 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,408 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,410 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:46:57,411 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:46:57,411 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:46:57,411 INFO ]: RCFGBuilder initialized [2018-06-26 17:46:57,412 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (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 17:46:57,428 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:46:57,428 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:46:57,428 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:46:57,429 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:46:57,429 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:46:57,429 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 17:46:57,756 INFO ]: Using library mode [2018-06-26 17:46:57,756 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:46:57 BoogieIcfgContainer [2018-06-26 17:46:57,756 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:46:57,757 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:46:57,757 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:46:57,758 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:46:57,767 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:46:57" (1/1) ... [2018-06-26 17:46:57,788 INFO ]: Initial Icfg 11 locations, 14 edges [2018-06-26 17:46:57,790 INFO ]: Using Remove infeasible edges [2018-06-26 17:46:57,792 INFO ]: Using Maximize final states [2018-06-26 17:46:57,793 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:46:57,793 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:46:57,794 INFO ]: Using Remove sink states [2018-06-26 17:46:57,795 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:46:57,795 INFO ]: Using Use SBE [2018-06-26 17:46:57,827 INFO ]: SBE split 3 edges [2018-06-26 17:46:57,833 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:46:57,836 INFO ]: 0 new accepting states [2018-06-26 17:46:57,858 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 17:46:57,860 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:46:57,863 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:46:57,863 INFO ]: 0 new accepting states [2018-06-26 17:46:57,863 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:46:57,863 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:46:57,864 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-26 17:46:57,864 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:46:57 BasicIcfg [2018-06-26 17:46:57,864 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:46:57,865 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:46:57,865 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:46:57,868 INFO ]: TraceAbstraction initialized [2018-06-26 17:46:57,868 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:46:57" (1/4) ... [2018-06-26 17:46:57,869 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782ec4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:46:57, skipping insertion in model container [2018-06-26 17:46:57,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:46:57" (2/4) ... [2018-06-26 17:46:57,869 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782ec4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:46:57, skipping insertion in model container [2018-06-26 17:46:57,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:46:57" (3/4) ... [2018-06-26 17:46:57,870 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782ec4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:46:57, skipping insertion in model container [2018-06-26 17:46:57,870 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:46:57" (4/4) ... [2018-06-26 17:46:57,871 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:46:57,880 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:46:57,893 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:46:57,956 INFO ]: Using default assertion order modulation [2018-06-26 17:46:57,957 INFO ]: Interprodecural is true [2018-06-26 17:46:57,957 INFO ]: Hoare is false [2018-06-26 17:46:57,957 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:46:57,957 INFO ]: Backedges is TWOTRACK [2018-06-26 17:46:57,957 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:46:57,957 INFO ]: Difference is false [2018-06-26 17:46:57,957 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:46:57,957 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:46:57,969 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 17:46:57,978 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:46:57,978 INFO ]: Found error trace [2018-06-26 17:46:57,979 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:46:57,979 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:46:57,984 INFO ]: Analyzing trace with hash 1221392010, now seen corresponding path program 1 times [2018-06-26 17:46:57,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:46:57,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:46:58,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:58,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:46:58,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:58,070 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:46:58,218 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:46:58,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:46:58,220 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:46:58,221 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:46:58,231 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:46:58,232 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:46:58,234 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-26 17:46:58,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:46:58,540 INFO ]: Finished difference Result 11 states and 20 transitions. [2018-06-26 17:46:58,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:46:58,543 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:46:58,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:46:58,554 INFO ]: With dead ends: 11 [2018-06-26 17:46:58,555 INFO ]: Without dead ends: 11 [2018-06-26 17:46:58,556 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:46:58,572 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:46:58,584 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 17:46:58,585 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:46:58,586 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-26 17:46:58,587 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-06-26 17:46:58,587 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:46:58,587 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-26 17:46:58,587 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:46:58,587 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-26 17:46:58,588 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:46:58,588 INFO ]: Found error trace [2018-06-26 17:46:58,588 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:46:58,588 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:46:58,588 INFO ]: Analyzing trace with hash 1213281659, now seen corresponding path program 1 times [2018-06-26 17:46:58,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:46:58,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:46:58,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:58,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:46:58,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:58,615 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:46:58,910 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:46:58,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:46:58,910 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 17:46:58,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:46:58,945 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:46:58,952 INFO ]: Computing forward predicates... [2018-06-26 17:46:59,032 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:46:59,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:46:59,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 17:46:59,069 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:46:59,069 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:46:59,069 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:46:59,069 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-06-26 17:46:59,555 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-26 17:46:59,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:46:59,602 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-26 17:46:59,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:46:59,603 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 17:46:59,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:46:59,603 INFO ]: With dead ends: 16 [2018-06-26 17:46:59,603 INFO ]: Without dead ends: 16 [2018-06-26 17:46:59,604 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:46:59,604 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:46:59,608 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-06-26 17:46:59,608 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:46:59,608 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-26 17:46:59,608 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 8 [2018-06-26 17:46:59,608 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:46:59,609 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-26 17:46:59,609 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:46:59,609 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-26 17:46:59,609 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:46:59,609 INFO ]: Found error trace [2018-06-26 17:46:59,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:46:59,609 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:46:59,609 INFO ]: Analyzing trace with hash 1299169112, now seen corresponding path program 1 times [2018-06-26 17:46:59,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:46:59,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:46:59,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:59,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:46:59,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:46:59,624 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:46:59,678 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:46:59,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:46:59,678 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 17:46:59,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:46:59,711 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:46:59,713 INFO ]: Computing forward predicates... [2018-06-26 17:46:59,981 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:47:00,011 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:47:00,011 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-26 17:47:00,012 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:47:00,012 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:47:00,012 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:47:00,012 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 7 states. [2018-06-26 17:47:00,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:00,419 INFO ]: Finished difference Result 16 states and 28 transitions. [2018-06-26 17:47:00,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:47:00,419 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 17:47:00,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:00,419 INFO ]: With dead ends: 16 [2018-06-26 17:47:00,419 INFO ]: Without dead ends: 11 [2018-06-26 17:47:00,420 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:47:00,420 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:47:00,421 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:47:00,421 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:47:00,422 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-26 17:47:00,422 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-26 17:47:00,422 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:00,422 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-26 17:47:00,422 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:47:00,422 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-26 17:47:00,422 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:47:00,422 INFO ]: Found error trace [2018-06-26 17:47:00,422 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:47:00,422 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:00,422 INFO ]: Analyzing trace with hash 1156023357, now seen corresponding path program 1 times [2018-06-26 17:47:00,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:00,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:00,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:00,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:00,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:00,434 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:00,511 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:00,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:00,511 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 17:47:00,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:00,533 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:00,535 INFO ]: Computing forward predicates... [2018-06-26 17:47:00,605 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:00,626 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:47:00,626 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-26 17:47:00,626 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:47:00,626 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:47:00,626 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:47:00,626 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 7 states. [2018-06-26 17:47:00,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:00,709 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-26 17:47:00,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:47:00,710 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 17:47:00,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:00,710 INFO ]: With dead ends: 17 [2018-06-26 17:47:00,710 INFO ]: Without dead ends: 11 [2018-06-26 17:47:00,710 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:47:00,710 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:47:00,711 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:47:00,712 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:47:00,712 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-26 17:47:00,712 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-26 17:47:00,712 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:00,712 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-26 17:47:00,712 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:47:00,712 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-26 17:47:00,713 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:47:00,713 INFO ]: Found error trace [2018-06-26 17:47:00,713 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-26 17:47:00,713 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:00,713 INFO ]: Analyzing trace with hash 2009168940, now seen corresponding path program 2 times [2018-06-26 17:47:00,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:00,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:00,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:00,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:00,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:00,735 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:00,967 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:00,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:00,967 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 17:47:00,973 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:47:00,997 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:47:00,997 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:01,000 INFO ]: Computing forward predicates... [2018-06-26 17:47:01,082 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:01,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:01,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 17:47:01,104 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:47:01,104 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:47:01,104 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:47:01,104 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 9 states. [2018-06-26 17:47:01,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:01,449 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-26 17:47:01,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:47:01,450 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 17:47:01,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:01,450 INFO ]: With dead ends: 14 [2018-06-26 17:47:01,450 INFO ]: Without dead ends: 14 [2018-06-26 17:47:01,450 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:47:01,450 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:47:01,451 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 17:47:01,451 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:47:01,452 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 17:47:01,452 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-26 17:47:01,452 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:01,452 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 17:47:01,452 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:47:01,452 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 17:47:01,452 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:47:01,452 INFO ]: Found error trace [2018-06-26 17:47:01,452 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-26 17:47:01,452 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:01,452 INFO ]: Analyzing trace with hash -1942300003, now seen corresponding path program 3 times [2018-06-26 17:47:01,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:01,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:01,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:01,453 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:01,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:01,468 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:01,680 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:01,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:01,680 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 17:47:01,689 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:47:01,733 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:47:01,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:01,737 INFO ]: Computing forward predicates... [2018-06-26 17:47:01,777 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:01,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:01,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 17:47:01,805 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:47:01,805 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:47:01,805 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:47:01,805 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 11 states. [2018-06-26 17:47:02,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:02,068 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-26 17:47:02,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:47:02,068 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 17:47:02,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:02,069 INFO ]: With dead ends: 16 [2018-06-26 17:47:02,069 INFO ]: Without dead ends: 16 [2018-06-26 17:47:02,069 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:47:02,069 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:47:02,071 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-26 17:47:02,071 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:47:02,071 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-26 17:47:02,071 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 12 [2018-06-26 17:47:02,071 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:02,071 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-26 17:47:02,071 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:47:02,071 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-26 17:47:02,072 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:47:02,072 INFO ]: Found error trace [2018-06-26 17:47:02,072 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-06-26 17:47:02,072 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:02,072 INFO ]: Analyzing trace with hash 1742102734, now seen corresponding path program 4 times [2018-06-26 17:47:02,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:02,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:02,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:02,073 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:02,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:02,089 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:02,374 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:02,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:02,374 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 17:47:02,382 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:47:02,412 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:47:02,412 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:02,417 INFO ]: Computing forward predicates... [2018-06-26 17:47:02,514 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:02,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:02,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 17:47:02,535 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:47:02,535 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:47:02,535 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:47:02,535 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. [2018-06-26 17:47:02,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:02,974 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-26 17:47:02,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:47:02,975 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 17:47:02,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:02,975 INFO ]: With dead ends: 18 [2018-06-26 17:47:02,975 INFO ]: Without dead ends: 18 [2018-06-26 17:47:02,975 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:47:02,976 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:47:02,977 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-26 17:47:02,977 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:47:02,978 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-26 17:47:02,978 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 14 [2018-06-26 17:47:02,978 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:02,978 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-26 17:47:02,978 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:47:02,978 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-26 17:47:02,978 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:47:02,978 INFO ]: Found error trace [2018-06-26 17:47:02,978 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-06-26 17:47:02,978 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:02,978 INFO ]: Analyzing trace with hash -894886209, now seen corresponding path program 5 times [2018-06-26 17:47:02,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:02,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:02,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:02,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:02,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:02,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:03,444 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:03,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:03,444 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 17:47:03,452 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:47:03,480 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 17:47:03,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:03,484 INFO ]: Computing forward predicates... [2018-06-26 17:47:03,572 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:03,592 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:03,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-26 17:47:03,592 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:47:03,592 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:47:03,592 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:47:03,592 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 15 states. [2018-06-26 17:47:04,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:04,124 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-26 17:47:04,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:47:04,125 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-26 17:47:04,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:04,125 INFO ]: With dead ends: 20 [2018-06-26 17:47:04,125 INFO ]: Without dead ends: 20 [2018-06-26 17:47:04,126 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:47:04,126 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:47:04,127 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-26 17:47:04,127 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:47:04,128 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-26 17:47:04,128 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 16 [2018-06-26 17:47:04,128 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:04,128 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-26 17:47:04,128 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:47:04,128 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-26 17:47:04,128 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:47:04,128 INFO ]: Found error trace [2018-06-26 17:47:04,128 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-06-26 17:47:04,129 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:04,129 INFO ]: Analyzing trace with hash -1010555792, now seen corresponding path program 6 times [2018-06-26 17:47:04,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:04,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:04,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:04,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:04,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:04,144 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:04,607 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:04,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:04,607 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 17:47:04,613 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:47:04,661 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:47:04,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:04,667 INFO ]: Computing forward predicates... [2018-06-26 17:47:04,789 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:04,808 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:04,808 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 17:47:04,809 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:47:04,809 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:47:04,809 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:47:04,809 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 17 states. [2018-06-26 17:47:05,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:05,370 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-26 17:47:05,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:47:05,370 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-26 17:47:05,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:05,371 INFO ]: With dead ends: 22 [2018-06-26 17:47:05,371 INFO ]: Without dead ends: 22 [2018-06-26 17:47:05,372 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:47:05,372 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:47:05,373 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 17:47:05,373 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:47:05,374 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-26 17:47:05,374 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 18 [2018-06-26 17:47:05,374 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:05,374 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-26 17:47:05,374 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:47:05,374 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-26 17:47:05,375 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:47:05,375 INFO ]: Found error trace [2018-06-26 17:47:05,375 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-06-26 17:47:05,375 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:05,375 INFO ]: Analyzing trace with hash -499875359, now seen corresponding path program 7 times [2018-06-26 17:47:05,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:05,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:05,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:05,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:05,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:05,395 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:05,747 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:05,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:05,747 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 17:47:05,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:05,787 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:05,792 INFO ]: Computing forward predicates... [2018-06-26 17:47:05,906 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:05,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:05,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-26 17:47:05,932 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:47:05,932 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:47:05,932 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:47:05,932 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 19 states. [2018-06-26 17:47:06,419 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-26 17:47:06,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:06,594 INFO ]: Finished difference Result 24 states and 34 transitions. [2018-06-26 17:47:06,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:47:06,595 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-26 17:47:06,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:06,595 INFO ]: With dead ends: 24 [2018-06-26 17:47:06,595 INFO ]: Without dead ends: 24 [2018-06-26 17:47:06,596 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:47:06,596 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:47:06,598 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-26 17:47:06,598 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:47:06,598 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-26 17:47:06,598 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-26 17:47:06,599 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:06,599 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-26 17:47:06,599 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:47:06,599 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-26 17:47:06,599 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:47:06,599 INFO ]: Found error trace [2018-06-26 17:47:06,599 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-06-26 17:47:06,599 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:06,599 INFO ]: Analyzing trace with hash 637749010, now seen corresponding path program 8 times [2018-06-26 17:47:06,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:06,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:06,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:06,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:06,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:06,625 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:06,976 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:06,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:06,976 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 17:47:06,982 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:47:07,015 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:47:07,015 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:07,021 INFO ]: Computing forward predicates... [2018-06-26 17:47:07,093 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:07,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:07,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-26 17:47:07,148 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:47:07,148 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:47:07,148 INFO ]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:47:07,148 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 21 states. [2018-06-26 17:47:08,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:08,050 INFO ]: Finished difference Result 26 states and 37 transitions. [2018-06-26 17:47:08,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:47:08,050 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-26 17:47:08,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:08,051 INFO ]: With dead ends: 26 [2018-06-26 17:47:08,051 INFO ]: Without dead ends: 26 [2018-06-26 17:47:08,051 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:47:08,051 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:47:08,053 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-26 17:47:08,053 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:47:08,054 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-26 17:47:08,054 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 22 [2018-06-26 17:47:08,054 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:08,054 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-26 17:47:08,054 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:47:08,054 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-26 17:47:08,055 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:47:08,055 INFO ]: Found error trace [2018-06-26 17:47:08,055 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-06-26 17:47:08,055 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:08,055 INFO ]: Analyzing trace with hash -1321892861, now seen corresponding path program 9 times [2018-06-26 17:47:08,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:08,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:08,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:08,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:08,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:08,078 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:08,565 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:08,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:08,566 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 17:47:08,572 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:47:08,613 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-26 17:47:08,613 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:08,620 INFO ]: Computing forward predicates... [2018-06-26 17:47:08,907 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:08,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:08,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-26 17:47:08,926 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:47:08,926 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:47:08,926 INFO ]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:47:08,926 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 23 states. [2018-06-26 17:47:09,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:09,781 INFO ]: Finished difference Result 28 states and 40 transitions. [2018-06-26 17:47:09,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:47:09,781 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-26 17:47:09,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:09,782 INFO ]: With dead ends: 28 [2018-06-26 17:47:09,782 INFO ]: Without dead ends: 28 [2018-06-26 17:47:09,782 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:47:09,782 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:47:09,784 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-06-26 17:47:09,784 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:47:09,785 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2018-06-26 17:47:09,785 INFO ]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 24 [2018-06-26 17:47:09,785 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:09,785 INFO ]: Abstraction has 27 states and 38 transitions. [2018-06-26 17:47:09,785 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:47:09,785 INFO ]: Start isEmpty. Operand 27 states and 38 transitions. [2018-06-26 17:47:09,786 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:47:09,786 INFO ]: Found error trace [2018-06-26 17:47:09,786 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-06-26 17:47:09,786 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:09,786 INFO ]: Analyzing trace with hash 952912052, now seen corresponding path program 10 times [2018-06-26 17:47:09,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:09,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:09,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:09,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:09,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:09,804 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:10,340 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:10,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:10,340 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 17:47:10,347 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:47:10,384 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:47:10,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:10,389 INFO ]: Computing forward predicates... [2018-06-26 17:47:10,477 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:10,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:10,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-26 17:47:10,506 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:47:10,506 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:47:10,506 INFO ]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:47:10,506 INFO ]: Start difference. First operand 27 states and 38 transitions. Second operand 25 states. [2018-06-26 17:47:11,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:11,513 INFO ]: Finished difference Result 30 states and 43 transitions. [2018-06-26 17:47:11,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:47:11,515 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 17:47:11,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:11,515 INFO ]: With dead ends: 30 [2018-06-26 17:47:11,515 INFO ]: Without dead ends: 30 [2018-06-26 17:47:11,516 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:47:11,516 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:47:11,518 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-06-26 17:47:11,518 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:47:11,519 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-06-26 17:47:11,519 INFO ]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 26 [2018-06-26 17:47:11,519 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:11,519 INFO ]: Abstraction has 29 states and 41 transitions. [2018-06-26 17:47:11,519 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:47:11,519 INFO ]: Start isEmpty. Operand 29 states and 41 transitions. [2018-06-26 17:47:11,520 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:47:11,520 INFO ]: Found error trace [2018-06-26 17:47:11,520 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-06-26 17:47:11,520 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:11,520 INFO ]: Analyzing trace with hash 902079781, now seen corresponding path program 11 times [2018-06-26 17:47:11,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:11,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:11,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:11,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:11,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:11,543 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:12,364 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:12,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:12,364 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 17:47:12,371 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:47:12,421 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-26 17:47:12,421 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:12,429 INFO ]: Computing forward predicates... [2018-06-26 17:47:12,889 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:12,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:12,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-26 17:47:12,908 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:47:12,909 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:47:12,909 INFO ]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:47:12,909 INFO ]: Start difference. First operand 29 states and 41 transitions. Second operand 27 states. [2018-06-26 17:47:13,829 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-26 17:47:14,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:14,568 INFO ]: Finished difference Result 32 states and 46 transitions. [2018-06-26 17:47:14,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:47:14,568 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-26 17:47:14,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:14,568 INFO ]: With dead ends: 32 [2018-06-26 17:47:14,568 INFO ]: Without dead ends: 32 [2018-06-26 17:47:14,569 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 17:47:14,569 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:47:14,572 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-06-26 17:47:14,572 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:47:14,573 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-06-26 17:47:14,573 INFO ]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 28 [2018-06-26 17:47:14,573 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:14,573 INFO ]: Abstraction has 31 states and 44 transitions. [2018-06-26 17:47:14,573 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:47:14,573 INFO ]: Start isEmpty. Operand 31 states and 44 transitions. [2018-06-26 17:47:14,574 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:47:14,574 INFO ]: Found error trace [2018-06-26 17:47:14,574 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-06-26 17:47:14,574 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:14,574 INFO ]: Analyzing trace with hash -703092394, now seen corresponding path program 12 times [2018-06-26 17:47:14,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:14,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:14,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:14,574 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:14,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:14,601 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:15,291 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:15,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:15,291 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 17:47:15,297 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:47:15,357 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 17:47:15,357 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:15,363 INFO ]: Computing forward predicates... [2018-06-26 17:47:15,417 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:15,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:15,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-26 17:47:15,436 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:47:15,436 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:47:15,436 INFO ]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:47:15,436 INFO ]: Start difference. First operand 31 states and 44 transitions. Second operand 29 states. [2018-06-26 17:47:16,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:16,791 INFO ]: Finished difference Result 34 states and 49 transitions. [2018-06-26 17:47:16,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:47:16,792 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-26 17:47:16,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:16,792 INFO ]: With dead ends: 34 [2018-06-26 17:47:16,792 INFO ]: Without dead ends: 34 [2018-06-26 17:47:16,793 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=2669, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:47:16,793 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:47:16,795 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-06-26 17:47:16,796 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:47:16,803 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-06-26 17:47:16,803 INFO ]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 30 [2018-06-26 17:47:16,803 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:16,803 INFO ]: Abstraction has 33 states and 47 transitions. [2018-06-26 17:47:16,803 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:47:16,803 INFO ]: Start isEmpty. Operand 33 states and 47 transitions. [2018-06-26 17:47:16,804 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:47:16,804 INFO ]: Found error trace [2018-06-26 17:47:16,804 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-06-26 17:47:16,804 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:16,804 INFO ]: Analyzing trace with hash -1380293305, now seen corresponding path program 13 times [2018-06-26 17:47:16,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:16,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:16,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:16,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:16,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:16,825 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:18,339 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:18,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:18,340 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 17:47:18,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:18,391 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:18,398 INFO ]: Computing forward predicates... [2018-06-26 17:47:18,457 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:18,478 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:18,478 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-26 17:47:18,478 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:47:18,478 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:47:18,478 INFO ]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:47:18,478 INFO ]: Start difference. First operand 33 states and 47 transitions. Second operand 31 states. [2018-06-26 17:47:19,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:19,797 INFO ]: Finished difference Result 36 states and 52 transitions. [2018-06-26 17:47:19,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:47:19,798 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-26 17:47:19,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:19,799 INFO ]: With dead ends: 36 [2018-06-26 17:47:19,799 INFO ]: Without dead ends: 36 [2018-06-26 17:47:19,800 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=208, Invalid=3098, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:47:19,800 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:47:19,801 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-06-26 17:47:19,801 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:47:19,802 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-06-26 17:47:19,802 INFO ]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 32 [2018-06-26 17:47:19,802 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:19,802 INFO ]: Abstraction has 35 states and 50 transitions. [2018-06-26 17:47:19,802 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:47:19,802 INFO ]: Start isEmpty. Operand 35 states and 50 transitions. [2018-06-26 17:47:19,803 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:47:19,803 INFO ]: Found error trace [2018-06-26 17:47:19,803 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-06-26 17:47:19,803 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:19,803 INFO ]: Analyzing trace with hash 664660216, now seen corresponding path program 14 times [2018-06-26 17:47:19,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:19,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:19,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:19,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:19,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:19,823 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:20,718 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:20,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:20,718 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 17:47:20,724 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:47:20,775 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:47:20,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:20,785 INFO ]: Computing forward predicates... [2018-06-26 17:47:20,868 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:20,887 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:20,887 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-26 17:47:20,887 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:47:20,887 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:47:20,887 INFO ]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:47:20,888 INFO ]: Start difference. First operand 35 states and 50 transitions. Second operand 33 states. [2018-06-26 17:47:22,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:22,456 INFO ]: Finished difference Result 38 states and 55 transitions. [2018-06-26 17:47:22,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:47:22,459 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-26 17:47:22,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:22,459 INFO ]: With dead ends: 38 [2018-06-26 17:47:22,459 INFO ]: Without dead ends: 38 [2018-06-26 17:47:22,460 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=223, Invalid=3559, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 17:47:22,461 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:47:22,463 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-26 17:47:22,463 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:47:22,463 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-06-26 17:47:22,463 INFO ]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 34 [2018-06-26 17:47:22,464 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:22,464 INFO ]: Abstraction has 37 states and 53 transitions. [2018-06-26 17:47:22,464 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:47:22,464 INFO ]: Start isEmpty. Operand 37 states and 53 transitions. [2018-06-26 17:47:22,464 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:47:22,464 INFO ]: Found error trace [2018-06-26 17:47:22,464 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-06-26 17:47:22,464 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:22,464 INFO ]: Analyzing trace with hash -1230027671, now seen corresponding path program 15 times [2018-06-26 17:47:22,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:22,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:22,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:22,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:22,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:22,489 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:23,530 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:23,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:23,530 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 17:47:23,537 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:47:23,681 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-26 17:47:23,681 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:23,688 INFO ]: Computing forward predicates... [2018-06-26 17:47:23,752 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:23,771 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:23,771 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-26 17:47:23,771 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:47:23,771 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:47:23,771 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:47:23,772 INFO ]: Start difference. First operand 37 states and 53 transitions. Second operand 35 states. [2018-06-26 17:47:25,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:25,549 INFO ]: Finished difference Result 40 states and 58 transitions. [2018-06-26 17:47:25,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:47:25,551 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-26 17:47:25,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:25,551 INFO ]: With dead ends: 40 [2018-06-26 17:47:25,551 INFO ]: Without dead ends: 40 [2018-06-26 17:47:25,552 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=238, Invalid=4052, Unknown=0, NotChecked=0, Total=4290 [2018-06-26 17:47:25,552 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:47:25,554 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-06-26 17:47:25,554 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:47:25,558 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-06-26 17:47:25,558 INFO ]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 36 [2018-06-26 17:47:25,558 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:25,558 INFO ]: Abstraction has 39 states and 56 transitions. [2018-06-26 17:47:25,558 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:47:25,558 INFO ]: Start isEmpty. Operand 39 states and 56 transitions. [2018-06-26 17:47:25,559 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:47:25,559 INFO ]: Found error trace [2018-06-26 17:47:25,559 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-06-26 17:47:25,559 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:25,559 INFO ]: Analyzing trace with hash -958953574, now seen corresponding path program 16 times [2018-06-26 17:47:25,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:25,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:25,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:25,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:25,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:25,582 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:26,631 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:26,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:26,631 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 17:47:26,637 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:47:26,702 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:47:26,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:26,711 INFO ]: Computing forward predicates... [2018-06-26 17:47:26,940 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:26,959 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:26,959 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-26 17:47:26,959 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:47:26,959 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:47:26,959 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:47:26,960 INFO ]: Start difference. First operand 39 states and 56 transitions. Second operand 37 states. [2018-06-26 17:47:29,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:29,018 INFO ]: Finished difference Result 42 states and 61 transitions. [2018-06-26 17:47:29,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:47:29,018 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-26 17:47:29,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:29,019 INFO ]: With dead ends: 42 [2018-06-26 17:47:29,019 INFO ]: Without dead ends: 42 [2018-06-26 17:47:29,020 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=253, Invalid=4577, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 17:47:29,020 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 17:47:29,022 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-06-26 17:47:29,022 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:47:29,022 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-06-26 17:47:29,022 INFO ]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 38 [2018-06-26 17:47:29,023 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:29,023 INFO ]: Abstraction has 41 states and 59 transitions. [2018-06-26 17:47:29,023 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:47:29,023 INFO ]: Start isEmpty. Operand 41 states and 59 transitions. [2018-06-26 17:47:29,023 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:47:29,023 INFO ]: Found error trace [2018-06-26 17:47:29,023 INFO ]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-06-26 17:47:29,023 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:29,023 INFO ]: Analyzing trace with hash 1845215883, now seen corresponding path program 17 times [2018-06-26 17:47:29,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:29,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:29,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:29,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:29,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:29,045 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:30,431 INFO ]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:30,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:30,431 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 17:47:30,437 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:47:30,694 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-26 17:47:30,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:30,709 INFO ]: Computing forward predicates... [2018-06-26 17:47:30,793 INFO ]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:30,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:30,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-26 17:47:30,812 INFO ]: Interpolant automaton has 39 states [2018-06-26 17:47:30,813 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 17:47:30,813 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1389, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:47:30,813 INFO ]: Start difference. First operand 41 states and 59 transitions. Second operand 39 states. [2018-06-26 17:47:31,557 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-26 17:47:33,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:33,178 INFO ]: Finished difference Result 44 states and 64 transitions. [2018-06-26 17:47:33,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 17:47:33,178 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-26 17:47:33,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:33,178 INFO ]: With dead ends: 44 [2018-06-26 17:47:33,178 INFO ]: Without dead ends: 44 [2018-06-26 17:47:33,179 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=268, Invalid=5134, Unknown=0, NotChecked=0, Total=5402 [2018-06-26 17:47:33,179 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 17:47:33,182 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-06-26 17:47:33,182 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:47:33,183 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2018-06-26 17:47:33,183 INFO ]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 40 [2018-06-26 17:47:33,183 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:33,183 INFO ]: Abstraction has 43 states and 62 transitions. [2018-06-26 17:47:33,183 INFO ]: Interpolant automaton has 39 states. [2018-06-26 17:47:33,183 INFO ]: Start isEmpty. Operand 43 states and 62 transitions. [2018-06-26 17:47:33,183 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 17:47:33,183 INFO ]: Found error trace [2018-06-26 17:47:33,183 INFO ]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-06-26 17:47:33,183 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:33,184 INFO ]: Analyzing trace with hash -587397828, now seen corresponding path program 18 times [2018-06-26 17:47:33,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:33,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:33,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:33,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:33,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:33,207 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:34,237 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:34,237 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:34,237 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 17:47:34,243 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:47:34,355 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-26 17:47:34,355 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:34,368 INFO ]: Computing forward predicates... [2018-06-26 17:47:35,462 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:35,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:35,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-26 17:47:35,493 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:47:35,494 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:47:35,494 INFO ]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:47:35,494 INFO ]: Start difference. First operand 43 states and 62 transitions. Second operand 41 states. [2018-06-26 17:47:38,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:38,099 INFO ]: Finished difference Result 46 states and 67 transitions. [2018-06-26 17:47:38,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:47:38,099 INFO ]: Start accepts. Automaton has 41 states. Word has length 42 [2018-06-26 17:47:38,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:38,099 INFO ]: With dead ends: 46 [2018-06-26 17:47:38,099 INFO ]: Without dead ends: 46 [2018-06-26 17:47:38,100 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=283, Invalid=5723, Unknown=0, NotChecked=0, Total=6006 [2018-06-26 17:47:38,100 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 17:47:38,109 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-06-26 17:47:38,109 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 17:47:38,110 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2018-06-26 17:47:38,110 INFO ]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 42 [2018-06-26 17:47:38,110 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:38,110 INFO ]: Abstraction has 45 states and 65 transitions. [2018-06-26 17:47:38,110 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:47:38,110 INFO ]: Start isEmpty. Operand 45 states and 65 transitions. [2018-06-26 17:47:38,111 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 17:47:38,111 INFO ]: Found error trace [2018-06-26 17:47:38,111 INFO ]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-06-26 17:47:38,111 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:38,111 INFO ]: Analyzing trace with hash -1866965075, now seen corresponding path program 19 times [2018-06-26 17:47:38,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:38,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:38,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:38,112 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:38,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:38,140 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:39,267 INFO ]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:39,268 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:39,268 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 17:47:39,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:39,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:39,352 INFO ]: Computing forward predicates... [2018-06-26 17:47:39,510 INFO ]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:39,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:39,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-06-26 17:47:39,529 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:47:39,530 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:47:39,530 INFO ]: CoverageRelationStatistics Valid=103, Invalid=1703, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:47:39,530 INFO ]: Start difference. First operand 45 states and 65 transitions. Second operand 43 states. [2018-06-26 17:47:42,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:42,177 INFO ]: Finished difference Result 48 states and 70 transitions. [2018-06-26 17:47:42,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-26 17:47:42,178 INFO ]: Start accepts. Automaton has 43 states. Word has length 44 [2018-06-26 17:47:42,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:42,178 INFO ]: With dead ends: 48 [2018-06-26 17:47:42,178 INFO ]: Without dead ends: 48 [2018-06-26 17:47:42,180 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=298, Invalid=6344, Unknown=0, NotChecked=0, Total=6642 [2018-06-26 17:47:42,180 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 17:47:42,182 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-06-26 17:47:42,182 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 17:47:42,182 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-06-26 17:47:42,182 INFO ]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 44 [2018-06-26 17:47:42,182 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:42,182 INFO ]: Abstraction has 47 states and 68 transitions. [2018-06-26 17:47:42,182 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:47:42,182 INFO ]: Start isEmpty. Operand 47 states and 68 transitions. [2018-06-26 17:47:42,183 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 17:47:42,183 INFO ]: Found error trace [2018-06-26 17:47:42,183 INFO ]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-06-26 17:47:42,183 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:42,183 INFO ]: Analyzing trace with hash 1124524510, now seen corresponding path program 20 times [2018-06-26 17:47:42,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:42,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:42,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:42,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:47:42,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:42,208 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:43,461 INFO ]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:43,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:43,461 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 17:47:43,467 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:47:43,541 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:47:43,541 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:43,557 INFO ]: Computing forward predicates... [2018-06-26 17:47:43,700 INFO ]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:43,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:43,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-06-26 17:47:43,721 INFO ]: Interpolant automaton has 45 states [2018-06-26 17:47:43,721 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-26 17:47:43,721 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1872, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:47:43,722 INFO ]: Start difference. First operand 47 states and 68 transitions. Second operand 45 states. [2018-06-26 17:47:44,913 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-26 17:47:46,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:46,787 INFO ]: Finished difference Result 50 states and 73 transitions. [2018-06-26 17:47:46,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-26 17:47:46,788 INFO ]: Start accepts. Automaton has 45 states. Word has length 46 [2018-06-26 17:47:46,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:46,788 INFO ]: With dead ends: 50 [2018-06-26 17:47:46,788 INFO ]: Without dead ends: 50 [2018-06-26 17:47:46,789 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=313, Invalid=6997, Unknown=0, NotChecked=0, Total=7310 [2018-06-26 17:47:46,789 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 17:47:46,791 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-06-26 17:47:46,791 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 17:47:46,792 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-06-26 17:47:46,792 INFO ]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 46 [2018-06-26 17:47:46,793 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:46,793 INFO ]: Abstraction has 49 states and 71 transitions. [2018-06-26 17:47:46,793 INFO ]: Interpolant automaton has 45 states. [2018-06-26 17:47:46,793 INFO ]: Start isEmpty. Operand 49 states and 71 transitions. [2018-06-26 17:47:46,794 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-26 17:47:46,794 INFO ]: Found error trace [2018-06-26 17:47:46,794 INFO ]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-06-26 17:47:46,794 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:46,794 INFO ]: Analyzing trace with hash -1682072625, now seen corresponding path program 21 times [2018-06-26 17:47:46,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:46,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:46,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:46,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:46,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:46,822 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:48,532 INFO ]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:48,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:48,532 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 17:47:48,538 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:47:48,641 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-06-26 17:47:48,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:48,651 INFO ]: Computing forward predicates... [2018-06-26 17:47:48,730 INFO ]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:48,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:48,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-06-26 17:47:48,750 INFO ]: Interpolant automaton has 47 states [2018-06-26 17:47:48,750 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-26 17:47:48,751 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2049, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:47:48,751 INFO ]: Start difference. First operand 49 states and 71 transitions. Second operand 47 states. [2018-06-26 17:47:51,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:51,890 INFO ]: Finished difference Result 52 states and 76 transitions. [2018-06-26 17:47:51,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-26 17:47:51,890 INFO ]: Start accepts. Automaton has 47 states. Word has length 48 [2018-06-26 17:47:51,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:51,891 INFO ]: With dead ends: 52 [2018-06-26 17:47:51,891 INFO ]: Without dead ends: 52 [2018-06-26 17:47:51,891 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=328, Invalid=7682, Unknown=0, NotChecked=0, Total=8010 [2018-06-26 17:47:51,891 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 17:47:51,895 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-06-26 17:47:51,895 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 17:47:51,896 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2018-06-26 17:47:51,896 INFO ]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 48 [2018-06-26 17:47:51,896 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:51,896 INFO ]: Abstraction has 51 states and 74 transitions. [2018-06-26 17:47:51,896 INFO ]: Interpolant automaton has 47 states. [2018-06-26 17:47:51,896 INFO ]: Start isEmpty. Operand 51 states and 74 transitions. [2018-06-26 17:47:51,896 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 17:47:51,896 INFO ]: Found error trace [2018-06-26 17:47:51,896 INFO ]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-06-26 17:47:51,896 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:51,897 INFO ]: Analyzing trace with hash -1582457472, now seen corresponding path program 22 times [2018-06-26 17:47:51,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:51,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:51,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:51,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:51,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:51,927 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:53,752 INFO ]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:53,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:53,752 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 17:47:53,771 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:47:53,849 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:47:53,849 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:53,859 INFO ]: Computing forward predicates... [2018-06-26 17:47:53,976 INFO ]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:53,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:53,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-26 17:47:53,998 INFO ]: Interpolant automaton has 49 states [2018-06-26 17:47:53,998 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-26 17:47:53,998 INFO ]: CoverageRelationStatistics Valid=118, Invalid=2234, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:47:53,998 INFO ]: Start difference. First operand 51 states and 74 transitions. Second operand 49 states. [2018-06-26 17:47:57,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:47:57,448 INFO ]: Finished difference Result 54 states and 79 transitions. [2018-06-26 17:47:57,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-26 17:47:57,448 INFO ]: Start accepts. Automaton has 49 states. Word has length 50 [2018-06-26 17:47:57,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:47:57,448 INFO ]: With dead ends: 54 [2018-06-26 17:47:57,448 INFO ]: Without dead ends: 54 [2018-06-26 17:47:57,449 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=343, Invalid=8399, Unknown=0, NotChecked=0, Total=8742 [2018-06-26 17:47:57,449 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 17:47:57,450 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-06-26 17:47:57,450 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 17:47:57,450 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2018-06-26 17:47:57,450 INFO ]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 50 [2018-06-26 17:47:57,450 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:47:57,450 INFO ]: Abstraction has 53 states and 77 transitions. [2018-06-26 17:47:57,450 INFO ]: Interpolant automaton has 49 states. [2018-06-26 17:47:57,450 INFO ]: Start isEmpty. Operand 53 states and 77 transitions. [2018-06-26 17:47:57,451 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 17:47:57,451 INFO ]: Found error trace [2018-06-26 17:47:57,451 INFO ]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-06-26 17:47:57,451 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:47:57,451 INFO ]: Analyzing trace with hash -341575951, now seen corresponding path program 23 times [2018-06-26 17:47:57,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:47:57,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:47:57,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:57,452 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:47:57,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:47:57,484 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:58,992 INFO ]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:58,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:47:58,992 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 17:47:59,000 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:47:59,116 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-06-26 17:47:59,116 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:47:59,131 INFO ]: Computing forward predicates... [2018-06-26 17:47:59,297 INFO ]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:47:59,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:47:59,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-06-26 17:47:59,318 INFO ]: Interpolant automaton has 51 states [2018-06-26 17:47:59,318 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-26 17:47:59,318 INFO ]: CoverageRelationStatistics Valid=123, Invalid=2427, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:47:59,318 INFO ]: Start difference. First operand 53 states and 77 transitions. Second operand 51 states. Received shutdown request... [2018-06-26 17:48:00,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:48:00,444 WARN ]: Verification canceled [2018-06-26 17:48:00,446 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:48:00,447 WARN ]: Timeout [2018-06-26 17:48:00,447 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:48:00 BasicIcfg [2018-06-26 17:48:00,447 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:48:00,448 INFO ]: Toolchain (without parser) took 63147.68 ms. Allocated memory was 308.3 MB in the beginning and 893.9 MB in the end (delta: 585.6 MB). Free memory was 264.6 MB in the beginning and 540.6 MB in the end (delta: -276.0 MB). Peak memory consumption was 309.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,448 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:48:00,449 INFO ]: ChcToBoogie took 62.67 ms. Allocated memory is still 308.3 MB. Free memory was 264.6 MB in the beginning and 261.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,449 INFO ]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 308.3 MB. Free memory was 261.6 MB in the beginning and 260.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,449 INFO ]: RCFGBuilder took 345.00 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 252.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,450 INFO ]: BlockEncodingV2 took 107.45 ms. Allocated memory is still 308.3 MB. Free memory was 252.6 MB in the beginning and 249.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,450 INFO ]: TraceAbstraction took 62582.01 ms. Allocated memory was 308.3 MB in the beginning and 893.9 MB in the end (delta: 585.6 MB). Free memory was 249.6 MB in the beginning and 540.6 MB in the end (delta: -291.0 MB). Peak memory consumption was 294.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:00,459 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.67 ms. Allocated memory is still 308.3 MB. Free memory was 264.6 MB in the beginning and 261.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 308.3 MB. Free memory was 261.6 MB in the beginning and 260.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 345.00 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 252.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 107.45 ms. Allocated memory is still 308.3 MB. Free memory was 252.6 MB in the beginning and 249.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62582.01 ms. Allocated memory was 308.3 MB in the beginning and 893.9 MB in the end (delta: 585.6 MB). Free memory was 249.6 MB in the beginning and 540.6 MB in the end (delta: -291.0 MB). Peak memory consumption was 294.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (53states) and interpolant automaton (currently 17 states, 51 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 62.4s OverallTime, 26 OverallIterations, 24 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 54 SDslu, 2132 SDs, 0 SdLazy, 27873 SolverSat, 1539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1892 GetRequests, 683 SyntacticMatches, 23 SemanticMatches, 1185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7989 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=25, 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.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 28 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 195 NumberOfCheckSat, 1367 ConstructedInterpolants, 0 QuantifiedInterpolants, 1040882 SizeOfPredicates, 2383 NumberOfNonLiveVariables, 10110 ConjunctsInSsa, 7310 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 6/9208 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/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-48-00-471.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-48-00-471.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-48-00-471.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-48-00-471.csv Completed graceful shutdown