java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/map_map.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:49:36,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:49:36,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:49:36,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:49:36,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:49:36,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:49:36,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:49:36,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:49:36,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:49:36,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:49:36,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:49:36,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:49:36,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:49:36,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:49:36,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:49:36,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:49:36,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:49:36,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:49:36,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:49:36,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:49:36,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:49:36,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:49:36,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:49:36,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:49:36,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:49:36,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:49:36,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:49:36,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:49:36,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:49:36,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:49:36,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:49:36,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:49:36,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:49:36,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:49:36,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:49:36,859 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:49:36,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:49:36,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:49:36,878 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:49:36,878 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:49:36,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:49:36,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:49:36,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:49:36,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:49:36,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:49:36,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:49:36,880 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:49:36,881 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:49:36,883 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:49:36,883 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:49:36,934 INFO ]: Repository-Root is: /tmp [2018-06-22 01:49:36,953 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:49:36,957 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:49:36,958 INFO ]: Initializing SmtParser... [2018-06-22 01:49:36,958 INFO ]: SmtParser initialized [2018-06-22 01:49:36,959 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/map_map.smt2 [2018-06-22 01:49:36,961 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-22 01:49:37,059 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/map_map.smt2 unknown [2018-06-22 01:49:37,229 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/map_map.smt2 [2018-06-22 01:49:37,237 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:49:37,243 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:49:37,243 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:49:37,243 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:49:37,244 INFO ]: ChcToBoogie initialized [2018-06-22 01:49:37,248 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,306 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37 Unit [2018-06-22 01:49:37,306 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:49:37,306 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:49:37,306 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:49:37,306 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:49:37,329 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,329 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,337 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,337 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,339 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,342 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,343 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (1/1) ... [2018-06-22 01:49:37,345 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:49:37,348 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:49:37,348 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:49:37,348 INFO ]: RCFGBuilder initialized [2018-06-22 01:49:37,349 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (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-22 01:49:37,376 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:49:37,376 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:49:37,376 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:49:37,376 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:49:37,376 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:49:37,376 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-22 01:49:37,617 INFO ]: Using library mode [2018-06-22 01:49:37,618 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:49:37 BoogieIcfgContainer [2018-06-22 01:49:37,618 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:49:37,623 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:49:37,624 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:49:37,634 INFO ]: TraceAbstraction initialized [2018-06-22 01:49:37,634 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:49:37" (1/3) ... [2018-06-22 01:49:37,636 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d830427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:49:37, skipping insertion in model container [2018-06-22 01:49:37,636 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:49:37" (2/3) ... [2018-06-22 01:49:37,636 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d830427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:49:37, skipping insertion in model container [2018-06-22 01:49:37,636 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:49:37" (3/3) ... [2018-06-22 01:49:37,638 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:49:37,654 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:49:37,667 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:49:37,738 INFO ]: Using default assertion order modulation [2018-06-22 01:49:37,739 INFO ]: Interprodecural is true [2018-06-22 01:49:37,739 INFO ]: Hoare is false [2018-06-22 01:49:37,739 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:49:37,739 INFO ]: Backedges is TWOTRACK [2018-06-22 01:49:37,739 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:49:37,739 INFO ]: Difference is false [2018-06-22 01:49:37,739 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:49:37,739 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:49:37,756 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:49:37,772 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:49:37,773 INFO ]: Found error trace [2018-06-22 01:49:37,776 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:37,777 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:37,784 INFO ]: Analyzing trace with hash 81667677, now seen corresponding path program 1 times [2018-06-22 01:49:37,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:37,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:37,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:37,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:37,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:37,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:37,991 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:49:37,993 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:49:37,993 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:49:37,995 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:38,006 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:38,006 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:38,008 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:49:38,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:38,191 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-22 01:49:38,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:38,193 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:49:38,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:38,202 INFO ]: With dead ends: 19 [2018-06-22 01:49:38,202 INFO ]: Without dead ends: 19 [2018-06-22 01:49:38,204 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:49:38,221 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:49:38,247 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:49:38,249 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:49:38,249 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-22 01:49:38,252 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 7 [2018-06-22 01:49:38,253 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:38,253 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-22 01:49:38,253 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:38,253 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-22 01:49:38,257 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:49:38,257 INFO ]: Found error trace [2018-06-22 01:49:38,257 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:38,257 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:38,258 INFO ]: Analyzing trace with hash 1858802692, now seen corresponding path program 1 times [2018-06-22 01:49:38,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:38,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:38,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:38,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:38,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:38,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:38,359 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:38,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:38,360 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-22 01:49:38,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:38,391 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:38,400 INFO ]: Computing forward predicates... [2018-06-22 01:49:38,625 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:38,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:38,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:49:38,650 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:49:38,651 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:49:38,651 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:49:38,651 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 11 states. [2018-06-22 01:49:39,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:39,505 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-22 01:49:39,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:49:39,506 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:49:39,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:39,507 INFO ]: With dead ends: 29 [2018-06-22 01:49:39,507 INFO ]: Without dead ends: 20 [2018-06-22 01:49:39,508 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:49:39,508 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:49:39,515 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:49:39,515 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:49:39,516 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 01:49:39,516 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-06-22 01:49:39,516 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:39,516 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 01:49:39,516 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:49:39,516 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 01:49:39,517 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:49:39,517 INFO ]: Found error trace [2018-06-22 01:49:39,517 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:39,517 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:39,517 INFO ]: Analyzing trace with hash -1187191800, now seen corresponding path program 1 times [2018-06-22 01:49:39,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:39,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:39,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:39,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:39,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:39,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:39,928 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:39,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:39,928 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-22 01:49:39,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:39,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:39,951 INFO ]: Computing forward predicates... [2018-06-22 01:49:40,043 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:40,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:40,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:49:40,065 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:49:40,065 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:49:40,065 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:49:40,066 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 11 states. [2018-06-22 01:49:40,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:40,288 INFO ]: Finished difference Result 27 states and 32 transitions. [2018-06-22 01:49:40,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:49:40,288 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:49:40,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:40,289 INFO ]: With dead ends: 27 [2018-06-22 01:49:40,289 INFO ]: Without dead ends: 27 [2018-06-22 01:49:40,289 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:49:40,289 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:49:40,294 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:49:40,294 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:49:40,295 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-22 01:49:40,295 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-06-22 01:49:40,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:40,295 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-22 01:49:40,295 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:49:40,295 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-22 01:49:40,295 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:49:40,296 INFO ]: Found error trace [2018-06-22 01:49:40,296 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:40,296 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:40,296 INFO ]: Analyzing trace with hash 1849875556, now seen corresponding path program 2 times [2018-06-22 01:49:40,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:40,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:40,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:40,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:40,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:40,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:40,535 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:40,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:40,536 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-22 01:49:40,544 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:49:40,558 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:49:40,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:40,560 INFO ]: Computing forward predicates... [2018-06-22 01:49:40,736 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:40,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:40,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 01:49:40,765 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:49:40,765 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:49:40,766 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:49:40,766 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 15 states. [2018-06-22 01:49:41,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:41,084 INFO ]: Finished difference Result 36 states and 43 transitions. [2018-06-22 01:49:41,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:49:41,085 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-22 01:49:41,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:41,086 INFO ]: With dead ends: 36 [2018-06-22 01:49:41,086 INFO ]: Without dead ends: 36 [2018-06-22 01:49:41,086 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:49:41,087 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:49:41,090 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 01:49:41,091 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:49:41,092 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-22 01:49:41,092 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-06-22 01:49:41,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:41,092 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-22 01:49:41,092 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:49:41,092 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-22 01:49:41,093 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:49:41,093 INFO ]: Found error trace [2018-06-22 01:49:41,093 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:41,093 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:41,093 INFO ]: Analyzing trace with hash -478102680, now seen corresponding path program 3 times [2018-06-22 01:49:41,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:41,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:41,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:41,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:41,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:41,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:41,184 INFO ]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:41,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:41,184 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-22 01:49:41,198 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:49:41,227 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:49:41,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:41,229 INFO ]: Computing forward predicates... [2018-06-22 01:49:41,283 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:41,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:41,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:49:41,317 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:49:41,318 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:49:41,318 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:49:41,318 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 11 states. [2018-06-22 01:49:41,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:41,418 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-22 01:49:41,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:49:41,421 INFO ]: Start accepts. Automaton has 11 states. Word has length 18 [2018-06-22 01:49:41,422 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:41,423 INFO ]: With dead ends: 38 [2018-06-22 01:49:41,423 INFO ]: Without dead ends: 38 [2018-06-22 01:49:41,423 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:49:41,423 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:49:41,429 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-06-22 01:49:41,429 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:49:41,430 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-06-22 01:49:41,430 INFO ]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2018-06-22 01:49:41,430 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:41,430 INFO ]: Abstraction has 29 states and 34 transitions. [2018-06-22 01:49:41,430 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:49:41,430 INFO ]: Start isEmpty. Operand 29 states and 34 transitions. [2018-06-22 01:49:41,431 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:49:41,431 INFO ]: Found error trace [2018-06-22 01:49:41,431 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:41,431 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:41,431 INFO ]: Analyzing trace with hash 1509683080, now seen corresponding path program 4 times [2018-06-22 01:49:41,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:41,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:41,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:41,432 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:41,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:41,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:41,679 INFO ]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:41,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:41,679 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-22 01:49:41,694 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:49:41,710 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:49:41,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:41,712 INFO ]: Computing forward predicates... [2018-06-22 01:49:41,757 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:41,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:41,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:49:41,789 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:49:41,789 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:49:41,789 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:49:41,789 INFO ]: Start difference. First operand 29 states and 34 transitions. Second operand 11 states. [2018-06-22 01:49:41,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:41,981 INFO ]: Finished difference Result 40 states and 47 transitions. [2018-06-22 01:49:41,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:49:41,981 INFO ]: Start accepts. Automaton has 11 states. Word has length 18 [2018-06-22 01:49:41,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:41,982 INFO ]: With dead ends: 40 [2018-06-22 01:49:41,982 INFO ]: Without dead ends: 30 [2018-06-22 01:49:41,982 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:49:41,983 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:49:41,985 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:49:41,986 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:49:41,986 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 01:49:41,986 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2018-06-22 01:49:41,987 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:41,987 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 01:49:41,987 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:49:41,987 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 01:49:41,987 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:49:41,987 INFO ]: Found error trace [2018-06-22 01:49:41,987 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:41,988 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:41,988 INFO ]: Analyzing trace with hash -1938165500, now seen corresponding path program 5 times [2018-06-22 01:49:41,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:41,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:41,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:41,989 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:41,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:42,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:42,138 INFO ]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:42,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:42,138 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-22 01:49:42,145 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:49:42,162 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:49:42,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:42,164 INFO ]: Computing forward predicates... [2018-06-22 01:49:42,212 INFO ]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:42,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:42,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 01:49:42,233 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:49:42,234 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:49:42,234 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:49:42,234 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 13 states. [2018-06-22 01:49:42,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:42,590 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-22 01:49:42,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:49:42,591 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:49:42,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:42,592 INFO ]: With dead ends: 41 [2018-06-22 01:49:42,592 INFO ]: Without dead ends: 41 [2018-06-22 01:49:42,592 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:49:42,592 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:49:42,596 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 01:49:42,596 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:49:42,598 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-22 01:49:42,598 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2018-06-22 01:49:42,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:42,598 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-22 01:49:42,598 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:49:42,598 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-22 01:49:42,599 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:49:42,599 INFO ]: Found error trace [2018-06-22 01:49:42,599 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:42,599 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:42,600 INFO ]: Analyzing trace with hash -1447289080, now seen corresponding path program 6 times [2018-06-22 01:49:42,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:42,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:42,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:42,600 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:42,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:42,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:42,718 INFO ]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:42,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:42,718 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-22 01:49:42,725 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:49:42,749 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:49:42,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:42,751 INFO ]: Computing forward predicates... [2018-06-22 01:49:42,781 INFO ]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:42,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:42,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 01:49:42,811 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:49:42,811 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:49:42,811 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:49:42,811 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 13 states. [2018-06-22 01:49:42,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:42,866 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-22 01:49:42,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:49:42,867 INFO ]: Start accepts. Automaton has 13 states. Word has length 20 [2018-06-22 01:49:42,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:42,868 INFO ]: With dead ends: 43 [2018-06-22 01:49:42,868 INFO ]: Without dead ends: 43 [2018-06-22 01:49:42,868 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:49:42,868 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:49:42,872 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-22 01:49:42,872 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:49:42,873 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-22 01:49:42,873 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2018-06-22 01:49:42,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:42,873 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-22 01:49:42,873 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:49:42,873 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-22 01:49:42,874 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:49:42,874 INFO ]: Found error trace [2018-06-22 01:49:42,874 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:42,874 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:42,874 INFO ]: Analyzing trace with hash 44527336, now seen corresponding path program 7 times [2018-06-22 01:49:42,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:42,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:42,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:42,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:42,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:42,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:43,009 INFO ]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:43,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:43,009 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-22 01:49:43,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:43,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:43,033 INFO ]: Computing forward predicates... [2018-06-22 01:49:43,060 INFO ]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:43,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:43,079 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 01:49:43,080 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:49:43,080 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:49:43,080 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:49:43,080 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 13 states. [2018-06-22 01:49:43,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:43,233 INFO ]: Finished difference Result 45 states and 52 transitions. [2018-06-22 01:49:43,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:49:43,233 INFO ]: Start accepts. Automaton has 13 states. Word has length 20 [2018-06-22 01:49:43,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:43,234 INFO ]: With dead ends: 45 [2018-06-22 01:49:43,234 INFO ]: Without dead ends: 33 [2018-06-22 01:49:43,235 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:49:43,235 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:49:43,238 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:49:43,238 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:49:43,239 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-06-22 01:49:43,239 INFO ]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-06-22 01:49:43,239 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:43,239 INFO ]: Abstraction has 33 states and 38 transitions. [2018-06-22 01:49:43,239 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:49:43,239 INFO ]: Start isEmpty. Operand 33 states and 38 transitions. [2018-06-22 01:49:43,240 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:49:43,240 INFO ]: Found error trace [2018-06-22 01:49:43,240 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:43,240 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:43,241 INFO ]: Analyzing trace with hash -1918172828, now seen corresponding path program 8 times [2018-06-22 01:49:43,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:43,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:43,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:43,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:43,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:43,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:43,589 INFO ]: Checked inductivity of 32 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:43,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:43,589 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-22 01:49:43,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:49:43,629 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:49:43,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:43,632 INFO ]: Computing forward predicates... [2018-06-22 01:49:44,098 INFO ]: Checked inductivity of 32 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:44,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:44,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-06-22 01:49:44,132 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:49:44,132 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:49:44,132 INFO ]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:49:44,132 INFO ]: Start difference. First operand 33 states and 38 transitions. Second operand 23 states. [2018-06-22 01:49:44,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:44,657 INFO ]: Finished difference Result 46 states and 53 transitions. [2018-06-22 01:49:44,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:49:44,657 INFO ]: Start accepts. Automaton has 23 states. Word has length 21 [2018-06-22 01:49:44,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:44,657 INFO ]: With dead ends: 46 [2018-06-22 01:49:44,657 INFO ]: Without dead ends: 46 [2018-06-22 01:49:44,658 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:49:44,658 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:49:44,662 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-06-22 01:49:44,662 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:49:44,663 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-22 01:49:44,663 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-06-22 01:49:44,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:44,663 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-22 01:49:44,663 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:49:44,663 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-22 01:49:44,664 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:49:44,664 INFO ]: Found error trace [2018-06-22 01:49:44,664 INFO ]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:44,664 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:44,665 INFO ]: Analyzing trace with hash 1662631528, now seen corresponding path program 9 times [2018-06-22 01:49:44,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:44,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:44,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:44,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:44,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:44,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:44,817 INFO ]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:44,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:44,817 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:49:44,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:44,860 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:49:44,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:44,861 INFO ]: Computing forward predicates... [2018-06-22 01:49:44,906 INFO ]: Checked inductivity of 40 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:44,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:44,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 01:49:44,928 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:49:44,928 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:49:44,928 INFO ]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:49:44,928 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 15 states. [2018-06-22 01:49:45,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:45,054 INFO ]: Finished difference Result 48 states and 55 transitions. [2018-06-22 01:49:45,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:49:45,054 INFO ]: Start accepts. Automaton has 15 states. Word has length 22 [2018-06-22 01:49:45,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:45,055 INFO ]: With dead ends: 48 [2018-06-22 01:49:45,055 INFO ]: Without dead ends: 48 [2018-06-22 01:49:45,055 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:49:45,056 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:49:45,059 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-06-22 01:49:45,059 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:49:45,059 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 01:49:45,060 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2018-06-22 01:49:45,060 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:45,060 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 01:49:45,060 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:49:45,060 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 01:49:45,060 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:49:45,060 INFO ]: Found error trace [2018-06-22 01:49:45,061 INFO ]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:45,061 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:45,061 INFO ]: Analyzing trace with hash 664300168, now seen corresponding path program 10 times [2018-06-22 01:49:45,061 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:45,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:45,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:45,061 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:45,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:45,073 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:45,345 INFO ]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:45,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:45,345 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-22 01:49:45,353 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:49:45,381 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:49:45,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:45,383 INFO ]: Computing forward predicates... [2018-06-22 01:49:45,437 INFO ]: Checked inductivity of 40 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:45,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:45,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 01:49:45,459 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:49:45,460 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:49:45,460 INFO ]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:49:45,460 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 15 states. [2018-06-22 01:49:45,593 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:45,593 INFO ]: Finished difference Result 50 states and 57 transitions. [2018-06-22 01:49:45,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:49:45,593 INFO ]: Start accepts. Automaton has 15 states. Word has length 22 [2018-06-22 01:49:45,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:45,593 INFO ]: With dead ends: 50 [2018-06-22 01:49:45,593 INFO ]: Without dead ends: 36 [2018-06-22 01:49:45,594 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:49:45,594 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:49:45,597 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:49:45,597 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:49:45,597 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-06-22 01:49:45,597 INFO ]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2018-06-22 01:49:45,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:45,598 INFO ]: Abstraction has 36 states and 41 transitions. [2018-06-22 01:49:45,598 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:49:45,598 INFO ]: Start isEmpty. Operand 36 states and 41 transitions. [2018-06-22 01:49:45,599 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:49:45,599 INFO ]: Found error trace [2018-06-22 01:49:45,599 INFO ]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:45,599 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:45,599 INFO ]: Analyzing trace with hash 85508, now seen corresponding path program 11 times [2018-06-22 01:49:45,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:45,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:45,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:45,600 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:45,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:45,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:45,885 INFO ]: Checked inductivity of 49 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:45,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:45,885 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-22 01:49:45,892 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:49:45,912 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:49:45,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:45,915 INFO ]: Computing forward predicates... [2018-06-22 01:49:46,123 INFO ]: Checked inductivity of 49 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:46,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:46,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-06-22 01:49:46,145 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:49:46,145 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:49:46,145 INFO ]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:49:46,145 INFO ]: Start difference. First operand 36 states and 41 transitions. Second operand 27 states. [2018-06-22 01:49:46,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:46,688 INFO ]: Finished difference Result 51 states and 58 transitions. [2018-06-22 01:49:46,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:49:46,694 INFO ]: Start accepts. Automaton has 27 states. Word has length 23 [2018-06-22 01:49:46,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:46,695 INFO ]: With dead ends: 51 [2018-06-22 01:49:46,695 INFO ]: Without dead ends: 51 [2018-06-22 01:49:46,696 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:49:46,696 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:49:46,700 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 01:49:46,700 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:49:46,700 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-22 01:49:46,700 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 23 [2018-06-22 01:49:46,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:46,700 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-22 01:49:46,700 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:49:46,701 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-22 01:49:46,701 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:49:46,701 INFO ]: Found error trace [2018-06-22 01:49:46,701 INFO ]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:46,701 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:46,702 INFO ]: Analyzing trace with hash 884267528, now seen corresponding path program 12 times [2018-06-22 01:49:46,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:46,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:46,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:46,702 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:46,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:46,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:46,925 INFO ]: Checked inductivity of 59 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:46,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:46,925 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-22 01:49:46,933 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:49:46,954 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:49:46,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:46,957 INFO ]: Computing forward predicates... [2018-06-22 01:49:47,015 INFO ]: Checked inductivity of 59 backedges. 17 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:47,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:47,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-22 01:49:47,038 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:49:47,038 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:49:47,038 INFO ]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:49:47,038 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 17 states. [2018-06-22 01:49:47,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:47,129 INFO ]: Finished difference Result 53 states and 60 transitions. [2018-06-22 01:49:47,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:49:47,130 INFO ]: Start accepts. Automaton has 17 states. Word has length 24 [2018-06-22 01:49:47,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:47,130 INFO ]: With dead ends: 53 [2018-06-22 01:49:47,130 INFO ]: Without dead ends: 53 [2018-06-22 01:49:47,130 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:49:47,130 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:49:47,134 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-06-22 01:49:47,134 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:49:47,135 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-22 01:49:47,135 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-06-22 01:49:47,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:47,135 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-22 01:49:47,135 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:49:47,135 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-22 01:49:47,137 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:49:47,137 INFO ]: Found error trace [2018-06-22 01:49:47,137 INFO ]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:47,137 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:47,137 INFO ]: Analyzing trace with hash 766440, now seen corresponding path program 13 times [2018-06-22 01:49:47,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:47,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:47,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:47,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:47,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:47,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:47,498 INFO ]: Checked inductivity of 59 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:47,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:47,498 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-22 01:49:47,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:47,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:47,536 INFO ]: Computing forward predicates... [2018-06-22 01:49:47,957 INFO ]: Checked inductivity of 59 backedges. 17 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:47,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:47,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-22 01:49:47,978 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:49:47,978 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:49:47,978 INFO ]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:49:47,978 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 17 states. [2018-06-22 01:49:48,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:48,187 INFO ]: Finished difference Result 55 states and 62 transitions. [2018-06-22 01:49:48,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:49:48,188 INFO ]: Start accepts. Automaton has 17 states. Word has length 24 [2018-06-22 01:49:48,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:48,188 INFO ]: With dead ends: 55 [2018-06-22 01:49:48,188 INFO ]: Without dead ends: 39 [2018-06-22 01:49:48,188 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:49:48,189 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:49:48,191 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:49:48,191 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:49:48,192 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 01:49:48,192 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2018-06-22 01:49:48,192 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:48,192 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 01:49:48,192 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:49:48,192 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 01:49:48,194 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:49:48,194 INFO ]: Found error trace [2018-06-22 01:49:48,194 INFO ]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:48,194 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:48,194 INFO ]: Analyzing trace with hash 1640605284, now seen corresponding path program 14 times [2018-06-22 01:49:48,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:48,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:48,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:48,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:48,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:48,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:48,570 INFO ]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:48,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:48,570 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) [2018-06-22 01:49:48,582 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:48,609 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:49:48,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:48,612 INFO ]: Computing forward predicates... [2018-06-22 01:49:48,877 INFO ]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:48,899 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:48,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-06-22 01:49:48,899 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:49:48,899 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:49:48,899 INFO ]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:49:48,899 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 31 states. [2018-06-22 01:49:50,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:50,131 INFO ]: Finished difference Result 56 states and 63 transitions. [2018-06-22 01:49:50,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:49:50,131 INFO ]: Start accepts. Automaton has 31 states. Word has length 25 [2018-06-22 01:49:50,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:50,132 INFO ]: With dead ends: 56 [2018-06-22 01:49:50,132 INFO ]: Without dead ends: 56 [2018-06-22 01:49:50,133 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:49:50,133 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:49:50,136 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-06-22 01:49:50,136 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:49:50,137 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-06-22 01:49:50,137 INFO ]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-06-22 01:49:50,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:50,137 INFO ]: Abstraction has 46 states and 53 transitions. [2018-06-22 01:49:50,137 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:49:50,137 INFO ]: Start isEmpty. Operand 46 states and 53 transitions. [2018-06-22 01:49:50,138 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:49:50,138 INFO ]: Found error trace [2018-06-22 01:49:50,138 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:50,138 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:50,138 INFO ]: Analyzing trace with hash 936001896, now seen corresponding path program 15 times [2018-06-22 01:49:50,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:50,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:50,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:50,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:50,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:50,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:50,454 INFO ]: Checked inductivity of 82 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:50,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:50,454 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-22 01:49:50,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:49:50,510 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:49:50,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:50,512 INFO ]: Computing forward predicates... [2018-06-22 01:49:50,597 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:50,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:50,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-22 01:49:50,619 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:49:50,619 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:49:50,619 INFO ]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:49:50,619 INFO ]: Start difference. First operand 46 states and 53 transitions. Second operand 19 states. [2018-06-22 01:49:50,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:50,704 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-22 01:49:50,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:49:50,705 INFO ]: Start accepts. Automaton has 19 states. Word has length 26 [2018-06-22 01:49:50,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:50,706 INFO ]: With dead ends: 58 [2018-06-22 01:49:50,706 INFO ]: Without dead ends: 58 [2018-06-22 01:49:50,706 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:49:50,706 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:49:50,709 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-06-22 01:49:50,709 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:49:50,711 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-22 01:49:50,711 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2018-06-22 01:49:50,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:50,712 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-22 01:49:50,712 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:49:50,712 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-22 01:49:50,712 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:49:50,712 INFO ]: Found error trace [2018-06-22 01:49:50,712 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:50,712 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:50,712 INFO ]: Analyzing trace with hash -682728056, now seen corresponding path program 16 times [2018-06-22 01:49:50,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:50,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:50,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:50,715 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:50,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:50,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:51,513 INFO ]: Checked inductivity of 82 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:51,513 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:51,513 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:49:51,528 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:51,563 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:49:51,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:51,565 INFO ]: Computing forward predicates... [2018-06-22 01:49:51,629 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:51,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:51,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-22 01:49:51,650 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:49:51,650 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:49:51,650 INFO ]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:49:51,650 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 19 states. [2018-06-22 01:49:51,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:51,817 INFO ]: Finished difference Result 60 states and 67 transitions. [2018-06-22 01:49:51,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:49:51,818 INFO ]: Start accepts. Automaton has 19 states. Word has length 26 [2018-06-22 01:49:51,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:51,818 INFO ]: With dead ends: 60 [2018-06-22 01:49:51,818 INFO ]: Without dead ends: 42 [2018-06-22 01:49:51,818 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:49:51,818 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:49:51,820 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:49:51,820 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:49:51,821 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-22 01:49:51,821 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2018-06-22 01:49:51,821 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:51,821 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-22 01:49:51,821 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:49:51,821 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-22 01:49:51,822 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:49:51,822 INFO ]: Found error trace [2018-06-22 01:49:51,822 INFO ]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:51,822 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:51,822 INFO ]: Analyzing trace with hash -1050596604, now seen corresponding path program 17 times [2018-06-22 01:49:51,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:51,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:51,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:51,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:51,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:51,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:52,209 INFO ]: Checked inductivity of 95 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:52,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:52,210 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-22 01:49:52,217 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:49:52,242 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:49:52,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:52,245 INFO ]: Computing forward predicates... [2018-06-22 01:49:52,615 INFO ]: Checked inductivity of 95 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:52,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:52,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-06-22 01:49:52,638 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:49:52,638 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:49:52,638 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:49:52,638 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 35 states. [2018-06-22 01:49:53,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:53,229 INFO ]: Finished difference Result 61 states and 68 transitions. [2018-06-22 01:49:53,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:49:53,229 INFO ]: Start accepts. Automaton has 35 states. Word has length 27 [2018-06-22 01:49:53,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:53,230 INFO ]: With dead ends: 61 [2018-06-22 01:49:53,230 INFO ]: Without dead ends: 61 [2018-06-22 01:49:53,231 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=2223, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:49:53,231 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:49:53,234 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-22 01:49:53,234 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:49:53,234 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-22 01:49:53,234 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-06-22 01:49:53,235 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:53,235 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-22 01:49:53,235 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:49:53,235 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-22 01:49:53,235 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:49:53,235 INFO ]: Found error trace [2018-06-22 01:49:53,235 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:53,235 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:53,235 INFO ]: Analyzing trace with hash 430380296, now seen corresponding path program 18 times [2018-06-22 01:49:53,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:53,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:53,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:53,236 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:53,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:53,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:53,612 INFO ]: Checked inductivity of 109 backedges. 23 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:53,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:53,612 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-22 01:49:53,618 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:49:53,643 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:49:53,643 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:53,645 INFO ]: Computing forward predicates... [2018-06-22 01:49:53,698 INFO ]: Checked inductivity of 109 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:53,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:53,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-22 01:49:53,719 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:49:53,719 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:49:53,719 INFO ]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:49:53,719 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 21 states. [2018-06-22 01:49:53,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:53,814 INFO ]: Finished difference Result 63 states and 70 transitions. [2018-06-22 01:49:53,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:49:53,814 INFO ]: Start accepts. Automaton has 21 states. Word has length 28 [2018-06-22 01:49:53,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:53,815 INFO ]: With dead ends: 63 [2018-06-22 01:49:53,815 INFO ]: Without dead ends: 63 [2018-06-22 01:49:53,815 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:49:53,815 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:49:53,818 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-06-22 01:49:53,818 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:49:53,818 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-06-22 01:49:53,818 INFO ]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2018-06-22 01:49:53,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:53,818 INFO ]: Abstraction has 44 states and 49 transitions. [2018-06-22 01:49:53,818 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:49:53,818 INFO ]: Start isEmpty. Operand 44 states and 49 transitions. [2018-06-22 01:49:53,821 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:49:53,821 INFO ]: Found error trace [2018-06-22 01:49:53,821 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:53,821 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:53,822 INFO ]: Analyzing trace with hash 1789359336, now seen corresponding path program 19 times [2018-06-22 01:49:53,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:53,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:53,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:53,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:53,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:53,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:53,982 INFO ]: Checked inductivity of 109 backedges. 23 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:53,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:53,982 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-22 01:49:53,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:54,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:54,023 INFO ]: Computing forward predicates... [2018-06-22 01:49:54,106 INFO ]: Checked inductivity of 109 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:54,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:54,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-22 01:49:54,132 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:49:54,132 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:49:54,132 INFO ]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:49:54,133 INFO ]: Start difference. First operand 44 states and 49 transitions. Second operand 21 states. [2018-06-22 01:49:54,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:54,413 INFO ]: Finished difference Result 65 states and 72 transitions. [2018-06-22 01:49:54,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:49:54,413 INFO ]: Start accepts. Automaton has 21 states. Word has length 28 [2018-06-22 01:49:54,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:54,414 INFO ]: With dead ends: 65 [2018-06-22 01:49:54,414 INFO ]: Without dead ends: 45 [2018-06-22 01:49:54,415 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:49:54,415 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:49:54,417 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:49:54,417 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:49:54,418 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-06-22 01:49:54,418 INFO ]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 28 [2018-06-22 01:49:54,418 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:54,418 INFO ]: Abstraction has 45 states and 50 transitions. [2018-06-22 01:49:54,418 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:49:54,418 INFO ]: Start isEmpty. Operand 45 states and 50 transitions. [2018-06-22 01:49:54,418 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:49:54,418 INFO ]: Found error trace [2018-06-22 01:49:54,419 INFO ]: trace histogram [14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:54,419 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:54,420 INFO ]: Analyzing trace with hash 455002980, now seen corresponding path program 20 times [2018-06-22 01:49:54,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:54,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:54,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:54,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:54,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:54,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:54,800 INFO ]: Checked inductivity of 124 backedges. 2 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:54,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:54,800 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-22 01:49:54,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:49:54,831 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:49:54,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:54,833 INFO ]: Computing forward predicates... [2018-06-22 01:49:55,226 INFO ]: Checked inductivity of 124 backedges. 2 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:55,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:55,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2018-06-22 01:49:55,247 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:49:55,247 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:49:55,247 INFO ]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:49:55,248 INFO ]: Start difference. First operand 45 states and 50 transitions. Second operand 39 states. [2018-06-22 01:49:56,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:56,173 INFO ]: Finished difference Result 66 states and 73 transitions. [2018-06-22 01:49:56,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:49:56,207 INFO ]: Start accepts. Automaton has 39 states. Word has length 29 [2018-06-22 01:49:56,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:56,207 INFO ]: With dead ends: 66 [2018-06-22 01:49:56,207 INFO ]: Without dead ends: 66 [2018-06-22 01:49:56,208 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:49:56,208 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:49:56,210 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-06-22 01:49:56,210 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:49:56,210 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-06-22 01:49:56,210 INFO ]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 29 [2018-06-22 01:49:56,211 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:56,211 INFO ]: Abstraction has 52 states and 59 transitions. [2018-06-22 01:49:56,211 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:49:56,211 INFO ]: Start isEmpty. Operand 52 states and 59 transitions. [2018-06-22 01:49:56,215 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:49:56,216 INFO ]: Found error trace [2018-06-22 01:49:56,216 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:56,216 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:56,216 INFO ]: Analyzing trace with hash 2039628904, now seen corresponding path program 21 times [2018-06-22 01:49:56,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:56,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:56,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:56,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:56,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:56,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:56,679 INFO ]: Checked inductivity of 140 backedges. 30 proven. 108 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:56,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:56,679 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-22 01:49:56,685 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:49:56,715 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:49:56,715 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:56,717 INFO ]: Computing forward predicates... [2018-06-22 01:49:56,874 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:56,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:56,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-22 01:49:56,896 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:49:56,896 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:49:56,896 INFO ]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:49:56,896 INFO ]: Start difference. First operand 52 states and 59 transitions. Second operand 23 states. [2018-06-22 01:49:56,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:56,972 INFO ]: Finished difference Result 68 states and 75 transitions. [2018-06-22 01:49:56,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:49:56,973 INFO ]: Start accepts. Automaton has 23 states. Word has length 30 [2018-06-22 01:49:56,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:56,974 INFO ]: With dead ends: 68 [2018-06-22 01:49:56,974 INFO ]: Without dead ends: 68 [2018-06-22 01:49:56,974 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:49:56,974 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:49:56,976 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-06-22 01:49:56,976 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:49:56,976 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-06-22 01:49:56,976 INFO ]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 30 [2018-06-22 01:49:56,976 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:56,976 INFO ]: Abstraction has 47 states and 52 transitions. [2018-06-22 01:49:56,976 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:49:56,976 INFO ]: Start isEmpty. Operand 47 states and 52 transitions. [2018-06-22 01:49:56,977 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:49:56,977 INFO ]: Found error trace [2018-06-22 01:49:56,977 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:56,977 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:56,977 INFO ]: Analyzing trace with hash 1218306184, now seen corresponding path program 22 times [2018-06-22 01:49:56,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:56,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:56,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:56,977 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:56,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:56,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:57,288 INFO ]: Checked inductivity of 140 backedges. 30 proven. 108 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:57,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:57,288 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-22 01:49:57,294 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:49:57,315 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:49:57,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:57,317 INFO ]: Computing forward predicates... [2018-06-22 01:49:57,368 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:57,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:57,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-22 01:49:57,388 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:49:57,388 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:49:57,388 INFO ]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:49:57,388 INFO ]: Start difference. First operand 47 states and 52 transitions. Second operand 23 states. [2018-06-22 01:49:57,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:57,589 INFO ]: Finished difference Result 70 states and 77 transitions. [2018-06-22 01:49:57,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:49:57,589 INFO ]: Start accepts. Automaton has 23 states. Word has length 30 [2018-06-22 01:49:57,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:57,589 INFO ]: With dead ends: 70 [2018-06-22 01:49:57,589 INFO ]: Without dead ends: 48 [2018-06-22 01:49:57,589 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:49:57,590 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:49:57,591 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 01:49:57,591 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:49:57,592 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-06-22 01:49:57,592 INFO ]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-06-22 01:49:57,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:57,592 INFO ]: Abstraction has 48 states and 53 transitions. [2018-06-22 01:49:57,592 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:49:57,592 INFO ]: Start isEmpty. Operand 48 states and 53 transitions. [2018-06-22 01:49:57,592 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:49:57,592 INFO ]: Found error trace [2018-06-22 01:49:57,592 INFO ]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:57,592 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:57,592 INFO ]: Analyzing trace with hash -1197897724, now seen corresponding path program 23 times [2018-06-22 01:49:57,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:57,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:57,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:57,593 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:57,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:57,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:59,054 INFO ]: Checked inductivity of 157 backedges. 2 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:59,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:59,055 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-22 01:49:59,060 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:49:59,090 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:49:59,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:59,093 INFO ]: Computing forward predicates... [2018-06-22 01:49:59,547 INFO ]: Checked inductivity of 157 backedges. 2 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:49:59,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:59,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-06-22 01:49:59,567 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:49:59,567 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:49:59,567 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1702, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:49:59,567 INFO ]: Start difference. First operand 48 states and 53 transitions. Second operand 43 states. [2018-06-22 01:50:00,807 WARN ]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:50:00,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:00,895 INFO ]: Finished difference Result 71 states and 78 transitions. [2018-06-22 01:50:00,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:50:00,898 INFO ]: Start accepts. Automaton has 43 states. Word has length 31 [2018-06-22 01:50:00,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:00,899 INFO ]: With dead ends: 71 [2018-06-22 01:50:00,899 INFO ]: Without dead ends: 71 [2018-06-22 01:50:00,900 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=3261, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:50:00,900 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 01:50:00,905 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-22 01:50:00,905 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:50:00,905 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-06-22 01:50:00,905 INFO ]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 31 [2018-06-22 01:50:00,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:00,905 INFO ]: Abstraction has 55 states and 62 transitions. [2018-06-22 01:50:00,905 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:50:00,905 INFO ]: Start isEmpty. Operand 55 states and 62 transitions. [2018-06-22 01:50:00,906 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:50:00,906 INFO ]: Found error trace [2018-06-22 01:50:00,906 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:00,906 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:00,906 INFO ]: Analyzing trace with hash 1209192456, now seen corresponding path program 24 times [2018-06-22 01:50:00,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:00,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:00,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:00,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:00,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:00,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:01,254 INFO ]: Checked inductivity of 175 backedges. 38 proven. 135 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:01,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:01,273 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-22 01:50:01,281 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:50:01,312 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 01:50:01,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:01,314 INFO ]: Computing forward predicates... [2018-06-22 01:50:01,350 INFO ]: Checked inductivity of 175 backedges. 47 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:01,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:01,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-22 01:50:01,384 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:50:01,384 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:50:01,384 INFO ]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:50:01,385 INFO ]: Start difference. First operand 55 states and 62 transitions. Second operand 25 states. [2018-06-22 01:50:01,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:01,463 INFO ]: Finished difference Result 73 states and 80 transitions. [2018-06-22 01:50:01,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:50:01,463 INFO ]: Start accepts. Automaton has 25 states. Word has length 32 [2018-06-22 01:50:01,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:01,463 INFO ]: With dead ends: 73 [2018-06-22 01:50:01,463 INFO ]: Without dead ends: 73 [2018-06-22 01:50:01,464 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:50:01,464 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 01:50:01,466 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 50. [2018-06-22 01:50:01,466 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:50:01,466 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-06-22 01:50:01,466 INFO ]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 32 [2018-06-22 01:50:01,466 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:01,466 INFO ]: Abstraction has 50 states and 55 transitions. [2018-06-22 01:50:01,466 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:50:01,466 INFO ]: Start isEmpty. Operand 50 states and 55 transitions. [2018-06-22 01:50:01,468 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:50:01,468 INFO ]: Found error trace [2018-06-22 01:50:01,468 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:01,468 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:01,468 INFO ]: Analyzing trace with hash 1517991912, now seen corresponding path program 25 times [2018-06-22 01:50:01,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:01,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:01,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:01,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:01,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:01,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:01,770 INFO ]: Checked inductivity of 175 backedges. 38 proven. 135 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:01,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:01,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:01,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:01,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:01,803 INFO ]: Computing forward predicates... [2018-06-22 01:50:01,837 INFO ]: Checked inductivity of 175 backedges. 47 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:01,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:01,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-22 01:50:01,857 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:50:01,857 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:50:01,857 INFO ]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:50:01,857 INFO ]: Start difference. First operand 50 states and 55 transitions. Second operand 25 states. [2018-06-22 01:50:02,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:02,411 INFO ]: Finished difference Result 75 states and 82 transitions. [2018-06-22 01:50:02,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:50:02,412 INFO ]: Start accepts. Automaton has 25 states. Word has length 32 [2018-06-22 01:50:02,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:02,412 INFO ]: With dead ends: 75 [2018-06-22 01:50:02,412 INFO ]: Without dead ends: 51 [2018-06-22 01:50:02,413 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:50:02,413 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:50:02,415 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 01:50:02,415 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:50:02,416 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-06-22 01:50:02,416 INFO ]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 32 [2018-06-22 01:50:02,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:02,427 INFO ]: Abstraction has 51 states and 56 transitions. [2018-06-22 01:50:02,427 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:50:02,427 INFO ]: Start isEmpty. Operand 51 states and 56 transitions. [2018-06-22 01:50:02,427 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:50:02,427 INFO ]: Found error trace [2018-06-22 01:50:02,427 INFO ]: trace histogram [18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:02,428 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:02,428 INFO ]: Analyzing trace with hash -1171623836, now seen corresponding path program 26 times [2018-06-22 01:50:02,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:02,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:02,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:02,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:02,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:02,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:03,475 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:50:03,882 INFO ]: Checked inductivity of 194 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:03,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:03,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:03,889 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:50:03,915 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:50:03,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:03,918 INFO ]: Computing forward predicates... [2018-06-22 01:50:04,641 INFO ]: Checked inductivity of 194 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:04,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:04,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-06-22 01:50:04,661 INFO ]: Interpolant automaton has 47 states [2018-06-22 01:50:04,661 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 01:50:04,662 INFO ]: CoverageRelationStatistics Valid=114, Invalid=2048, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:50:04,662 INFO ]: Start difference. First operand 51 states and 56 transitions. Second operand 47 states. [2018-06-22 01:50:05,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:05,711 INFO ]: Finished difference Result 76 states and 83 transitions. [2018-06-22 01:50:05,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:50:05,711 INFO ]: Start accepts. Automaton has 47 states. Word has length 33 [2018-06-22 01:50:05,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:05,712 INFO ]: With dead ends: 76 [2018-06-22 01:50:05,712 INFO ]: Without dead ends: 76 [2018-06-22 01:50:05,713 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=305, Invalid=3855, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:50:05,713 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:50:05,716 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-06-22 01:50:05,716 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:50:05,716 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-06-22 01:50:05,716 INFO ]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 33 [2018-06-22 01:50:05,716 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:05,716 INFO ]: Abstraction has 58 states and 65 transitions. [2018-06-22 01:50:05,716 INFO ]: Interpolant automaton has 47 states. [2018-06-22 01:50:05,716 INFO ]: Start isEmpty. Operand 58 states and 65 transitions. [2018-06-22 01:50:05,717 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:50:05,717 INFO ]: Found error trace [2018-06-22 01:50:05,717 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:05,717 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:05,717 INFO ]: Analyzing trace with hash 1349633896, now seen corresponding path program 27 times [2018-06-22 01:50:05,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:05,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:05,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:05,718 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:05,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:05,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:06,151 INFO ]: Checked inductivity of 214 backedges. 47 proven. 165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:06,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:06,151 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:06,160 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:50:06,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:50:06,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:06,209 INFO ]: Computing forward predicates... [2018-06-22 01:50:06,733 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:06,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:06,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-22 01:50:06,769 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:50:06,769 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:50:06,769 INFO ]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:50:06,769 INFO ]: Start difference. First operand 58 states and 65 transitions. Second operand 27 states. [2018-06-22 01:50:07,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:07,028 INFO ]: Finished difference Result 78 states and 85 transitions. [2018-06-22 01:50:07,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:50:07,028 INFO ]: Start accepts. Automaton has 27 states. Word has length 34 [2018-06-22 01:50:07,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:07,028 INFO ]: With dead ends: 78 [2018-06-22 01:50:07,028 INFO ]: Without dead ends: 78 [2018-06-22 01:50:07,029 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:50:07,029 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:50:07,031 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 53. [2018-06-22 01:50:07,031 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:50:07,032 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-06-22 01:50:07,032 INFO ]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 34 [2018-06-22 01:50:07,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:07,032 INFO ]: Abstraction has 53 states and 58 transitions. [2018-06-22 01:50:07,032 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:50:07,032 INFO ]: Start isEmpty. Operand 53 states and 58 transitions. [2018-06-22 01:50:07,032 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:50:07,032 INFO ]: Found error trace [2018-06-22 01:50:07,032 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:07,032 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:07,033 INFO ]: Analyzing trace with hash -1962484856, now seen corresponding path program 28 times [2018-06-22 01:50:07,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:07,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:07,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:07,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:07,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:07,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:07,342 INFO ]: Checked inductivity of 214 backedges. 47 proven. 165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:07,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:07,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:07,349 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:50:07,393 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:50:07,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:07,396 INFO ]: Computing forward predicates... [2018-06-22 01:50:07,689 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:07,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:07,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-22 01:50:07,709 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:50:07,709 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:50:07,709 INFO ]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:50:07,709 INFO ]: Start difference. First operand 53 states and 58 transitions. Second operand 27 states. [2018-06-22 01:50:08,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:08,014 INFO ]: Finished difference Result 80 states and 87 transitions. [2018-06-22 01:50:08,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:50:08,015 INFO ]: Start accepts. Automaton has 27 states. Word has length 34 [2018-06-22 01:50:08,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:08,016 INFO ]: With dead ends: 80 [2018-06-22 01:50:08,016 INFO ]: Without dead ends: 54 [2018-06-22 01:50:08,016 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:50:08,016 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:50:08,018 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 01:50:08,018 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:50:08,018 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-06-22 01:50:08,018 INFO ]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-06-22 01:50:08,018 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:08,018 INFO ]: Abstraction has 54 states and 59 transitions. [2018-06-22 01:50:08,018 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:50:08,018 INFO ]: Start isEmpty. Operand 54 states and 59 transitions. [2018-06-22 01:50:08,019 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:50:08,019 INFO ]: Found error trace [2018-06-22 01:50:08,019 INFO ]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:08,019 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:08,019 INFO ]: Analyzing trace with hash -1112906492, now seen corresponding path program 29 times [2018-06-22 01:50:08,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:08,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:08,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:08,020 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:08,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:08,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:08,631 INFO ]: Checked inductivity of 235 backedges. 2 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:08,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:08,631 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:08,638 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:50:08,674 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:50:08,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:08,677 INFO ]: Computing forward predicates... [2018-06-22 01:50:09,425 INFO ]: Checked inductivity of 235 backedges. 2 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:09,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:09,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2018-06-22 01:50:09,444 INFO ]: Interpolant automaton has 51 states [2018-06-22 01:50:09,444 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 01:50:09,445 INFO ]: CoverageRelationStatistics Valid=124, Invalid=2426, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:50:09,445 INFO ]: Start difference. First operand 54 states and 59 transitions. Second operand 51 states. [2018-06-22 01:50:10,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:10,770 INFO ]: Finished difference Result 81 states and 88 transitions. [2018-06-22 01:50:10,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:50:10,770 INFO ]: Start accepts. Automaton has 51 states. Word has length 35 [2018-06-22 01:50:10,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:10,771 INFO ]: With dead ends: 81 [2018-06-22 01:50:10,771 INFO ]: Without dead ends: 81 [2018-06-22 01:50:10,773 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=331, Invalid=4499, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:50:10,773 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:50:10,775 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-06-22 01:50:10,775 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 01:50:10,776 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-06-22 01:50:10,776 INFO ]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 35 [2018-06-22 01:50:10,776 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:10,776 INFO ]: Abstraction has 61 states and 68 transitions. [2018-06-22 01:50:10,776 INFO ]: Interpolant automaton has 51 states. [2018-06-22 01:50:10,776 INFO ]: Start isEmpty. Operand 61 states and 68 transitions. [2018-06-22 01:50:10,777 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:50:10,777 INFO ]: Found error trace [2018-06-22 01:50:10,777 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:10,777 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:10,777 INFO ]: Analyzing trace with hash -545780984, now seen corresponding path program 30 times [2018-06-22 01:50:10,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:10,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:10,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:10,777 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:10,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:10,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:11,283 INFO ]: Checked inductivity of 257 backedges. 57 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:11,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:11,283 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:11,290 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:50:11,327 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 01:50:11,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:11,329 INFO ]: Computing forward predicates... [2018-06-22 01:50:11,365 INFO ]: Checked inductivity of 257 backedges. 68 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:11,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:11,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-22 01:50:11,386 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:50:11,386 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:50:11,386 INFO ]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:50:11,386 INFO ]: Start difference. First operand 61 states and 68 transitions. Second operand 29 states. [2018-06-22 01:50:11,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:11,662 INFO ]: Finished difference Result 83 states and 90 transitions. [2018-06-22 01:50:11,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:50:11,662 INFO ]: Start accepts. Automaton has 29 states. Word has length 36 [2018-06-22 01:50:11,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:11,662 INFO ]: With dead ends: 83 [2018-06-22 01:50:11,662 INFO ]: Without dead ends: 83 [2018-06-22 01:50:11,663 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:50:11,663 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:50:11,665 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-06-22 01:50:11,665 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:50:11,665 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-06-22 01:50:11,665 INFO ]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 36 [2018-06-22 01:50:11,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:11,665 INFO ]: Abstraction has 56 states and 61 transitions. [2018-06-22 01:50:11,665 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:50:11,665 INFO ]: Start isEmpty. Operand 56 states and 61 transitions. [2018-06-22 01:50:11,666 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:50:11,666 INFO ]: Found error trace [2018-06-22 01:50:11,666 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:11,666 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:11,666 INFO ]: Analyzing trace with hash -142247192, now seen corresponding path program 31 times [2018-06-22 01:50:11,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:11,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:11,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:11,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:11,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:11,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:12,428 INFO ]: Checked inductivity of 257 backedges. 57 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:12,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:12,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:12,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:12,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:12,472 INFO ]: Computing forward predicates... [2018-06-22 01:50:12,515 INFO ]: Checked inductivity of 257 backedges. 68 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:12,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:12,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-22 01:50:12,536 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:50:12,536 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:50:12,536 INFO ]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:50:12,537 INFO ]: Start difference. First operand 56 states and 61 transitions. Second operand 29 states. [2018-06-22 01:50:12,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:12,972 INFO ]: Finished difference Result 85 states and 92 transitions. [2018-06-22 01:50:12,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:50:12,976 INFO ]: Start accepts. Automaton has 29 states. Word has length 36 [2018-06-22 01:50:12,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:12,977 INFO ]: With dead ends: 85 [2018-06-22 01:50:12,977 INFO ]: Without dead ends: 57 [2018-06-22 01:50:12,977 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:50:12,978 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:50:12,979 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-22 01:50:12,979 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:50:12,980 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-22 01:50:12,980 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 36 [2018-06-22 01:50:12,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:12,980 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-22 01:50:12,980 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:50:12,980 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-22 01:50:12,980 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:50:12,980 INFO ]: Found error trace [2018-06-22 01:50:12,980 INFO ]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:12,980 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:12,981 INFO ]: Analyzing trace with hash 258774372, now seen corresponding path program 32 times [2018-06-22 01:50:12,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:12,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:12,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:12,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:12,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:12,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:14,065 INFO ]: Checked inductivity of 280 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:14,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:14,065 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:14,071 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:50:14,134 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:50:14,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:14,138 INFO ]: Computing forward predicates... [2018-06-22 01:50:15,400 INFO ]: Checked inductivity of 280 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:15,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:15,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2018-06-22 01:50:15,420 INFO ]: Interpolant automaton has 55 states [2018-06-22 01:50:15,420 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-22 01:50:15,421 INFO ]: CoverageRelationStatistics Valid=134, Invalid=2836, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:50:15,421 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 55 states. [2018-06-22 01:50:16,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:16,711 INFO ]: Finished difference Result 86 states and 93 transitions. [2018-06-22 01:50:16,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:50:16,711 INFO ]: Start accepts. Automaton has 55 states. Word has length 37 [2018-06-22 01:50:16,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:16,711 INFO ]: With dead ends: 86 [2018-06-22 01:50:16,711 INFO ]: Without dead ends: 86 [2018-06-22 01:50:16,712 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=357, Invalid=5193, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:50:16,712 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:50:16,714 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-06-22 01:50:16,714 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:50:16,714 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-06-22 01:50:16,714 INFO ]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 37 [2018-06-22 01:50:16,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:16,714 INFO ]: Abstraction has 64 states and 71 transitions. [2018-06-22 01:50:16,714 INFO ]: Interpolant automaton has 55 states. [2018-06-22 01:50:16,714 INFO ]: Start isEmpty. Operand 64 states and 71 transitions. [2018-06-22 01:50:16,714 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:50:16,714 INFO ]: Found error trace [2018-06-22 01:50:16,715 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:16,715 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:16,715 INFO ]: Analyzing trace with hash -194459032, now seen corresponding path program 33 times [2018-06-22 01:50:16,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:16,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:16,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:16,715 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:16,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:16,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:17,215 INFO ]: Checked inductivity of 304 backedges. 68 proven. 234 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:17,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:17,215 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:17,220 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:50:17,275 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 01:50:17,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:17,280 INFO ]: Computing forward predicates... [2018-06-22 01:50:17,907 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:17,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:17,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-22 01:50:17,940 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:50:17,941 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:50:17,941 INFO ]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:50:17,941 INFO ]: Start difference. First operand 64 states and 71 transitions. Second operand 31 states. [2018-06-22 01:50:18,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:18,078 INFO ]: Finished difference Result 88 states and 95 transitions. [2018-06-22 01:50:18,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:50:18,079 INFO ]: Start accepts. Automaton has 31 states. Word has length 38 [2018-06-22 01:50:18,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:18,079 INFO ]: With dead ends: 88 [2018-06-22 01:50:18,079 INFO ]: Without dead ends: 88 [2018-06-22 01:50:18,080 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:50:18,080 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:50:18,084 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 59. [2018-06-22 01:50:18,084 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:50:18,084 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-06-22 01:50:18,084 INFO ]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 38 [2018-06-22 01:50:18,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:18,084 INFO ]: Abstraction has 59 states and 64 transitions. [2018-06-22 01:50:18,084 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:50:18,084 INFO ]: Start isEmpty. Operand 59 states and 64 transitions. [2018-06-22 01:50:18,085 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:50:18,085 INFO ]: Found error trace [2018-06-22 01:50:18,085 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:18,085 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:18,085 INFO ]: Analyzing trace with hash -569813368, now seen corresponding path program 34 times [2018-06-22 01:50:18,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:18,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:18,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:18,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:18,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:18,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:18,416 INFO ]: Checked inductivity of 304 backedges. 68 proven. 234 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:18,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:18,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:18,422 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:50:18,452 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:50:18,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:18,456 INFO ]: Computing forward predicates... [2018-06-22 01:50:18,530 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:18,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:18,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-22 01:50:18,553 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:50:18,553 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:50:18,553 INFO ]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:50:18,553 INFO ]: Start difference. First operand 59 states and 64 transitions. Second operand 31 states. [2018-06-22 01:50:18,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:18,852 INFO ]: Finished difference Result 90 states and 97 transitions. [2018-06-22 01:50:18,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:50:18,855 INFO ]: Start accepts. Automaton has 31 states. Word has length 38 [2018-06-22 01:50:18,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:18,856 INFO ]: With dead ends: 90 [2018-06-22 01:50:18,856 INFO ]: Without dead ends: 60 [2018-06-22 01:50:18,857 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:50:18,857 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:50:18,861 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 01:50:18,861 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:50:18,861 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-06-22 01:50:18,861 INFO ]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2018-06-22 01:50:18,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:18,861 INFO ]: Abstraction has 60 states and 65 transitions. [2018-06-22 01:50:18,861 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:50:18,861 INFO ]: Start isEmpty. Operand 60 states and 65 transitions. [2018-06-22 01:50:18,862 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:50:18,862 INFO ]: Found error trace [2018-06-22 01:50:18,862 INFO ]: trace histogram [24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:18,862 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:18,862 INFO ]: Analyzing trace with hash -1735147004, now seen corresponding path program 35 times [2018-06-22 01:50:18,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:18,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:18,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:18,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:18,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:18,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:19,527 INFO ]: Checked inductivity of 329 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:19,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:19,527 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:19,534 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:50:19,613 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-22 01:50:19,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:19,616 INFO ]: Computing forward predicates... [2018-06-22 01:50:20,510 INFO ]: Checked inductivity of 329 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:20,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:20,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-06-22 01:50:20,544 INFO ]: Interpolant automaton has 59 states [2018-06-22 01:50:20,544 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-22 01:50:20,544 INFO ]: CoverageRelationStatistics Valid=144, Invalid=3278, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:50:20,544 INFO ]: Start difference. First operand 60 states and 65 transitions. Second operand 59 states. [2018-06-22 01:50:22,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:22,028 INFO ]: Finished difference Result 91 states and 98 transitions. [2018-06-22 01:50:22,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:50:22,129 INFO ]: Start accepts. Automaton has 59 states. Word has length 39 [2018-06-22 01:50:22,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:22,130 INFO ]: With dead ends: 91 [2018-06-22 01:50:22,130 INFO ]: Without dead ends: 91 [2018-06-22 01:50:22,130 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=383, Invalid=5937, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:50:22,130 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:50:22,134 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-06-22 01:50:22,134 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:50:22,135 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-06-22 01:50:22,135 INFO ]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 39 [2018-06-22 01:50:22,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:22,135 INFO ]: Abstraction has 67 states and 74 transitions. [2018-06-22 01:50:22,135 INFO ]: Interpolant automaton has 59 states. [2018-06-22 01:50:22,135 INFO ]: Start isEmpty. Operand 67 states and 74 transitions. [2018-06-22 01:50:22,139 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:50:22,139 INFO ]: Found error trace [2018-06-22 01:50:22,139 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:22,139 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:22,139 INFO ]: Analyzing trace with hash 794215944, now seen corresponding path program 36 times [2018-06-22 01:50:22,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:22,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:22,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:22,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:22,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:22,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:22,479 INFO ]: Checked inductivity of 355 backedges. 80 proven. 273 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:22,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:22,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:22,485 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:50:22,530 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 01:50:22,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:22,533 INFO ]: Computing forward predicates... [2018-06-22 01:50:22,592 INFO ]: Checked inductivity of 355 backedges. 93 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:22,611 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:22,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-06-22 01:50:22,611 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:50:22,612 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:50:22,612 INFO ]: CoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:50:22,612 INFO ]: Start difference. First operand 67 states and 74 transitions. Second operand 33 states. [2018-06-22 01:50:22,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:22,757 INFO ]: Finished difference Result 93 states and 100 transitions. [2018-06-22 01:50:22,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:50:22,758 INFO ]: Start accepts. Automaton has 33 states. Word has length 40 [2018-06-22 01:50:22,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:22,758 INFO ]: With dead ends: 93 [2018-06-22 01:50:22,758 INFO ]: Without dead ends: 93 [2018-06-22 01:50:22,758 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:50:22,758 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:50:22,760 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 62. [2018-06-22 01:50:22,760 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:50:22,761 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-06-22 01:50:22,761 INFO ]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 40 [2018-06-22 01:50:22,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:22,761 INFO ]: Abstraction has 62 states and 67 transitions. [2018-06-22 01:50:22,761 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:50:22,761 INFO ]: Start isEmpty. Operand 62 states and 67 transitions. [2018-06-22 01:50:22,761 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:50:22,761 INFO ]: Found error trace [2018-06-22 01:50:22,761 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:22,762 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:22,762 INFO ]: Analyzing trace with hash 2043133416, now seen corresponding path program 37 times [2018-06-22 01:50:22,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:22,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:22,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:22,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:23,124 INFO ]: Checked inductivity of 355 backedges. 80 proven. 273 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:23,124 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:23,124 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:23,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:23,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:23,164 INFO ]: Computing forward predicates... [2018-06-22 01:50:23,205 INFO ]: Checked inductivity of 355 backedges. 93 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:23,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:23,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-06-22 01:50:23,226 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:50:23,226 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:50:23,226 INFO ]: CoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:50:23,226 INFO ]: Start difference. First operand 62 states and 67 transitions. Second operand 33 states. [2018-06-22 01:50:23,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:23,598 INFO ]: Finished difference Result 95 states and 102 transitions. [2018-06-22 01:50:23,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:50:23,598 INFO ]: Start accepts. Automaton has 33 states. Word has length 40 [2018-06-22 01:50:23,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:23,598 INFO ]: With dead ends: 95 [2018-06-22 01:50:23,598 INFO ]: Without dead ends: 63 [2018-06-22 01:50:23,599 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1833, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:50:23,599 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:50:23,601 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-22 01:50:23,601 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:50:23,601 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-06-22 01:50:23,601 INFO ]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2018-06-22 01:50:23,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:23,601 INFO ]: Abstraction has 63 states and 68 transitions. [2018-06-22 01:50:23,601 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:50:23,601 INFO ]: Start isEmpty. Operand 63 states and 68 transitions. [2018-06-22 01:50:23,602 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:50:23,602 INFO ]: Found error trace [2018-06-22 01:50:23,602 INFO ]: trace histogram [26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:23,602 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:23,602 INFO ]: Analyzing trace with hash -1150993820, now seen corresponding path program 38 times [2018-06-22 01:50:23,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:23,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:23,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:23,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:23,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:23,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:24,460 INFO ]: Checked inductivity of 382 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:24,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:24,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:24,466 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:50:24,502 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:50:24,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:24,505 INFO ]: Computing forward predicates... [2018-06-22 01:50:25,523 INFO ]: Checked inductivity of 382 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:25,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:25,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 63 [2018-06-22 01:50:25,544 INFO ]: Interpolant automaton has 63 states [2018-06-22 01:50:25,544 INFO ]: Constructing interpolant automaton starting with 63 interpolants. [2018-06-22 01:50:25,544 INFO ]: CoverageRelationStatistics Valid=154, Invalid=3752, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:50:25,544 INFO ]: Start difference. First operand 63 states and 68 transitions. Second operand 63 states. [2018-06-22 01:50:25,822 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-06-22 01:50:27,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:27,483 INFO ]: Finished difference Result 96 states and 103 transitions. [2018-06-22 01:50:27,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:50:27,485 INFO ]: Start accepts. Automaton has 63 states. Word has length 41 [2018-06-22 01:50:27,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:27,486 INFO ]: With dead ends: 96 [2018-06-22 01:50:27,486 INFO ]: Without dead ends: 96 [2018-06-22 01:50:27,486 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=409, Invalid=6731, Unknown=0, NotChecked=0, Total=7140 [2018-06-22 01:50:27,486 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 01:50:27,488 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 70. [2018-06-22 01:50:27,488 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:50:27,488 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-06-22 01:50:27,488 INFO ]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2018-06-22 01:50:27,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:27,488 INFO ]: Abstraction has 70 states and 77 transitions. [2018-06-22 01:50:27,488 INFO ]: Interpolant automaton has 63 states. [2018-06-22 01:50:27,488 INFO ]: Start isEmpty. Operand 70 states and 77 transitions. [2018-06-22 01:50:27,489 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:50:27,489 INFO ]: Found error trace [2018-06-22 01:50:27,489 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:27,489 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:27,489 INFO ]: Analyzing trace with hash -1384690328, now seen corresponding path program 39 times [2018-06-22 01:50:27,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:27,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:27,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:27,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:27,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:27,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:28,197 INFO ]: Checked inductivity of 410 backedges. 93 proven. 315 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:28,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:28,198 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:28,203 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:50:28,252 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-22 01:50:28,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:28,256 INFO ]: Computing forward predicates... [2018-06-22 01:50:28,352 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:28,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:28,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-06-22 01:50:28,378 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:50:28,378 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:50:28,379 INFO ]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:50:28,379 INFO ]: Start difference. First operand 70 states and 77 transitions. Second operand 35 states. [2018-06-22 01:50:29,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:29,024 INFO ]: Finished difference Result 98 states and 105 transitions. [2018-06-22 01:50:29,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:50:29,024 INFO ]: Start accepts. Automaton has 35 states. Word has length 42 [2018-06-22 01:50:29,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:29,025 INFO ]: With dead ends: 98 [2018-06-22 01:50:29,025 INFO ]: Without dead ends: 98 [2018-06-22 01:50:29,025 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:50:29,025 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:50:29,028 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 65. [2018-06-22 01:50:29,028 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:50:29,028 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-06-22 01:50:29,028 INFO ]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 42 [2018-06-22 01:50:29,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:29,029 INFO ]: Abstraction has 65 states and 70 transitions. [2018-06-22 01:50:29,029 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:50:29,029 INFO ]: Start isEmpty. Operand 65 states and 70 transitions. [2018-06-22 01:50:29,032 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:50:29,032 INFO ]: Found error trace [2018-06-22 01:50:29,032 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:29,032 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:29,032 INFO ]: Analyzing trace with hash -1322954360, now seen corresponding path program 40 times [2018-06-22 01:50:29,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:29,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:29,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:29,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:29,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:29,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:29,562 INFO ]: Checked inductivity of 410 backedges. 93 proven. 315 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:29,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:29,563 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:29,569 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:50:29,602 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:50:29,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:29,605 INFO ]: Computing forward predicates... [2018-06-22 01:50:29,646 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:29,673 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:29,673 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-06-22 01:50:29,673 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:50:29,673 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:50:29,674 INFO ]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:50:29,674 INFO ]: Start difference. First operand 65 states and 70 transitions. Second operand 35 states. [2018-06-22 01:50:30,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:30,150 INFO ]: Finished difference Result 100 states and 107 transitions. [2018-06-22 01:50:30,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:50:30,150 INFO ]: Start accepts. Automaton has 35 states. Word has length 42 [2018-06-22 01:50:30,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:30,151 INFO ]: With dead ends: 100 [2018-06-22 01:50:30,151 INFO ]: Without dead ends: 66 [2018-06-22 01:50:30,151 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:50:30,151 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:50:30,154 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 01:50:30,154 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:50:30,154 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-06-22 01:50:30,154 INFO ]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 42 [2018-06-22 01:50:30,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:30,154 INFO ]: Abstraction has 66 states and 71 transitions. [2018-06-22 01:50:30,154 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:50:30,154 INFO ]: Start isEmpty. Operand 66 states and 71 transitions. [2018-06-22 01:50:30,155 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:50:30,155 INFO ]: Found error trace [2018-06-22 01:50:30,155 INFO ]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:30,155 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:30,155 INFO ]: Analyzing trace with hash 22388484, now seen corresponding path program 41 times [2018-06-22 01:50:30,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:30,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:30,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:30,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:30,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:30,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:31,399 INFO ]: Checked inductivity of 439 backedges. 2 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:31,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:31,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:31,405 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:50:31,454 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-22 01:50:31,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:31,457 INFO ]: Computing forward predicates... [2018-06-22 01:50:32,568 INFO ]: Checked inductivity of 439 backedges. 2 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:32,587 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:32,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-06-22 01:50:32,587 INFO ]: Interpolant automaton has 67 states [2018-06-22 01:50:32,588 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-22 01:50:32,588 INFO ]: CoverageRelationStatistics Valid=164, Invalid=4258, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:50:32,588 INFO ]: Start difference. First operand 66 states and 71 transitions. Second operand 67 states. [2018-06-22 01:50:34,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:34,181 INFO ]: Finished difference Result 101 states and 108 transitions. [2018-06-22 01:50:34,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:50:34,181 INFO ]: Start accepts. Automaton has 67 states. Word has length 43 [2018-06-22 01:50:34,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:34,182 INFO ]: With dead ends: 101 [2018-06-22 01:50:34,182 INFO ]: Without dead ends: 101 [2018-06-22 01:50:34,182 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=435, Invalid=7575, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 01:50:34,183 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 01:50:34,185 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 73. [2018-06-22 01:50:34,185 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 01:50:34,186 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-06-22 01:50:34,186 INFO ]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 43 [2018-06-22 01:50:34,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:34,187 INFO ]: Abstraction has 73 states and 80 transitions. [2018-06-22 01:50:34,187 INFO ]: Interpolant automaton has 67 states. [2018-06-22 01:50:34,187 INFO ]: Start isEmpty. Operand 73 states and 80 transitions. [2018-06-22 01:50:34,187 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:50:34,187 INFO ]: Found error trace [2018-06-22 01:50:34,187 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:34,187 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:34,187 INFO ]: Analyzing trace with hash -1221656312, now seen corresponding path program 42 times [2018-06-22 01:50:34,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:34,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:34,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:34,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:34,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:34,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:34,596 INFO ]: Checked inductivity of 469 backedges. 107 proven. 360 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:34,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:34,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:34,602 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:50:34,655 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 01:50:34,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:34,658 INFO ]: Computing forward predicates... [2018-06-22 01:50:34,700 INFO ]: Checked inductivity of 469 backedges. 122 proven. 345 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:34,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:34,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-06-22 01:50:34,720 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:50:34,720 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:50:34,720 INFO ]: CoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:50:34,721 INFO ]: Start difference. First operand 73 states and 80 transitions. Second operand 37 states. [2018-06-22 01:50:35,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:35,491 INFO ]: Finished difference Result 103 states and 110 transitions. [2018-06-22 01:50:35,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:50:35,491 INFO ]: Start accepts. Automaton has 37 states. Word has length 44 [2018-06-22 01:50:35,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:35,492 INFO ]: With dead ends: 103 [2018-06-22 01:50:35,492 INFO ]: Without dead ends: 103 [2018-06-22 01:50:35,492 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:50:35,492 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:50:35,494 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 68. [2018-06-22 01:50:35,494 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 01:50:35,494 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-06-22 01:50:35,495 INFO ]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 44 [2018-06-22 01:50:35,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:35,495 INFO ]: Abstraction has 68 states and 73 transitions. [2018-06-22 01:50:35,495 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:50:35,495 INFO ]: Start isEmpty. Operand 68 states and 73 transitions. [2018-06-22 01:50:35,495 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:50:35,495 INFO ]: Found error trace [2018-06-22 01:50:35,495 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:35,495 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:35,495 INFO ]: Analyzing trace with hash 692158696, now seen corresponding path program 43 times [2018-06-22 01:50:35,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:35,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:35,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:35,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:50:35,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:35,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:35,862 INFO ]: Checked inductivity of 469 backedges. 107 proven. 360 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:35,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:50:35,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:50:35,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:35,903 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:50:35,906 INFO ]: Computing forward predicates... [2018-06-22 01:50:35,945 INFO ]: Checked inductivity of 469 backedges. 122 proven. 345 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:50:35,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:50:35,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-06-22 01:50:35,965 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:50:35,965 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:50:35,965 INFO ]: CoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:50:35,965 INFO ]: Start difference. First operand 68 states and 73 transitions. Second operand 37 states. [2018-06-22 01:50:36,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:50:36,381 INFO ]: Finished difference Result 105 states and 112 transitions. [2018-06-22 01:50:36,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:50:36,381 INFO ]: Start accepts. Automaton has 37 states. Word has length 44 [2018-06-22 01:50:36,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:50:36,382 INFO ]: With dead ends: 105 [2018-06-22 01:50:36,382 INFO ]: Without dead ends: 69 [2018-06-22 01:50:36,382 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:50:36,382 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:50:36,383 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 01:50:36,383 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:50:36,384 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-06-22 01:50:36,384 INFO ]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 44 [2018-06-22 01:50:36,384 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:50:36,384 INFO ]: Abstraction has 69 states and 74 transitions. [2018-06-22 01:50:36,384 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:50:36,384 INFO ]: Start isEmpty. Operand 69 states and 74 transitions. [2018-06-22 01:50:36,385 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:50:36,385 INFO ]: Found error trace [2018-06-22 01:50:36,385 INFO ]: trace histogram [30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:50:36,385 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:50:36,385 INFO ]: Analyzing trace with hash 781475684, now seen corresponding path program 44 times [2018-06-22 01:50:36,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:50:36,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:50:36,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:36,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:50:36,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:50:36,405 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:50:36,816 WARN ]: Verification canceled [2018-06-22 01:50:36,822 WARN ]: Timeout [2018-06-22 01:50:36,822 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:50:36 BoogieIcfgContainer [2018-06-22 01:50:36,823 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:50:36,823 INFO ]: Toolchain (without parser) took 59586.20 ms. Allocated memory was 297.3 MB in the beginning and 626.0 MB in the end (delta: 328.7 MB). Free memory was 253.6 MB in the beginning and 543.2 MB in the end (delta: -289.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:50:36,824 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 297.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:50:36,824 INFO ]: ChcToBoogie took 62.78 ms. Allocated memory is still 297.3 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:50:36,829 INFO ]: Boogie Preprocessor took 38.63 ms. Allocated memory is still 297.3 MB. Free memory was 251.6 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:50:36,830 INFO ]: RCFGBuilder took 270.48 ms. Allocated memory is still 297.3 MB. Free memory was 249.7 MB in the beginning and 243.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:50:36,830 INFO ]: TraceAbstraction took 59199.06 ms. Allocated memory was 297.3 MB in the beginning and 626.0 MB in the end (delta: 328.7 MB). Free memory was 243.7 MB in the beginning and 543.2 MB in the end (delta: -299.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:50:36,835 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 297.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.78 ms. Allocated memory is still 297.3 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.63 ms. Allocated memory is still 297.3 MB. Free memory was 251.6 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 270.48 ms. Allocated memory is still 297.3 MB. Free memory was 249.7 MB in the beginning and 243.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59199.06 ms. Allocated memory was 297.3 MB in the beginning and 626.0 MB in the end (delta: 328.7 MB). Free memory was 243.7 MB in the beginning and 543.2 MB in the end (delta: -299.5 MB). Peak memory consumption was 29.2 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 (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 46 with TraceHistMax 30, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 44 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 59.0s OverallTime, 46 OverallIterations, 30 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 435 SDtfs, 1362 SDslu, 4496 SDs, 0 SdLazy, 17280 SolverSat, 1170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2625 GetRequests, 1023 SyntacticMatches, 18 SemanticMatches, 1584 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13357 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 518 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 2645 NumberOfCodeBlocks, 2645 NumberOfCodeBlocksAsserted, 278 NumberOfCheckSat, 2556 ConstructedInterpolants, 0 QuantifiedInterpolants, 347615 SizeOfPredicates, 250 NumberOfNonLiveVariables, 9405 ConjunctsInSsa, 2195 ConjunctsInUnsatCore, 89 InterpolantComputations, 1 PerfectInterpolantSequences, 2831/15466 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/map_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-50-36-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/map_map.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-50-36-850.csv Completed graceful shutdown