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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:02:00,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:02:00,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:02:00,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:02:00,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:02:00,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:02:00,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:02:00,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:02:00,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:02:00,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:02:00,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:02:00,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:02:00,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:02:00,909 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:02:00,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:02:00,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:02:00,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:02:00,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:02:00,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:02:00,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:02:00,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:02:00,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:02:00,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:02:00,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:02:00,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:02:00,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:02:00,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:02:00,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:02:00,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:02:00,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:02:00,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:02:00,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:02:00,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:02:00,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:02:00,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:02:00,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:02:00,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:02:00,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:02:00,952 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:02:00,952 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:02:00,953 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:02:00,954 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:02:00,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:02:00,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:02:00,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:02:00,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:02:00,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:02:00,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:02:00,955 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:02:00,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:02:00,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:02:00,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:02:00,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:02:00,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:02:00,956 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:02:00,957 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:02:00,958 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:02:01,007 INFO ]: Repository-Root is: /tmp [2018-06-22 11:02:01,021 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:02:01,026 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:02:01,027 INFO ]: Initializing SmtParser... [2018-06-22 11:02:01,028 INFO ]: SmtParser initialized [2018-06-22 11:02:01,028 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-22 11:02:01,029 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 11:02:01,124 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 unknown [2018-06-22 11:02:01,380 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-22 11:02:01,385 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:02:01,390 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:02:01,391 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:02:01,391 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:02:01,391 INFO ]: ChcToBoogie initialized [2018-06-22 11:02:01,395 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01 Unit [2018-06-22 11:02:01,437 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:02:01,437 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:02:01,437 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:02:01,437 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:02:01,456 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,456 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,465 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,465 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,470 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,472 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,481 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (1/1) ... [2018-06-22 11:02:01,483 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:02:01,483 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:02:01,483 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:02:01,483 INFO ]: RCFGBuilder initialized [2018-06-22 11:02:01,484 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (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 11:02:01,500 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:02:01,500 INFO ]: Found specification of procedure False [2018-06-22 11:02:01,500 INFO ]: Found implementation of procedure False [2018-06-22 11:02:01,500 INFO ]: Specification and implementation of procedure inv_main9 given in one single declaration [2018-06-22 11:02:01,500 INFO ]: Found specification of procedure inv_main9 [2018-06-22 11:02:01,500 INFO ]: Found implementation of procedure inv_main9 [2018-06-22 11:02:01,500 INFO ]: Specification and implementation of procedure inv_main7 given in one single declaration [2018-06-22 11:02:01,500 INFO ]: Found specification of procedure inv_main7 [2018-06-22 11:02:01,500 INFO ]: Found implementation of procedure inv_main7 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main2 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main2 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main2 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main12 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main12 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main12 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main8 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main8 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main8 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main15 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main15 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main15 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main6 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main6 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main6 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure inv_main20 given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure inv_main20 [2018-06-22 11:02:01,501 INFO ]: Found implementation of procedure inv_main20 [2018-06-22 11:02:01,501 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:02:01,501 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:02:01,501 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 11:02:01,836 INFO ]: Using library mode [2018-06-22 11:02:01,837 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:02:01 BoogieIcfgContainer [2018-06-22 11:02:01,837 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:02:01,838 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:02:01,838 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:02:01,841 INFO ]: TraceAbstraction initialized [2018-06-22 11:02:01,841 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:02:01" (1/3) ... [2018-06-22 11:02:01,842 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610b61ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:02:01, skipping insertion in model container [2018-06-22 11:02:01,842 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:01" (2/3) ... [2018-06-22 11:02:01,842 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610b61ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:02:01, skipping insertion in model container [2018-06-22 11:02:01,842 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:02:01" (3/3) ... [2018-06-22 11:02:01,844 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:02:01,853 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:02:01,861 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:02:01,903 INFO ]: Using default assertion order modulation [2018-06-22 11:02:01,903 INFO ]: Interprodecural is true [2018-06-22 11:02:01,904 INFO ]: Hoare is false [2018-06-22 11:02:01,904 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:02:01,904 INFO ]: Backedges is TWOTRACK [2018-06-22 11:02:01,904 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:02:01,904 INFO ]: Difference is false [2018-06-22 11:02:01,904 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:02:01,904 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:02:01,920 INFO ]: Start isEmpty. Operand 48 states. [2018-06-22 11:02:01,933 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:02:01,933 INFO ]: Found error trace [2018-06-22 11:02:01,934 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:01,934 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:01,941 INFO ]: Analyzing trace with hash 692409773, now seen corresponding path program 1 times [2018-06-22 11:02:01,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:01,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:01,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:01,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:01,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:02,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:02,143 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:02,145 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:02,145 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:02,146 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:02,157 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:02,157 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:02,159 INFO ]: Start difference. First operand 48 states. Second operand 6 states. [2018-06-22 11:02:02,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:02,374 INFO ]: Finished difference Result 52 states and 68 transitions. [2018-06-22 11:02:02,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:02,377 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:02:02,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:02,387 INFO ]: With dead ends: 52 [2018-06-22 11:02:02,387 INFO ]: Without dead ends: 52 [2018-06-22 11:02:02,388 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:02,401 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:02:02,440 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:02:02,443 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:02:02,445 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-06-22 11:02:02,447 INFO ]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 17 [2018-06-22 11:02:02,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:02,449 INFO ]: Abstraction has 50 states and 66 transitions. [2018-06-22 11:02:02,449 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:02,449 INFO ]: Start isEmpty. Operand 50 states and 66 transitions. [2018-06-22 11:02:02,452 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:02:02,452 INFO ]: Found error trace [2018-06-22 11:02:02,452 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:02,453 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:02,453 INFO ]: Analyzing trace with hash -1516008341, now seen corresponding path program 1 times [2018-06-22 11:02:02,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:02,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:02,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:02,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:02,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:02,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:02,812 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:02,812 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:02,812 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:02,813 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:02,814 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:02,814 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:02,814 INFO ]: Start difference. First operand 50 states and 66 transitions. Second operand 6 states. [2018-06-22 11:02:03,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:03,137 INFO ]: Finished difference Result 56 states and 73 transitions. [2018-06-22 11:02:03,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:03,138 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:02:03,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:03,140 INFO ]: With dead ends: 56 [2018-06-22 11:02:03,140 INFO ]: Without dead ends: 56 [2018-06-22 11:02:03,141 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:03,141 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:02:03,157 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-06-22 11:02:03,157 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:02:03,158 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2018-06-22 11:02:03,158 INFO ]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 17 [2018-06-22 11:02:03,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:03,158 INFO ]: Abstraction has 54 states and 71 transitions. [2018-06-22 11:02:03,159 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:03,159 INFO ]: Start isEmpty. Operand 54 states and 71 transitions. [2018-06-22 11:02:03,160 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:02:03,160 INFO ]: Found error trace [2018-06-22 11:02:03,160 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:03,160 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:03,160 INFO ]: Analyzing trace with hash -1544058926, now seen corresponding path program 1 times [2018-06-22 11:02:03,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:03,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:03,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:03,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:03,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:03,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:03,397 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-06-22 11:02:03,460 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:03,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:03,460 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 11:02:03,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:03,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:03,493 INFO ]: Computing forward predicates... [2018-06-22 11:02:03,897 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:03,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:03,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:02:03,927 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:02:03,927 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:02:03,927 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:02:03,928 INFO ]: Start difference. First operand 54 states and 71 transitions. Second operand 13 states. [2018-06-22 11:02:04,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:04,491 INFO ]: Finished difference Result 60 states and 78 transitions. [2018-06-22 11:02:04,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:02:04,492 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:02:04,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:04,493 INFO ]: With dead ends: 60 [2018-06-22 11:02:04,493 INFO ]: Without dead ends: 60 [2018-06-22 11:02:04,494 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:04,494 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:02:04,504 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-06-22 11:02:04,504 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:02:04,505 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2018-06-22 11:02:04,505 INFO ]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 21 [2018-06-22 11:02:04,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:04,505 INFO ]: Abstraction has 56 states and 74 transitions. [2018-06-22 11:02:04,505 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:02:04,505 INFO ]: Start isEmpty. Operand 56 states and 74 transitions. [2018-06-22 11:02:04,506 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:02:04,506 INFO ]: Found error trace [2018-06-22 11:02:04,506 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:04,506 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:04,506 INFO ]: Analyzing trace with hash 386506573, now seen corresponding path program 1 times [2018-06-22 11:02:04,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:04,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:04,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:04,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:04,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:04,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:04,630 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:04,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:04,630 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 11:02:04,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:04,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:04,662 INFO ]: Computing forward predicates... [2018-06-22 11:02:04,815 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:04,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:04,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:02:04,889 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:02:04,889 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:02:04,889 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:02:04,889 INFO ]: Start difference. First operand 56 states and 74 transitions. Second operand 13 states. [2018-06-22 11:02:05,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:05,393 INFO ]: Finished difference Result 62 states and 81 transitions. [2018-06-22 11:02:05,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:02:05,393 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:02:05,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:05,395 INFO ]: With dead ends: 62 [2018-06-22 11:02:05,395 INFO ]: Without dead ends: 62 [2018-06-22 11:02:05,395 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:05,395 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:02:05,403 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-06-22 11:02:05,403 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:02:05,405 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2018-06-22 11:02:05,405 INFO ]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 21 [2018-06-22 11:02:05,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:05,406 INFO ]: Abstraction has 58 states and 77 transitions. [2018-06-22 11:02:05,406 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:02:05,406 INFO ]: Start isEmpty. Operand 58 states and 77 transitions. [2018-06-22 11:02:05,407 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:05,407 INFO ]: Found error trace [2018-06-22 11:02:05,407 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:05,408 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:05,408 INFO ]: Analyzing trace with hash -1410920777, now seen corresponding path program 2 times [2018-06-22 11:02:05,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:05,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:05,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:05,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:05,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:05,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:05,548 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:02:05,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:05,548 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 11:02:05,558 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:05,572 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:05,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:05,575 INFO ]: Computing forward predicates... [2018-06-22 11:02:05,857 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:05,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:05,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-06-22 11:02:05,876 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:02:05,877 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:02:05,877 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:02:05,877 INFO ]: Start difference. First operand 58 states and 77 transitions. Second operand 15 states. [2018-06-22 11:02:06,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:06,178 INFO ]: Finished difference Result 66 states and 85 transitions. [2018-06-22 11:02:06,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:02:06,179 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:02:06,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:06,180 INFO ]: With dead ends: 66 [2018-06-22 11:02:06,180 INFO ]: Without dead ends: 65 [2018-06-22 11:02:06,181 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:06,181 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:02:06,188 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-06-22 11:02:06,188 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:02:06,189 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2018-06-22 11:02:06,189 INFO ]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 25 [2018-06-22 11:02:06,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:06,189 INFO ]: Abstraction has 51 states and 66 transitions. [2018-06-22 11:02:06,189 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:02:06,189 INFO ]: Start isEmpty. Operand 51 states and 66 transitions. [2018-06-22 11:02:06,191 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:06,191 INFO ]: Found error trace [2018-06-22 11:02:06,191 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:06,191 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:06,191 INFO ]: Analyzing trace with hash 1041991593, now seen corresponding path program 1 times [2018-06-22 11:02:06,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:06,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:06,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:06,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:06,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:06,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:06,280 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:06,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:06,280 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:02:06,281 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:02:06,281 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:02:06,281 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:06,281 INFO ]: Start difference. First operand 51 states and 66 transitions. Second operand 8 states. [2018-06-22 11:02:06,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:06,338 INFO ]: Finished difference Result 59 states and 76 transitions. [2018-06-22 11:02:06,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:06,338 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:02:06,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:06,340 INFO ]: With dead ends: 59 [2018-06-22 11:02:06,340 INFO ]: Without dead ends: 59 [2018-06-22 11:02:06,340 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:06,340 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:02:06,347 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-06-22 11:02:06,347 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:02:06,348 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-06-22 11:02:06,348 INFO ]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 25 [2018-06-22 11:02:06,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:06,349 INFO ]: Abstraction has 57 states and 74 transitions. [2018-06-22 11:02:06,349 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:02:06,349 INFO ]: Start isEmpty. Operand 57 states and 74 transitions. [2018-06-22 11:02:06,350 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:06,350 INFO ]: Found error trace [2018-06-22 11:02:06,350 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:06,350 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:06,350 INFO ]: Analyzing trace with hash -1128431953, now seen corresponding path program 2 times [2018-06-22 11:02:06,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:06,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:06,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:06,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:06,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:06,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:06,462 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:02:06,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:06,463 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 11:02:06,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:06,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:06,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:06,489 INFO ]: Computing forward predicates... [2018-06-22 11:02:06,683 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:06,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:06,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-06-22 11:02:06,702 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:02:06,702 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:02:06,703 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:02:06,703 INFO ]: Start difference. First operand 57 states and 74 transitions. Second operand 15 states. [2018-06-22 11:02:07,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:07,030 INFO ]: Finished difference Result 61 states and 78 transitions. [2018-06-22 11:02:07,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:02:07,031 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:02:07,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:07,032 INFO ]: With dead ends: 61 [2018-06-22 11:02:07,032 INFO ]: Without dead ends: 60 [2018-06-22 11:02:07,032 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:07,033 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:02:07,038 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-06-22 11:02:07,038 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:02:07,039 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-06-22 11:02:07,039 INFO ]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2018-06-22 11:02:07,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:07,039 INFO ]: Abstraction has 52 states and 66 transitions. [2018-06-22 11:02:07,039 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:02:07,039 INFO ]: Start isEmpty. Operand 52 states and 66 transitions. [2018-06-22 11:02:07,040 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:07,040 INFO ]: Found error trace [2018-06-22 11:02:07,040 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:07,040 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:07,041 INFO ]: Analyzing trace with hash 169210483, now seen corresponding path program 1 times [2018-06-22 11:02:07,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:07,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:07,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:07,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:07,119 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:07,119 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:07,119 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:02:07,119 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:02:07,119 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:02:07,120 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:07,120 INFO ]: Start difference. First operand 52 states and 66 transitions. Second operand 8 states. [2018-06-22 11:02:07,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:07,263 INFO ]: Finished difference Result 62 states and 79 transitions. [2018-06-22 11:02:07,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:07,265 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:02:07,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:07,266 INFO ]: With dead ends: 62 [2018-06-22 11:02:07,266 INFO ]: Without dead ends: 62 [2018-06-22 11:02:07,266 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:07,266 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:02:07,277 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-06-22 11:02:07,277 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:02:07,278 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-06-22 11:02:07,279 INFO ]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 25 [2018-06-22 11:02:07,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:07,279 INFO ]: Abstraction has 56 states and 71 transitions. [2018-06-22 11:02:07,279 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:02:07,279 INFO ]: Start isEmpty. Operand 56 states and 71 transitions. [2018-06-22 11:02:07,280 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:07,280 INFO ]: Found error trace [2018-06-22 11:02:07,280 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:07,280 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:07,280 INFO ]: Analyzing trace with hash -1379542841, now seen corresponding path program 1 times [2018-06-22 11:02:07,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:07,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:07,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:07,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:07,359 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:07,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:07,359 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:02:07,359 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:02:07,359 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:02:07,359 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:07,360 INFO ]: Start difference. First operand 56 states and 71 transitions. Second operand 8 states. [2018-06-22 11:02:07,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:07,478 INFO ]: Finished difference Result 64 states and 80 transitions. [2018-06-22 11:02:07,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:07,479 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:02:07,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:07,480 INFO ]: With dead ends: 64 [2018-06-22 11:02:07,480 INFO ]: Without dead ends: 60 [2018-06-22 11:02:07,480 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:07,480 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:02:07,490 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 11:02:07,490 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:02:07,491 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2018-06-22 11:02:07,491 INFO ]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 29 [2018-06-22 11:02:07,492 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:07,492 INFO ]: Abstraction has 58 states and 74 transitions. [2018-06-22 11:02:07,492 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:02:07,492 INFO ]: Start isEmpty. Operand 58 states and 74 transitions. [2018-06-22 11:02:07,493 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:07,493 INFO ]: Found error trace [2018-06-22 11:02:07,493 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:07,493 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:07,493 INFO ]: Analyzing trace with hash -1069578613, now seen corresponding path program 1 times [2018-06-22 11:02:07,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:07,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:07,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:07,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:07,562 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:07,562 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:07,562 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 11:02:07,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:07,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:07,582 INFO ]: Computing forward predicates... [2018-06-22 11:02:07,663 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:07,689 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:02:07,689 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-06-22 11:02:07,689 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:02:07,689 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:02:07,689 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:02:07,689 INFO ]: Start difference. First operand 58 states and 74 transitions. Second operand 13 states. [2018-06-22 11:02:07,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:07,919 INFO ]: Finished difference Result 62 states and 79 transitions. [2018-06-22 11:02:07,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:02:07,919 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:02:07,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:07,920 INFO ]: With dead ends: 62 [2018-06-22 11:02:07,920 INFO ]: Without dead ends: 62 [2018-06-22 11:02:07,920 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:07,920 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:02:07,926 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-06-22 11:02:07,927 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:07,927 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2018-06-22 11:02:07,928 INFO ]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 29 [2018-06-22 11:02:07,928 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:07,928 INFO ]: Abstraction has 60 states and 77 transitions. [2018-06-22 11:02:07,928 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:02:07,928 INFO ]: Start isEmpty. Operand 60 states and 77 transitions. [2018-06-22 11:02:07,929 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:07,929 INFO ]: Found error trace [2018-06-22 11:02:07,929 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:07,929 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:07,929 INFO ]: Analyzing trace with hash 854856984, now seen corresponding path program 1 times [2018-06-22 11:02:07,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:07,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:07,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:07,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:07,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:07,978 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:07,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:07,979 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 11:02:07,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,014 INFO ]: Computing forward predicates... [2018-06-22 11:02:08,141 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:08,161 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:02:08,161 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-06-22 11:02:08,161 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:02:08,161 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:02:08,161 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:02:08,162 INFO ]: Start difference. First operand 60 states and 77 transitions. Second operand 13 states. [2018-06-22 11:02:08,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,348 INFO ]: Finished difference Result 68 states and 88 transitions. [2018-06-22 11:02:08,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:08,348 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:02:08,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,349 INFO ]: With dead ends: 68 [2018-06-22 11:02:08,349 INFO ]: Without dead ends: 68 [2018-06-22 11:02:08,349 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:02:08,349 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:02:08,356 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-06-22 11:02:08,356 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:08,357 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2018-06-22 11:02:08,357 INFO ]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 29 [2018-06-22 11:02:08,357 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,357 INFO ]: Abstraction has 60 states and 77 transitions. [2018-06-22 11:02:08,357 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:02:08,357 INFO ]: Start isEmpty. Operand 60 states and 77 transitions. [2018-06-22 11:02:08,358 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:08,358 INFO ]: Found error trace [2018-06-22 11:02:08,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,358 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,358 INFO ]: Analyzing trace with hash 1691400465, now seen corresponding path program 1 times [2018-06-22 11:02:08,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,409 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:08,409 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:08,409 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:02:08,410 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:02:08,410 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:02:08,410 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:08,410 INFO ]: Start difference. First operand 60 states and 77 transitions. Second operand 8 states. [2018-06-22 11:02:08,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,453 INFO ]: Finished difference Result 68 states and 86 transitions. [2018-06-22 11:02:08,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:08,453 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:02:08,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,454 INFO ]: With dead ends: 68 [2018-06-22 11:02:08,454 INFO ]: Without dead ends: 64 [2018-06-22 11:02:08,454 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:08,454 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:02:08,460 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-06-22 11:02:08,460 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:08,461 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2018-06-22 11:02:08,461 INFO ]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 29 [2018-06-22 11:02:08,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,461 INFO ]: Abstraction has 60 states and 77 transitions. [2018-06-22 11:02:08,461 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:02:08,461 INFO ]: Start isEmpty. Operand 60 states and 77 transitions. [2018-06-22 11:02:08,462 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:08,462 INFO ]: Found error trace [2018-06-22 11:02:08,462 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,462 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,462 INFO ]: Analyzing trace with hash 1704219824, now seen corresponding path program 1 times [2018-06-22 11:02:08,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,573 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:08,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:08,573 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:08,573 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:08,573 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:08,573 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:08,573 INFO ]: Start difference. First operand 60 states and 77 transitions. Second operand 6 states. [2018-06-22 11:02:08,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,635 INFO ]: Finished difference Result 82 states and 110 transitions. [2018-06-22 11:02:08,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:08,635 INFO ]: Start accepts. Automaton has 6 states. Word has length 33 [2018-06-22 11:02:08,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,636 INFO ]: With dead ends: 82 [2018-06-22 11:02:08,636 INFO ]: Without dead ends: 71 [2018-06-22 11:02:08,636 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:08,636 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:02:08,643 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-06-22 11:02:08,643 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:02:08,645 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-06-22 11:02:08,645 INFO ]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 33 [2018-06-22 11:02:08,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,645 INFO ]: Abstraction has 71 states and 89 transitions. [2018-06-22 11:02:08,645 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:08,645 INFO ]: Start isEmpty. Operand 71 states and 89 transitions. [2018-06-22 11:02:08,648 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:08,648 INFO ]: Found error trace [2018-06-22 11:02:08,648 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,649 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,649 INFO ]: Analyzing trace with hash 115725282, now seen corresponding path program 1 times [2018-06-22 11:02:08,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,741 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:08,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:08,742 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:08,742 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:08,742 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:08,742 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:08,742 INFO ]: Start difference. First operand 71 states and 89 transitions. Second operand 6 states. [2018-06-22 11:02:08,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,788 INFO ]: Finished difference Result 75 states and 96 transitions. [2018-06-22 11:02:08,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:08,788 INFO ]: Start accepts. Automaton has 6 states. Word has length 33 [2018-06-22 11:02:08,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,789 INFO ]: With dead ends: 75 [2018-06-22 11:02:08,789 INFO ]: Without dead ends: 70 [2018-06-22 11:02:08,789 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:08,789 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:02:08,794 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 11:02:08,794 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:02:08,795 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2018-06-22 11:02:08,795 INFO ]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 33 [2018-06-22 11:02:08,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,795 INFO ]: Abstraction has 70 states and 85 transitions. [2018-06-22 11:02:08,795 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:08,795 INFO ]: Start isEmpty. Operand 70 states and 85 transitions. [2018-06-22 11:02:08,796 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:08,796 INFO ]: Found error trace [2018-06-22 11:02:08,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,796 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,796 INFO ]: Analyzing trace with hash -1406593290, now seen corresponding path program 1 times [2018-06-22 11:02:08,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,919 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:08,919 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:08,919 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:02:08,920 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:02:08,920 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:02:08,920 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:08,920 INFO ]: Start difference. First operand 70 states and 85 transitions. Second operand 7 states. [2018-06-22 11:02:08,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,958 INFO ]: Finished difference Result 68 states and 81 transitions. [2018-06-22 11:02:08,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:02:08,958 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 11:02:08,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,959 INFO ]: With dead ends: 68 [2018-06-22 11:02:08,959 INFO ]: Without dead ends: 64 [2018-06-22 11:02:08,959 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:08,959 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:02:08,962 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-22 11:02:08,962 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:02:08,963 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-06-22 11:02:08,963 INFO ]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 33 [2018-06-22 11:02:08,963 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,963 INFO ]: Abstraction has 64 states and 77 transitions. [2018-06-22 11:02:08,963 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:02:08,963 INFO ]: Start isEmpty. Operand 64 states and 77 transitions. [2018-06-22 11:02:08,964 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:08,964 INFO ]: Found error trace [2018-06-22 11:02:08,964 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,964 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,964 INFO ]: Analyzing trace with hash -44076035, now seen corresponding path program 1 times [2018-06-22 11:02:08,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:08,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:09,106 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:09,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:09,107 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 11:02:09,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:09,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:09,135 INFO ]: Computing forward predicates... [2018-06-22 11:02:09,324 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:09,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:09,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:02:09,345 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:02:09,345 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:02:09,345 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:09,345 INFO ]: Start difference. First operand 64 states and 77 transitions. Second operand 20 states. [2018-06-22 11:02:09,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:09,793 INFO ]: Finished difference Result 80 states and 96 transitions. [2018-06-22 11:02:09,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:02:09,794 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:02:09,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:09,795 INFO ]: With dead ends: 80 [2018-06-22 11:02:09,795 INFO ]: Without dead ends: 80 [2018-06-22 11:02:09,795 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:02:09,795 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:02:09,799 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-06-22 11:02:09,799 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:02:09,800 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-06-22 11:02:09,800 INFO ]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 33 [2018-06-22 11:02:09,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:09,800 INFO ]: Abstraction has 66 states and 80 transitions. [2018-06-22 11:02:09,800 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:02:09,800 INFO ]: Start isEmpty. Operand 66 states and 80 transitions. [2018-06-22 11:02:09,801 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:09,801 INFO ]: Found error trace [2018-06-22 11:02:09,801 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:09,801 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:09,801 INFO ]: Analyzing trace with hash -1843198639, now seen corresponding path program 1 times [2018-06-22 11:02:09,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:09,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:09,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:09,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:09,863 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:09,863 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:09,888 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:02:09,888 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:02:09,888 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:02:09,888 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:09,888 INFO ]: Start difference. First operand 66 states and 80 transitions. Second operand 7 states. [2018-06-22 11:02:09,912 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:09,912 INFO ]: Finished difference Result 64 states and 76 transitions. [2018-06-22 11:02:09,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:02:09,912 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 11:02:09,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:09,913 INFO ]: With dead ends: 64 [2018-06-22 11:02:09,913 INFO ]: Without dead ends: 60 [2018-06-22 11:02:09,913 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:09,913 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:02:09,916 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:02:09,916 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:09,917 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-06-22 11:02:09,917 INFO ]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 33 [2018-06-22 11:02:09,917 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:09,917 INFO ]: Abstraction has 60 states and 72 transitions. [2018-06-22 11:02:09,917 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:02:09,917 INFO ]: Start isEmpty. Operand 60 states and 72 transitions. [2018-06-22 11:02:09,918 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:09,918 INFO ]: Found error trace [2018-06-22 11:02:09,918 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:09,918 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:09,918 INFO ]: Analyzing trace with hash 1864021141, now seen corresponding path program 1 times [2018-06-22 11:02:09,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:09,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:09,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:09,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:10,065 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:10,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:10,065 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 11:02:10,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:10,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:10,088 INFO ]: Computing forward predicates... [2018-06-22 11:02:10,612 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:10,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:10,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:02:10,631 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:02:10,631 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:02:10,631 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:10,631 INFO ]: Start difference. First operand 60 states and 72 transitions. Second operand 20 states. [2018-06-22 11:02:10,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:10,928 INFO ]: Finished difference Result 76 states and 91 transitions. [2018-06-22 11:02:10,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:02:10,928 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:02:10,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:10,929 INFO ]: With dead ends: 76 [2018-06-22 11:02:10,929 INFO ]: Without dead ends: 76 [2018-06-22 11:02:10,929 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:02:10,930 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:02:10,933 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 62. [2018-06-22 11:02:10,933 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:02:10,934 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-06-22 11:02:10,934 INFO ]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 33 [2018-06-22 11:02:10,934 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:10,934 INFO ]: Abstraction has 62 states and 75 transitions. [2018-06-22 11:02:10,934 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:02:10,934 INFO ]: Start isEmpty. Operand 62 states and 75 transitions. [2018-06-22 11:02:10,937 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:02:10,937 INFO ]: Found error trace [2018-06-22 11:02:10,937 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:10,937 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:10,937 INFO ]: Analyzing trace with hash 1630236066, now seen corresponding path program 2 times [2018-06-22 11:02:10,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:10,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:10,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:10,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:10,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:10,946 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:11,125 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:11,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:11,125 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) [2018-06-22 11:02:11,139 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:11,155 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:11,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:11,158 INFO ]: Computing forward predicates... [2018-06-22 11:02:11,195 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:11,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:11,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 11:02:11,215 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:02:11,215 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:02:11,215 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:02:11,216 INFO ]: Start difference. First operand 62 states and 75 transitions. Second operand 12 states. [2018-06-22 11:02:11,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:11,365 INFO ]: Finished difference Result 70 states and 84 transitions. [2018-06-22 11:02:11,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:02:11,366 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:02:11,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:11,366 INFO ]: With dead ends: 70 [2018-06-22 11:02:11,366 INFO ]: Without dead ends: 70 [2018-06-22 11:02:11,366 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:11,366 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:02:11,371 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 11:02:11,371 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:02:11,372 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-06-22 11:02:11,372 INFO ]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 37 [2018-06-22 11:02:11,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:11,372 INFO ]: Abstraction has 70 states and 84 transitions. [2018-06-22 11:02:11,372 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:02:11,372 INFO ]: Start isEmpty. Operand 70 states and 84 transitions. [2018-06-22 11:02:11,373 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:02:11,373 INFO ]: Found error trace [2018-06-22 11:02:11,373 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:11,373 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:11,373 INFO ]: Analyzing trace with hash 1869135387, now seen corresponding path program 1 times [2018-06-22 11:02:11,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:11,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:11,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:11,374 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:11,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:11,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,164 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:12,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:12,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:12,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:12,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,186 INFO ]: Computing forward predicates... [2018-06-22 11:02:12,312 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:12,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:12,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 11:02:12,332 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:02:12,332 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:02:12,332 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:02:12,333 INFO ]: Start difference. First operand 70 states and 84 transitions. Second operand 19 states. [2018-06-22 11:02:12,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:12,504 INFO ]: Finished difference Result 76 states and 89 transitions. [2018-06-22 11:02:12,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:12,506 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:02:12,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:12,506 INFO ]: With dead ends: 76 [2018-06-22 11:02:12,506 INFO ]: Without dead ends: 66 [2018-06-22 11:02:12,507 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:12,507 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:02:12,511 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-22 11:02:12,511 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:02:12,511 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-06-22 11:02:12,511 INFO ]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 37 [2018-06-22 11:02:12,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:12,511 INFO ]: Abstraction has 64 states and 77 transitions. [2018-06-22 11:02:12,511 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:02:12,511 INFO ]: Start isEmpty. Operand 64 states and 77 transitions. [2018-06-22 11:02:12,512 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:02:12,512 INFO ]: Found error trace [2018-06-22 11:02:12,512 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:12,512 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:12,512 INFO ]: Analyzing trace with hash -1366049121, now seen corresponding path program 2 times [2018-06-22 11:02:12,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:12,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:12,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:12,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:12,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:12,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,879 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:12,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:12,879 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 11:02:12,887 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:12,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:12,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,904 INFO ]: Computing forward predicates... [2018-06-22 11:02:12,988 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:02:13,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:13,007 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 11:02:13,007 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:02:13,007 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:02:13,007 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:02:13,007 INFO ]: Start difference. First operand 64 states and 77 transitions. Second operand 12 states. [2018-06-22 11:02:13,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:13,120 INFO ]: Finished difference Result 72 states and 86 transitions. [2018-06-22 11:02:13,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:02:13,120 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:02:13,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:13,121 INFO ]: With dead ends: 72 [2018-06-22 11:02:13,121 INFO ]: Without dead ends: 72 [2018-06-22 11:02:13,121 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:13,122 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:02:13,125 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:02:13,125 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:02:13,126 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-06-22 11:02:13,126 INFO ]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 37 [2018-06-22 11:02:13,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:13,126 INFO ]: Abstraction has 72 states and 86 transitions. [2018-06-22 11:02:13,126 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:02:13,126 INFO ]: Start isEmpty. Operand 72 states and 86 transitions. [2018-06-22 11:02:13,127 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:02:13,127 INFO ]: Found error trace [2018-06-22 11:02:13,127 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:13,127 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:13,127 INFO ]: Analyzing trace with hash 1599486131, now seen corresponding path program 1 times [2018-06-22 11:02:13,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:13,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:13,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:13,128 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:13,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:13,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:13,489 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:13,489 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:13,489 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 11:02:13,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:13,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:13,518 INFO ]: Computing forward predicates... [2018-06-22 11:02:13,649 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:02:13,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:13,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 11:02:13,668 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:02:13,668 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:02:13,668 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:02:13,668 INFO ]: Start difference. First operand 72 states and 86 transitions. Second operand 19 states. [2018-06-22 11:02:13,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:13,762 INFO ]: Finished difference Result 78 states and 91 transitions. [2018-06-22 11:02:13,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:13,763 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:02:13,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:13,764 INFO ]: With dead ends: 78 [2018-06-22 11:02:13,764 INFO ]: Without dead ends: 68 [2018-06-22 11:02:13,764 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:13,764 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:02:13,776 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-06-22 11:02:13,776 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:02:13,777 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-06-22 11:02:13,777 INFO ]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2018-06-22 11:02:13,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:13,777 INFO ]: Abstraction has 66 states and 79 transitions. [2018-06-22 11:02:13,777 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:02:13,777 INFO ]: Start isEmpty. Operand 66 states and 79 transitions. [2018-06-22 11:02:13,779 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:02:13,779 INFO ]: Found error trace [2018-06-22 11:02:13,779 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:13,779 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:13,779 INFO ]: Analyzing trace with hash -1540994425, now seen corresponding path program 3 times [2018-06-22 11:02:13,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:13,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:13,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:13,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:13,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:13,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:14,005 INFO ]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:02:14,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:14,006 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 11:02:14,012 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:14,058 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:02:14,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:14,061 INFO ]: Computing forward predicates... [2018-06-22 11:02:14,324 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:02:14,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:14,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-06-22 11:02:14,343 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:02:14,343 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:02:14,343 INFO ]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:02:14,343 INFO ]: Start difference. First operand 66 states and 79 transitions. Second operand 26 states. [2018-06-22 11:02:14,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:14,970 INFO ]: Finished difference Result 84 states and 100 transitions. [2018-06-22 11:02:14,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:02:15,006 INFO ]: Start accepts. Automaton has 26 states. Word has length 41 [2018-06-22 11:02:15,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:15,007 INFO ]: With dead ends: 84 [2018-06-22 11:02:15,007 INFO ]: Without dead ends: 84 [2018-06-22 11:02:15,007 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:02:15,007 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:02:15,012 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-06-22 11:02:15,012 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:02:15,013 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-06-22 11:02:15,013 INFO ]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 41 [2018-06-22 11:02:15,013 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:15,013 INFO ]: Abstraction has 76 states and 91 transitions. [2018-06-22 11:02:15,013 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:02:15,013 INFO ]: Start isEmpty. Operand 76 states and 91 transitions. [2018-06-22 11:02:15,014 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:02:15,014 INFO ]: Found error trace [2018-06-22 11:02:15,014 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:15,014 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:15,014 INFO ]: Analyzing trace with hash -2000431615, now seen corresponding path program 3 times [2018-06-22 11:02:15,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:15,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:15,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:15,014 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:15,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:15,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:15,211 INFO ]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:02:15,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:15,212 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 11:02:15,217 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:15,236 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:02:15,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:15,238 INFO ]: Computing forward predicates... [2018-06-22 11:02:15,485 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:02:15,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:15,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-06-22 11:02:15,514 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:02:15,514 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:02:15,515 INFO ]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:02:15,515 INFO ]: Start difference. First operand 76 states and 91 transitions. Second operand 26 states. [2018-06-22 11:02:16,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:16,352 INFO ]: Finished difference Result 94 states and 112 transitions. [2018-06-22 11:02:16,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:02:16,354 INFO ]: Start accepts. Automaton has 26 states. Word has length 41 [2018-06-22 11:02:16,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:16,355 INFO ]: With dead ends: 94 [2018-06-22 11:02:16,355 INFO ]: Without dead ends: 94 [2018-06-22 11:02:16,356 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:02:16,356 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:02:16,361 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-06-22 11:02:16,361 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:02:16,361 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-06-22 11:02:16,362 INFO ]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 41 [2018-06-22 11:02:16,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:16,362 INFO ]: Abstraction has 86 states and 103 transitions. [2018-06-22 11:02:16,362 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:02:16,362 INFO ]: Start isEmpty. Operand 86 states and 103 transitions. [2018-06-22 11:02:16,363 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:16,363 INFO ]: Found error trace [2018-06-22 11:02:16,363 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:16,363 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:16,363 INFO ]: Analyzing trace with hash 703613356, now seen corresponding path program 4 times [2018-06-22 11:02:16,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:16,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:16,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:16,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:16,486 INFO ]: Checked inductivity of 31 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:02:16,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:16,486 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:16,492 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:16,510 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:16,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:16,512 INFO ]: Computing forward predicates... [2018-06-22 11:02:16,525 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:02:16,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:16,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2018-06-22 11:02:16,544 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:02:16,544 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:02:16,544 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:02:16,544 INFO ]: Start difference. First operand 86 states and 103 transitions. Second operand 14 states. [2018-06-22 11:02:16,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:16,733 INFO ]: Finished difference Result 88 states and 105 transitions. [2018-06-22 11:02:16,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:16,733 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:02:16,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:16,734 INFO ]: With dead ends: 88 [2018-06-22 11:02:16,734 INFO ]: Without dead ends: 88 [2018-06-22 11:02:16,734 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:16,734 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:02:16,739 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-06-22 11:02:16,739 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:02:16,739 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2018-06-22 11:02:16,739 INFO ]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 45 [2018-06-22 11:02:16,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:16,740 INFO ]: Abstraction has 88 states and 105 transitions. [2018-06-22 11:02:16,740 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:02:16,740 INFO ]: Start isEmpty. Operand 88 states and 105 transitions. [2018-06-22 11:02:16,740 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:16,740 INFO ]: Found error trace [2018-06-22 11:02:16,740 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:16,740 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:16,741 INFO ]: Analyzing trace with hash -438380507, now seen corresponding path program 2 times [2018-06-22 11:02:16,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:16,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:16,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,741 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:16,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:17,374 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:17,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:17,374 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:17,380 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:17,398 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:17,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:17,400 INFO ]: Computing forward predicates... [2018-06-22 11:02:17,621 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:17,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:17,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-22 11:02:17,640 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:02:17,640 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:02:17,640 INFO ]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:02:17,640 INFO ]: Start difference. First operand 88 states and 105 transitions. Second operand 23 states. [2018-06-22 11:02:17,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:17,795 INFO ]: Finished difference Result 94 states and 110 transitions. [2018-06-22 11:02:17,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:02:17,796 INFO ]: Start accepts. Automaton has 23 states. Word has length 45 [2018-06-22 11:02:17,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:17,797 INFO ]: With dead ends: 94 [2018-06-22 11:02:17,797 INFO ]: Without dead ends: 82 [2018-06-22 11:02:17,797 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:02:17,797 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:02:17,802 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-06-22 11:02:17,802 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:02:17,802 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-06-22 11:02:17,802 INFO ]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 45 [2018-06-22 11:02:17,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:17,803 INFO ]: Abstraction has 80 states and 96 transitions. [2018-06-22 11:02:17,803 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:02:17,803 INFO ]: Start isEmpty. Operand 80 states and 96 transitions. [2018-06-22 11:02:17,803 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:17,803 INFO ]: Found error trace [2018-06-22 11:02:17,803 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:17,803 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:17,804 INFO ]: Analyzing trace with hash 461871781, now seen corresponding path program 3 times [2018-06-22 11:02:17,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:17,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:17,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:17,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:17,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:17,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,149 INFO ]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:18,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:18,149 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:18,154 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:18,174 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:02:18,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,175 INFO ]: Computing forward predicates... [2018-06-22 11:02:18,243 INFO ]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:02:18,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:18,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-06-22 11:02:18,262 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:02:18,263 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:02:18,263 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:02:18,263 INFO ]: Start difference. First operand 80 states and 96 transitions. Second operand 18 states. [2018-06-22 11:02:18,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:18,437 INFO ]: Finished difference Result 80 states and 94 transitions. [2018-06-22 11:02:18,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:02:18,438 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 11:02:18,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:18,438 INFO ]: With dead ends: 80 [2018-06-22 11:02:18,438 INFO ]: Without dead ends: 80 [2018-06-22 11:02:18,438 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:02:18,438 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:02:18,441 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-06-22 11:02:18,441 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:02:18,442 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2018-06-22 11:02:18,442 INFO ]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 45 [2018-06-22 11:02:18,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:18,442 INFO ]: Abstraction has 80 states and 94 transitions. [2018-06-22 11:02:18,442 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:02:18,442 INFO ]: Start isEmpty. Operand 80 states and 94 transitions. [2018-06-22 11:02:18,443 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:18,443 INFO ]: Found error trace [2018-06-22 11:02:18,443 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:18,443 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:18,443 INFO ]: Analyzing trace with hash 1207886347, now seen corresponding path program 4 times [2018-06-22 11:02:18,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:18,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:18,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:18,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:18,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:18,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,605 INFO ]: Checked inductivity of 31 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:02:18,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:18,606 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 11:02:18,612 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:18,631 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:18,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,633 INFO ]: Computing forward predicates... [2018-06-22 11:02:18,660 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:02:18,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:18,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2018-06-22 11:02:18,679 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:02:18,679 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:02:18,679 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:02:18,679 INFO ]: Start difference. First operand 80 states and 94 transitions. Second operand 14 states. [2018-06-22 11:02:18,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:18,875 INFO ]: Finished difference Result 82 states and 96 transitions. [2018-06-22 11:02:18,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:18,875 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:02:18,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:18,876 INFO ]: With dead ends: 82 [2018-06-22 11:02:18,876 INFO ]: Without dead ends: 82 [2018-06-22 11:02:18,876 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:18,876 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:02:18,879 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-06-22 11:02:18,879 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:02:18,880 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-06-22 11:02:18,880 INFO ]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 45 [2018-06-22 11:02:18,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:18,880 INFO ]: Abstraction has 82 states and 96 transitions. [2018-06-22 11:02:18,880 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:02:18,880 INFO ]: Start isEmpty. Operand 82 states and 96 transitions. [2018-06-22 11:02:18,881 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:18,881 INFO ]: Found error trace [2018-06-22 11:02:18,881 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:18,881 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:18,881 INFO ]: Analyzing trace with hash 424111391, now seen corresponding path program 2 times [2018-06-22 11:02:18,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:18,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:18,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:18,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:18,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:18,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:19,014 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:19,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:19,015 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 11:02:19,022 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:19,041 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:19,041 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:19,043 INFO ]: Computing forward predicates... [2018-06-22 11:02:19,194 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:19,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:19,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-22 11:02:19,213 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:02:19,213 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:02:19,213 INFO ]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:02:19,213 INFO ]: Start difference. First operand 82 states and 96 transitions. Second operand 23 states. [2018-06-22 11:02:19,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:19,462 INFO ]: Finished difference Result 88 states and 101 transitions. [2018-06-22 11:02:19,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:02:19,462 INFO ]: Start accepts. Automaton has 23 states. Word has length 45 [2018-06-22 11:02:19,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:19,463 INFO ]: With dead ends: 88 [2018-06-22 11:02:19,463 INFO ]: Without dead ends: 76 [2018-06-22 11:02:19,463 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:02:19,463 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:02:19,468 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-06-22 11:02:19,468 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:02:19,469 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-06-22 11:02:19,469 INFO ]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 45 [2018-06-22 11:02:19,469 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:19,469 INFO ]: Abstraction has 74 states and 87 transitions. [2018-06-22 11:02:19,469 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:02:19,469 INFO ]: Start isEmpty. Operand 74 states and 87 transitions. [2018-06-22 11:02:19,470 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:02:19,470 INFO ]: Found error trace [2018-06-22 11:02:19,470 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:19,470 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:19,470 INFO ]: Analyzing trace with hash -1226758921, now seen corresponding path program 3 times [2018-06-22 11:02:19,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:19,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:19,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:19,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:19,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:19,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:20,379 INFO ]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:02:20,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:20,379 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 11:02:20,385 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:20,405 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:02:20,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:20,407 INFO ]: Computing forward predicates... [2018-06-22 11:02:20,468 INFO ]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:02:20,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:20,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-06-22 11:02:20,490 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:02:20,490 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:02:20,490 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:02:20,490 INFO ]: Start difference. First operand 74 states and 87 transitions. Second operand 18 states. [2018-06-22 11:02:20,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:20,642 INFO ]: Finished difference Result 72 states and 83 transitions. [2018-06-22 11:02:20,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:02:20,643 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 11:02:20,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:20,643 INFO ]: With dead ends: 72 [2018-06-22 11:02:20,643 INFO ]: Without dead ends: 72 [2018-06-22 11:02:20,644 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:02:20,644 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:02:20,646 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:02:20,646 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:02:20,647 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-06-22 11:02:20,647 INFO ]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 45 [2018-06-22 11:02:20,647 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:20,647 INFO ]: Abstraction has 72 states and 83 transitions. [2018-06-22 11:02:20,647 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:02:20,647 INFO ]: Start isEmpty. Operand 72 states and 83 transitions. [2018-06-22 11:02:20,648 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:02:20,648 INFO ]: Found error trace [2018-06-22 11:02:20,648 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:20,648 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:20,648 INFO ]: Analyzing trace with hash 1700132369, now seen corresponding path program 5 times [2018-06-22 11:02:20,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:20,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:20,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:20,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:20,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:20,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:20,859 INFO ]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:02:20,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:20,859 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 11:02:20,864 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:20,886 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:02:20,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:20,890 INFO ]: Computing forward predicates... [2018-06-22 11:02:21,200 INFO ]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:02:21,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:21,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2018-06-22 11:02:21,219 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:02:21,219 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:02:21,219 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:02:21,219 INFO ]: Start difference. First operand 72 states and 83 transitions. Second operand 30 states. [2018-06-22 11:02:21,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:21,900 INFO ]: Finished difference Result 90 states and 104 transitions. [2018-06-22 11:02:21,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:02:21,900 INFO ]: Start accepts. Automaton has 30 states. Word has length 49 [2018-06-22 11:02:21,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:21,901 INFO ]: With dead ends: 90 [2018-06-22 11:02:21,901 INFO ]: Without dead ends: 90 [2018-06-22 11:02:21,902 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:02:21,902 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:02:21,905 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 76. [2018-06-22 11:02:21,905 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:02:21,905 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-06-22 11:02:21,905 INFO ]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 49 [2018-06-22 11:02:21,905 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:21,905 INFO ]: Abstraction has 76 states and 88 transitions. [2018-06-22 11:02:21,905 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:02:21,906 INFO ]: Start isEmpty. Operand 76 states and 88 transitions. [2018-06-22 11:02:21,906 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:02:21,906 INFO ]: Found error trace [2018-06-22 11:02:21,906 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:21,906 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:21,906 INFO ]: Analyzing trace with hash 12954605, now seen corresponding path program 5 times [2018-06-22 11:02:21,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:21,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:21,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:21,909 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:21,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:21,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:22,222 INFO ]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:02:22,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:22,222 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 11:02:22,227 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:22,249 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:02:22,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:22,252 INFO ]: Computing forward predicates... [2018-06-22 11:02:22,640 INFO ]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:02:22,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:22,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2018-06-22 11:02:22,659 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:02:22,659 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:02:22,659 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:02:22,659 INFO ]: Start difference. First operand 76 states and 88 transitions. Second operand 30 states. [2018-06-22 11:02:23,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:23,296 INFO ]: Finished difference Result 94 states and 109 transitions. [2018-06-22 11:02:23,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:02:23,296 INFO ]: Start accepts. Automaton has 30 states. Word has length 49 [2018-06-22 11:02:23,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:23,297 INFO ]: With dead ends: 94 [2018-06-22 11:02:23,297 INFO ]: Without dead ends: 94 [2018-06-22 11:02:23,297 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:02:23,297 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:02:23,301 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 78. [2018-06-22 11:02:23,301 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:02:23,301 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-06-22 11:02:23,301 INFO ]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 49 [2018-06-22 11:02:23,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:23,302 INFO ]: Abstraction has 78 states and 91 transitions. [2018-06-22 11:02:23,302 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:02:23,302 INFO ]: Start isEmpty. Operand 78 states and 91 transitions. [2018-06-22 11:02:23,304 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:02:23,304 INFO ]: Found error trace [2018-06-22 11:02:23,304 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:23,304 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:23,304 INFO ]: Analyzing trace with hash -457393482, now seen corresponding path program 6 times [2018-06-22 11:02:23,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:23,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:23,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:23,305 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:23,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:23,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,433 INFO ]: Checked inductivity of 57 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:02:23,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:23,433 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 11:02:23,439 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:23,465 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:02:23,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,467 INFO ]: Computing forward predicates... [2018-06-22 11:02:23,506 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:02:23,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:23,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 11:02:23,538 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:02:23,538 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:02:23,538 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:23,538 INFO ]: Start difference. First operand 78 states and 91 transitions. Second operand 16 states. [2018-06-22 11:02:23,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:23,796 INFO ]: Finished difference Result 90 states and 104 transitions. [2018-06-22 11:02:23,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:02:23,797 INFO ]: Start accepts. Automaton has 16 states. Word has length 53 [2018-06-22 11:02:23,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:23,797 INFO ]: With dead ends: 90 [2018-06-22 11:02:23,797 INFO ]: Without dead ends: 90 [2018-06-22 11:02:23,798 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:02:23,798 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:02:23,800 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-06-22 11:02:23,800 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:02:23,801 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-06-22 11:02:23,801 INFO ]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 53 [2018-06-22 11:02:23,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:23,801 INFO ]: Abstraction has 90 states and 104 transitions. [2018-06-22 11:02:23,801 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:02:23,801 INFO ]: Start isEmpty. Operand 90 states and 104 transitions. [2018-06-22 11:02:23,802 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:02:23,802 INFO ]: Found error trace [2018-06-22 11:02:23,802 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:23,802 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:23,802 INFO ]: Analyzing trace with hash -1606514897, now seen corresponding path program 4 times [2018-06-22 11:02:23,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:23,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:23,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:23,802 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:23,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:23,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,959 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:02:23,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:23,960 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 11:02:23,965 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:23,986 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:23,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,989 INFO ]: Computing forward predicates... [2018-06-22 11:02:24,185 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:02:24,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:24,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-06-22 11:02:24,204 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:02:24,204 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:02:24,204 INFO ]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:02:24,205 INFO ]: Start difference. First operand 90 states and 104 transitions. Second operand 27 states. [2018-06-22 11:02:24,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:24,494 INFO ]: Finished difference Result 96 states and 109 transitions. [2018-06-22 11:02:24,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:02:24,494 INFO ]: Start accepts. Automaton has 27 states. Word has length 53 [2018-06-22 11:02:24,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:24,495 INFO ]: With dead ends: 96 [2018-06-22 11:02:24,495 INFO ]: Without dead ends: 82 [2018-06-22 11:02:24,495 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:02:24,495 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:02:24,501 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-06-22 11:02:24,502 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:02:24,502 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-06-22 11:02:24,502 INFO ]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 53 [2018-06-22 11:02:24,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:24,502 INFO ]: Abstraction has 80 states and 93 transitions. [2018-06-22 11:02:24,502 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:02:24,502 INFO ]: Start isEmpty. Operand 80 states and 93 transitions. [2018-06-22 11:02:24,503 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:02:24,503 INFO ]: Found error trace [2018-06-22 11:02:24,503 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:24,503 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:24,503 INFO ]: Analyzing trace with hash 513291787, now seen corresponding path program 4 times [2018-06-22 11:02:24,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:24,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:24,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:24,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:24,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:24,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:24,651 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:02:24,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:24,651 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 11:02:24,656 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:24,677 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:24,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:24,679 INFO ]: Computing forward predicates... [2018-06-22 11:02:24,875 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:02:24,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:24,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-06-22 11:02:24,894 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:02:24,894 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:02:24,894 INFO ]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:02:24,894 INFO ]: Start difference. First operand 80 states and 93 transitions. Second operand 27 states. [2018-06-22 11:02:25,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:25,153 INFO ]: Finished difference Result 98 states and 112 transitions. [2018-06-22 11:02:25,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:02:25,153 INFO ]: Start accepts. Automaton has 27 states. Word has length 53 [2018-06-22 11:02:25,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:25,154 INFO ]: With dead ends: 98 [2018-06-22 11:02:25,154 INFO ]: Without dead ends: 94 [2018-06-22 11:02:25,154 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:02:25,154 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:02:25,157 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-06-22 11:02:25,157 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:02:25,158 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-06-22 11:02:25,158 INFO ]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 53 [2018-06-22 11:02:25,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:25,158 INFO ]: Abstraction has 92 states and 106 transitions. [2018-06-22 11:02:25,158 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:02:25,158 INFO ]: Start isEmpty. Operand 92 states and 106 transitions. [2018-06-22 11:02:25,158 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:02:25,158 INFO ]: Found error trace [2018-06-22 11:02:25,158 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:25,158 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:25,158 INFO ]: Analyzing trace with hash -2023056905, now seen corresponding path program 6 times [2018-06-22 11:02:25,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:25,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:25,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:25,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:25,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:25,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:25,370 INFO ]: Checked inductivity of 57 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:02:25,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:25,407 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 11:02:25,413 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:25,438 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:02:25,438 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:25,440 INFO ]: Computing forward predicates... [2018-06-22 11:02:25,523 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:02:25,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:25,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2018-06-22 11:02:25,542 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:02:25,542 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:02:25,542 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:25,542 INFO ]: Start difference. First operand 92 states and 106 transitions. Second operand 16 states. [2018-06-22 11:02:25,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:25,678 INFO ]: Finished difference Result 92 states and 105 transitions. [2018-06-22 11:02:25,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:02:25,678 INFO ]: Start accepts. Automaton has 16 states. Word has length 53 [2018-06-22 11:02:25,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:25,679 INFO ]: With dead ends: 92 [2018-06-22 11:02:25,679 INFO ]: Without dead ends: 82 [2018-06-22 11:02:25,679 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:02:25,679 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:02:25,682 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-06-22 11:02:25,682 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:02:25,683 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2018-06-22 11:02:25,683 INFO ]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 53 [2018-06-22 11:02:25,683 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:25,683 INFO ]: Abstraction has 82 states and 95 transitions. [2018-06-22 11:02:25,683 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:02:25,683 INFO ]: Start isEmpty. Operand 82 states and 95 transitions. [2018-06-22 11:02:25,684 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:02:25,684 INFO ]: Found error trace [2018-06-22 11:02:25,684 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:25,684 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:25,684 INFO ]: Analyzing trace with hash -734398821, now seen corresponding path program 7 times [2018-06-22 11:02:25,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:25,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:25,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:25,685 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:25,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:25,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:25,927 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 11:02:26,451 INFO ]: Checked inductivity of 72 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:02:26,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:26,451 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 11:02:26,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:26,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:26,485 INFO ]: Computing forward predicates... [2018-06-22 11:02:26,773 INFO ]: Checked inductivity of 72 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:02:26,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:26,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2018-06-22 11:02:26,792 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:02:26,792 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:02:26,792 INFO ]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:26,792 INFO ]: Start difference. First operand 82 states and 95 transitions. Second operand 32 states. [2018-06-22 11:02:27,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:27,688 INFO ]: Finished difference Result 104 states and 120 transitions. [2018-06-22 11:02:27,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:02:27,688 INFO ]: Start accepts. Automaton has 32 states. Word has length 57 [2018-06-22 11:02:27,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:27,689 INFO ]: With dead ends: 104 [2018-06-22 11:02:27,689 INFO ]: Without dead ends: 104 [2018-06-22 11:02:27,689 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=207, Invalid=2445, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:02:27,689 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:02:27,694 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-06-22 11:02:27,694 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:02:27,694 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-06-22 11:02:27,694 INFO ]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 57 [2018-06-22 11:02:27,694 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:27,694 INFO ]: Abstraction has 96 states and 111 transitions. [2018-06-22 11:02:27,694 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:02:27,694 INFO ]: Start isEmpty. Operand 96 states and 111 transitions. [2018-06-22 11:02:27,695 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:02:27,695 INFO ]: Found error trace [2018-06-22 11:02:27,695 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:27,695 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:27,695 INFO ]: Analyzing trace with hash -900270503, now seen corresponding path program 7 times [2018-06-22 11:02:27,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:27,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:27,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:27,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:27,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:27,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:27,964 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-22 11:02:28,375 INFO ]: Checked inductivity of 72 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:02:28,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:28,375 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 11:02:28,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:28,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:28,408 INFO ]: Computing forward predicates... [2018-06-22 11:02:28,967 INFO ]: Checked inductivity of 72 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:02:28,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:28,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2018-06-22 11:02:28,987 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:02:28,987 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:02:28,987 INFO ]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:28,988 INFO ]: Start difference. First operand 96 states and 111 transitions. Second operand 32 states. [2018-06-22 11:02:30,530 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:02:31,244 WARN ]: Spent 343.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:02:31,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:31,503 INFO ]: Finished difference Result 118 states and 136 transitions. [2018-06-22 11:02:31,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:02:31,503 INFO ]: Start accepts. Automaton has 32 states. Word has length 57 [2018-06-22 11:02:31,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:31,504 INFO ]: With dead ends: 118 [2018-06-22 11:02:31,504 INFO ]: Without dead ends: 118 [2018-06-22 11:02:31,505 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=207, Invalid=2445, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:02:31,505 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:02:31,510 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-06-22 11:02:31,510 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 11:02:31,511 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2018-06-22 11:02:31,511 INFO ]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 57 [2018-06-22 11:02:31,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:31,511 INFO ]: Abstraction has 110 states and 127 transitions. [2018-06-22 11:02:31,511 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:02:31,511 INFO ]: Start isEmpty. Operand 110 states and 127 transitions. [2018-06-22 11:02:31,512 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:31,512 INFO ]: Found error trace [2018-06-22 11:02:31,512 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:31,512 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:31,512 INFO ]: Analyzing trace with hash -245568, now seen corresponding path program 8 times [2018-06-22 11:02:31,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:31,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:31,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:31,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:31,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:31,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:31,678 INFO ]: Checked inductivity of 91 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:02:31,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:31,678 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 11:02:31,683 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:31,709 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:31,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:31,711 INFO ]: Computing forward predicates... [2018-06-22 11:02:31,785 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:02:31,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:31,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 18 [2018-06-22 11:02:31,804 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:02:31,804 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:02:31,805 INFO ]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:02:31,805 INFO ]: Start difference. First operand 110 states and 127 transitions. Second operand 18 states. [2018-06-22 11:02:32,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:32,068 INFO ]: Finished difference Result 112 states and 129 transitions. [2018-06-22 11:02:32,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:02:32,068 INFO ]: Start accepts. Automaton has 18 states. Word has length 61 [2018-06-22 11:02:32,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:32,069 INFO ]: With dead ends: 112 [2018-06-22 11:02:32,069 INFO ]: Without dead ends: 112 [2018-06-22 11:02:32,069 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:02:32,069 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:02:32,073 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-06-22 11:02:32,073 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:02:32,074 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2018-06-22 11:02:32,074 INFO ]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 61 [2018-06-22 11:02:32,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:32,074 INFO ]: Abstraction has 112 states and 129 transitions. [2018-06-22 11:02:32,074 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:02:32,074 INFO ]: Start isEmpty. Operand 112 states and 129 transitions. [2018-06-22 11:02:32,075 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:32,075 INFO ]: Found error trace [2018-06-22 11:02:32,075 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:32,075 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:32,075 INFO ]: Analyzing trace with hash -726965831, now seen corresponding path program 5 times [2018-06-22 11:02:32,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:32,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:32,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:32,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:32,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:32,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:32,253 INFO ]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:02:32,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:32,253 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 11:02:32,258 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:32,290 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:02:32,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:32,292 INFO ]: Computing forward predicates... [2018-06-22 11:02:33,219 INFO ]: Checked inductivity of 76 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:02:33,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:33,238 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2018-06-22 11:02:33,238 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:02:33,238 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:02:33,238 INFO ]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:02:33,238 INFO ]: Start difference. First operand 112 states and 129 transitions. Second operand 22 states. [2018-06-22 11:02:33,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:33,508 INFO ]: Finished difference Result 112 states and 127 transitions. [2018-06-22 11:02:33,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:02:33,508 INFO ]: Start accepts. Automaton has 22 states. Word has length 61 [2018-06-22 11:02:33,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:33,508 INFO ]: With dead ends: 112 [2018-06-22 11:02:33,508 INFO ]: Without dead ends: 112 [2018-06-22 11:02:33,509 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:33,509 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:02:33,514 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-06-22 11:02:33,514 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:02:33,514 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-06-22 11:02:33,514 INFO ]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 61 [2018-06-22 11:02:33,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:33,514 INFO ]: Abstraction has 112 states and 127 transitions. [2018-06-22 11:02:33,514 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:02:33,514 INFO ]: Start isEmpty. Operand 112 states and 127 transitions. [2018-06-22 11:02:33,515 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:33,515 INFO ]: Found error trace [2018-06-22 11:02:33,515 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:33,515 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:33,515 INFO ]: Analyzing trace with hash 183716665, now seen corresponding path program 6 times [2018-06-22 11:02:33,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:33,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:33,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:33,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:33,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:33,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:34,384 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:02:34,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:34,384 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 11:02:34,390 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:34,491 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:02:34,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:34,495 INFO ]: Computing forward predicates... [2018-06-22 11:02:34,934 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:02:34,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:34,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-06-22 11:02:34,954 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:02:34,954 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:02:34,954 INFO ]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:02:34,954 INFO ]: Start difference. First operand 112 states and 127 transitions. Second operand 31 states. [2018-06-22 11:02:35,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:35,245 INFO ]: Finished difference Result 118 states and 132 transitions. [2018-06-22 11:02:35,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:02:35,245 INFO ]: Start accepts. Automaton has 31 states. Word has length 61 [2018-06-22 11:02:35,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:35,246 INFO ]: With dead ends: 118 [2018-06-22 11:02:35,246 INFO ]: Without dead ends: 102 [2018-06-22 11:02:35,246 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:02:35,246 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:02:35,250 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-06-22 11:02:35,250 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:02:35,251 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-06-22 11:02:35,251 INFO ]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 61 [2018-06-22 11:02:35,251 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:35,251 INFO ]: Abstraction has 100 states and 114 transitions. [2018-06-22 11:02:35,251 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:02:35,251 INFO ]: Start isEmpty. Operand 100 states and 114 transitions. [2018-06-22 11:02:35,252 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:35,252 INFO ]: Found error trace [2018-06-22 11:02:35,252 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:35,252 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:35,252 INFO ]: Analyzing trace with hash 678014031, now seen corresponding path program 5 times [2018-06-22 11:02:35,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:35,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:35,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:35,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:35,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:35,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:35,678 INFO ]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:02:35,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:35,697 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 11:02:35,704 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:35,737 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:02:35,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:35,739 INFO ]: Computing forward predicates... [2018-06-22 11:02:35,796 INFO ]: Checked inductivity of 76 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:02:35,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:35,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2018-06-22 11:02:35,816 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:02:35,816 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:02:35,816 INFO ]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:02:35,816 INFO ]: Start difference. First operand 100 states and 114 transitions. Second operand 22 states. [2018-06-22 11:02:36,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:36,080 INFO ]: Finished difference Result 102 states and 115 transitions. [2018-06-22 11:02:36,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:02:36,080 INFO ]: Start accepts. Automaton has 22 states. Word has length 61 [2018-06-22 11:02:36,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:36,080 INFO ]: With dead ends: 102 [2018-06-22 11:02:36,080 INFO ]: Without dead ends: 102 [2018-06-22 11:02:36,081 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:36,081 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:02:36,084 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-06-22 11:02:36,084 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:02:36,085 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-06-22 11:02:36,085 INFO ]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 61 [2018-06-22 11:02:36,085 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:36,085 INFO ]: Abstraction has 102 states and 115 transitions. [2018-06-22 11:02:36,085 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:02:36,085 INFO ]: Start isEmpty. Operand 102 states and 115 transitions. [2018-06-22 11:02:36,085 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:36,085 INFO ]: Found error trace [2018-06-22 11:02:36,086 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:36,086 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:36,086 INFO ]: Analyzing trace with hash -305179785, now seen corresponding path program 6 times [2018-06-22 11:02:36,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:36,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:36,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:36,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:36,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:36,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:36,466 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:02:36,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:36,466 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 11:02:36,471 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:36,498 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:02:36,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:36,502 INFO ]: Computing forward predicates... [2018-06-22 11:02:37,301 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:02:37,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:37,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-06-22 11:02:37,320 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:02:37,320 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:02:37,321 INFO ]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:02:37,321 INFO ]: Start difference. First operand 102 states and 115 transitions. Second operand 31 states. [2018-06-22 11:02:37,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:37,572 INFO ]: Finished difference Result 106 states and 118 transitions. [2018-06-22 11:02:37,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:02:37,572 INFO ]: Start accepts. Automaton has 31 states. Word has length 61 [2018-06-22 11:02:37,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:37,572 INFO ]: With dead ends: 106 [2018-06-22 11:02:37,572 INFO ]: Without dead ends: 102 [2018-06-22 11:02:37,573 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:02:37,573 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:02:37,575 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-06-22 11:02:37,575 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:02:37,576 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-06-22 11:02:37,576 INFO ]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 61 [2018-06-22 11:02:37,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:37,576 INFO ]: Abstraction has 86 states and 97 transitions. [2018-06-22 11:02:37,576 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:02:37,576 INFO ]: Start isEmpty. Operand 86 states and 97 transitions. [2018-06-22 11:02:37,576 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:02:37,576 INFO ]: Found error trace [2018-06-22 11:02:37,577 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:37,577 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:37,577 INFO ]: Analyzing trace with hash -1168267677, now seen corresponding path program 8 times [2018-06-22 11:02:37,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:37,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:37,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:37,577 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:37,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:37,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:37,808 INFO ]: Checked inductivity of 91 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:02:37,808 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:37,808 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 11:02:37,813 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:37,839 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:37,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:37,841 INFO ]: Computing forward predicates... [2018-06-22 11:02:37,862 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:02:37,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:37,881 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 18 [2018-06-22 11:02:37,881 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:02:37,881 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:02:37,881 INFO ]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:02:37,881 INFO ]: Start difference. First operand 86 states and 97 transitions. Second operand 18 states. [2018-06-22 11:02:38,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:38,047 INFO ]: Finished difference Result 100 states and 111 transitions. [2018-06-22 11:02:38,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:02:38,047 INFO ]: Start accepts. Automaton has 18 states. Word has length 61 [2018-06-22 11:02:38,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:38,047 INFO ]: With dead ends: 100 [2018-06-22 11:02:38,047 INFO ]: Without dead ends: 88 [2018-06-22 11:02:38,048 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:02:38,048 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:02:38,049 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-06-22 11:02:38,049 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:02:38,050 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-06-22 11:02:38,050 INFO ]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 61 [2018-06-22 11:02:38,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:38,050 INFO ]: Abstraction has 88 states and 99 transitions. [2018-06-22 11:02:38,050 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:02:38,050 INFO ]: Start isEmpty. Operand 88 states and 99 transitions. [2018-06-22 11:02:38,050 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:02:38,050 INFO ]: Found error trace [2018-06-22 11:02:38,050 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:38,050 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:38,050 INFO ]: Analyzing trace with hash -1065497563, now seen corresponding path program 9 times [2018-06-22 11:02:38,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:38,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:38,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:38,051 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:38,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:38,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:38,318 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 11:02:38,897 INFO ]: Checked inductivity of 110 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:02:38,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:38,897 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 11:02:38,903 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:38,934 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:02:38,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:38,938 INFO ]: Computing forward predicates... [2018-06-22 11:02:39,436 INFO ]: Checked inductivity of 110 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:02:39,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:39,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-06-22 11:02:39,455 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:02:39,455 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:02:39,455 INFO ]: CoverageRelationStatistics Valid=91, Invalid=1315, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:02:39,455 INFO ]: Start difference. First operand 88 states and 99 transitions. Second operand 38 states. [2018-06-22 11:02:39,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:39,911 INFO ]: Finished difference Result 108 states and 121 transitions. [2018-06-22 11:02:39,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:02:39,911 INFO ]: Start accepts. Automaton has 38 states. Word has length 65 [2018-06-22 11:02:39,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:39,911 INFO ]: With dead ends: 108 [2018-06-22 11:02:39,911 INFO ]: Without dead ends: 108 [2018-06-22 11:02:39,912 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=2191, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:02:39,912 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:02:39,915 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-06-22 11:02:39,915 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:02:39,915 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-06-22 11:02:39,915 INFO ]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 65 [2018-06-22 11:02:39,915 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:39,915 INFO ]: Abstraction has 106 states and 119 transitions. [2018-06-22 11:02:39,915 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:02:39,915 INFO ]: Start isEmpty. Operand 106 states and 119 transitions. [2018-06-22 11:02:39,916 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:02:39,916 INFO ]: Found error trace [2018-06-22 11:02:39,916 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:39,916 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:39,916 INFO ]: Analyzing trace with hash 439776581, now seen corresponding path program 9 times [2018-06-22 11:02:39,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:39,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:39,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:39,917 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:39,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:39,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:40,187 WARN ]: Spent 207.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-22 11:02:40,659 INFO ]: Checked inductivity of 110 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:02:40,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:40,659 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 11:02:40,664 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:40,707 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:02:40,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:40,711 INFO ]: Computing forward predicates... [2018-06-22 11:02:41,229 INFO ]: Checked inductivity of 110 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:02:41,248 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:41,248 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-06-22 11:02:41,248 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:02:41,248 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:02:41,249 INFO ]: CoverageRelationStatistics Valid=91, Invalid=1315, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:02:41,249 INFO ]: Start difference. First operand 106 states and 119 transitions. Second operand 38 states. [2018-06-22 11:02:41,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:41,725 INFO ]: Finished difference Result 126 states and 141 transitions. [2018-06-22 11:02:41,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:41,725 INFO ]: Start accepts. Automaton has 38 states. Word has length 65 [2018-06-22 11:02:41,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:41,726 INFO ]: With dead ends: 126 [2018-06-22 11:02:41,726 INFO ]: Without dead ends: 126 [2018-06-22 11:02:41,727 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=2191, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:02:41,727 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 11:02:41,731 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-06-22 11:02:41,731 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:02:41,732 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2018-06-22 11:02:41,732 INFO ]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 65 [2018-06-22 11:02:41,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:41,732 INFO ]: Abstraction has 122 states and 137 transitions. [2018-06-22 11:02:41,732 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:02:41,732 INFO ]: Start isEmpty. Operand 122 states and 137 transitions. [2018-06-22 11:02:41,733 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:41,733 INFO ]: Found error trace [2018-06-22 11:02:41,733 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:41,733 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:41,733 INFO ]: Analyzing trace with hash -1904583734, now seen corresponding path program 10 times [2018-06-22 11:02:41,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:41,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:41,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:41,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:41,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:41,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:42,061 INFO ]: Checked inductivity of 133 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:02:42,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:42,061 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 11:02:42,071 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:42,121 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:42,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:42,124 INFO ]: Computing forward predicates... [2018-06-22 11:02:42,257 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:02:42,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:42,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 20 [2018-06-22 11:02:42,288 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:02:42,288 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:02:42,288 INFO ]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:42,288 INFO ]: Start difference. First operand 122 states and 137 transitions. Second operand 20 states. [2018-06-22 11:02:42,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:42,678 INFO ]: Finished difference Result 122 states and 136 transitions. [2018-06-22 11:02:42,679 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:02:42,679 INFO ]: Start accepts. Automaton has 20 states. Word has length 69 [2018-06-22 11:02:42,679 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:42,679 INFO ]: With dead ends: 122 [2018-06-22 11:02:42,679 INFO ]: Without dead ends: 122 [2018-06-22 11:02:42,680 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:42,680 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:02:42,684 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-06-22 11:02:42,684 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:02:42,684 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-06-22 11:02:42,684 INFO ]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 69 [2018-06-22 11:02:42,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:42,685 INFO ]: Abstraction has 122 states and 136 transitions. [2018-06-22 11:02:42,685 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:02:42,685 INFO ]: Start isEmpty. Operand 122 states and 136 transitions. [2018-06-22 11:02:42,685 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:42,685 INFO ]: Found error trace [2018-06-22 11:02:42,685 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:42,686 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:42,686 INFO ]: Analyzing trace with hash 919118915, now seen corresponding path program 7 times [2018-06-22 11:02:42,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:42,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:42,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:42,686 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:42,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:42,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:43,061 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:02:43,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:43,061 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 11:02:43,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:43,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:43,120 INFO ]: Computing forward predicates... [2018-06-22 11:02:43,488 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:02:43,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:43,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-06-22 11:02:43,507 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:02:43,507 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:02:43,508 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:02:43,508 INFO ]: Start difference. First operand 122 states and 136 transitions. Second operand 35 states. [2018-06-22 11:02:43,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:43,928 INFO ]: Finished difference Result 128 states and 141 transitions. [2018-06-22 11:02:43,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:43,928 INFO ]: Start accepts. Automaton has 35 states. Word has length 69 [2018-06-22 11:02:43,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:43,929 INFO ]: With dead ends: 128 [2018-06-22 11:02:43,929 INFO ]: Without dead ends: 110 [2018-06-22 11:02:43,930 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 18 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=1848, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:02:43,930 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:02:43,935 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-06-22 11:02:43,935 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:02:43,935 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-06-22 11:02:43,935 INFO ]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 69 [2018-06-22 11:02:43,936 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:43,936 INFO ]: Abstraction has 108 states and 121 transitions. [2018-06-22 11:02:43,936 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:02:43,936 INFO ]: Start isEmpty. Operand 108 states and 121 transitions. [2018-06-22 11:02:43,936 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:43,936 INFO ]: Found error trace [2018-06-22 11:02:43,936 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:43,936 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:43,936 INFO ]: Analyzing trace with hash 1978080330, now seen corresponding path program 11 times [2018-06-22 11:02:43,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:43,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:43,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:43,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:43,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:43,945 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:44,241 INFO ]: Checked inductivity of 133 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:02:44,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:44,241 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 11:02:44,247 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:44,283 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:02:44,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:44,285 INFO ]: Computing forward predicates... [2018-06-22 11:02:44,300 INFO ]: Checked inductivity of 133 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:02:44,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:44,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-06-22 11:02:44,319 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:02:44,319 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:02:44,319 INFO ]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:44,319 INFO ]: Start difference. First operand 108 states and 121 transitions. Second operand 21 states. [2018-06-22 11:02:44,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:44,608 INFO ]: Finished difference Result 110 states and 123 transitions. [2018-06-22 11:02:44,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:02:44,608 INFO ]: Start accepts. Automaton has 21 states. Word has length 69 [2018-06-22 11:02:44,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:44,609 INFO ]: With dead ends: 110 [2018-06-22 11:02:44,609 INFO ]: Without dead ends: 110 [2018-06-22 11:02:44,609 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:02:44,609 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:02:44,611 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-06-22 11:02:44,611 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 11:02:44,612 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2018-06-22 11:02:44,612 INFO ]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 69 [2018-06-22 11:02:44,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:44,612 INFO ]: Abstraction has 110 states and 123 transitions. [2018-06-22 11:02:44,612 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:02:44,612 INFO ]: Start isEmpty. Operand 110 states and 123 transitions. [2018-06-22 11:02:44,613 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:44,613 INFO ]: Found error trace [2018-06-22 11:02:44,613 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:44,613 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:44,613 INFO ]: Analyzing trace with hash -1347161945, now seen corresponding path program 10 times [2018-06-22 11:02:44,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:44,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:44,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:44,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:44,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:44,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:44,978 INFO ]: Checked inductivity of 133 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:02:44,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:44,978 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) [2018-06-22 11:02:44,993 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:45,021 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:45,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:45,023 INFO ]: Computing forward predicates... [2018-06-22 11:02:45,062 INFO ]: Checked inductivity of 133 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:02:45,084 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:45,084 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-06-22 11:02:45,085 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:02:45,085 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:02:45,085 INFO ]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:02:45,085 INFO ]: Start difference. First operand 110 states and 123 transitions. Second operand 21 states. [2018-06-22 11:02:45,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:45,344 INFO ]: Finished difference Result 112 states and 125 transitions. [2018-06-22 11:02:45,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:02:45,344 INFO ]: Start accepts. Automaton has 21 states. Word has length 69 [2018-06-22 11:02:45,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:45,345 INFO ]: With dead ends: 112 [2018-06-22 11:02:45,345 INFO ]: Without dead ends: 112 [2018-06-22 11:02:45,345 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:02:45,345 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:02:45,348 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-06-22 11:02:45,348 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:02:45,349 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-06-22 11:02:45,349 INFO ]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 69 [2018-06-22 11:02:45,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:45,349 INFO ]: Abstraction has 112 states and 125 transitions. [2018-06-22 11:02:45,349 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:02:45,349 INFO ]: Start isEmpty. Operand 112 states and 125 transitions. [2018-06-22 11:02:45,351 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:45,351 INFO ]: Found error trace [2018-06-22 11:02:45,351 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:45,351 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:45,351 INFO ]: Analyzing trace with hash 770099023, now seen corresponding path program 11 times [2018-06-22 11:02:45,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:45,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:45,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:45,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:45,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:45,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:46,146 INFO ]: Checked inductivity of 133 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:02:46,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:46,146 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 11:02:46,152 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:46,185 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:02:46,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:46,188 INFO ]: Computing forward predicates... [2018-06-22 11:02:46,225 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:02:46,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:46,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 20 [2018-06-22 11:02:46,258 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:02:46,258 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:02:46,259 INFO ]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:02:46,259 INFO ]: Start difference. First operand 112 states and 125 transitions. Second operand 20 states. [2018-06-22 11:02:46,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:46,497 INFO ]: Finished difference Result 112 states and 124 transitions. [2018-06-22 11:02:46,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:02:46,497 INFO ]: Start accepts. Automaton has 20 states. Word has length 69 [2018-06-22 11:02:46,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:46,497 INFO ]: With dead ends: 112 [2018-06-22 11:02:46,497 INFO ]: Without dead ends: 112 [2018-06-22 11:02:46,498 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:46,498 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:02:46,502 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-06-22 11:02:46,502 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:02:46,502 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-06-22 11:02:46,502 INFO ]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 69 [2018-06-22 11:02:46,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:46,503 INFO ]: Abstraction has 112 states and 124 transitions. [2018-06-22 11:02:46,503 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:02:46,503 INFO ]: Start isEmpty. Operand 112 states and 124 transitions. [2018-06-22 11:02:46,503 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:02:46,503 INFO ]: Found error trace [2018-06-22 11:02:46,503 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:46,503 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:46,503 INFO ]: Analyzing trace with hash 83592547, now seen corresponding path program 7 times [2018-06-22 11:02:46,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:46,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:46,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:46,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:46,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:46,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:46,787 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:02:46,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:46,787 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 11:02:46,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:46,823 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:46,826 INFO ]: Computing forward predicates... [2018-06-22 11:02:47,251 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:02:47,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:47,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-06-22 11:02:47,270 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:02:47,270 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:02:47,270 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:02:47,270 INFO ]: Start difference. First operand 112 states and 124 transitions. Second operand 35 states. [2018-06-22 11:02:47,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:47,623 INFO ]: Finished difference Result 116 states and 127 transitions. [2018-06-22 11:02:47,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:47,624 INFO ]: Start accepts. Automaton has 35 states. Word has length 69 [2018-06-22 11:02:47,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:47,624 INFO ]: With dead ends: 116 [2018-06-22 11:02:47,624 INFO ]: Without dead ends: 98 [2018-06-22 11:02:47,624 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 18 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=1848, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:02:47,625 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:02:47,627 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-06-22 11:02:47,627 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:02:47,627 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-06-22 11:02:47,627 INFO ]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 69 [2018-06-22 11:02:47,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:47,627 INFO ]: Abstraction has 96 states and 107 transitions. [2018-06-22 11:02:47,627 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:02:47,628 INFO ]: Start isEmpty. Operand 96 states and 107 transitions. [2018-06-22 11:02:47,628 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:02:47,628 INFO ]: Found error trace [2018-06-22 11:02:47,628 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:47,628 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:47,628 INFO ]: Analyzing trace with hash 1177351855, now seen corresponding path program 12 times [2018-06-22 11:02:47,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:47,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:47,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:47,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:47,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:47,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:47,794 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 11:02:48,046 INFO ]: Checked inductivity of 156 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:02:48,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:48,046 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 11:02:48,051 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:48,087 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:02:48,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:48,091 INFO ]: Computing forward predicates... [2018-06-22 11:02:48,685 INFO ]: Checked inductivity of 156 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:02:48,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:48,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2018-06-22 11:02:48,704 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:02:48,704 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:02:48,704 INFO ]: CoverageRelationStatistics Valid=101, Invalid=1621, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:02:48,704 INFO ]: Start difference. First operand 96 states and 107 transitions. Second operand 42 states. [2018-06-22 11:02:49,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:49,226 INFO ]: Finished difference Result 118 states and 131 transitions. [2018-06-22 11:02:49,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:02:49,226 INFO ]: Start accepts. Automaton has 42 states. Word has length 73 [2018-06-22 11:02:49,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:49,227 INFO ]: With dead ends: 118 [2018-06-22 11:02:49,227 INFO ]: Without dead ends: 118 [2018-06-22 11:02:49,228 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=2786, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:02:49,228 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:02:49,231 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-06-22 11:02:49,231 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:02:49,231 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-06-22 11:02:49,231 INFO ]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 73 [2018-06-22 11:02:49,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:49,232 INFO ]: Abstraction has 116 states and 129 transitions. [2018-06-22 11:02:49,232 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:02:49,232 INFO ]: Start isEmpty. Operand 116 states and 129 transitions. [2018-06-22 11:02:49,232 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:02:49,232 INFO ]: Found error trace [2018-06-22 11:02:49,232 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:49,232 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:49,232 INFO ]: Analyzing trace with hash -1431639887, now seen corresponding path program 12 times [2018-06-22 11:02:49,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:49,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:49,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:49,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:49,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:49,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:49,770 INFO ]: Checked inductivity of 156 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:02:49,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:49,770 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 11:02:49,777 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:49,812 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:02:49,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:49,817 INFO ]: Computing forward predicates... [2018-06-22 11:02:50,254 INFO ]: Checked inductivity of 156 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-22 11:02:50,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:50,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2018-06-22 11:02:50,273 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:02:50,273 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:02:50,273 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1326, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:02:50,273 INFO ]: Start difference. First operand 116 states and 129 transitions. Second operand 38 states. [2018-06-22 11:02:51,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:51,542 INFO ]: Finished difference Result 140 states and 156 transitions. [2018-06-22 11:02:51,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:02:51,542 INFO ]: Start accepts. Automaton has 38 states. Word has length 73 [2018-06-22 11:02:51,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:51,542 INFO ]: With dead ends: 140 [2018-06-22 11:02:51,542 INFO ]: Without dead ends: 140 [2018-06-22 11:02:51,543 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=3642, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:02:51,543 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 11:02:51,545 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-06-22 11:02:51,545 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:02:51,545 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-06-22 11:02:51,545 INFO ]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 73 [2018-06-22 11:02:51,546 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:51,546 INFO ]: Abstraction has 118 states and 132 transitions. [2018-06-22 11:02:51,546 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:02:51,546 INFO ]: Start isEmpty. Operand 118 states and 132 transitions. [2018-06-22 11:02:51,546 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:51,546 INFO ]: Found error trace [2018-06-22 11:02:51,546 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:51,546 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:51,547 INFO ]: Analyzing trace with hash 1466076116, now seen corresponding path program 13 times [2018-06-22 11:02:51,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:51,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:51,547 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:51,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:51,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:51,864 INFO ]: Checked inductivity of 183 backedges. 56 proven. 53 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:02:51,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:51,865 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:51,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:51,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:51,912 INFO ]: Computing forward predicates... [2018-06-22 11:02:52,039 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:02:52,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:52,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 22 [2018-06-22 11:02:52,069 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:02:52,069 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:02:52,069 INFO ]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:02:52,069 INFO ]: Start difference. First operand 118 states and 132 transitions. Second operand 22 states. [2018-06-22 11:02:53,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:53,190 INFO ]: Finished difference Result 118 states and 131 transitions. [2018-06-22 11:02:53,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:53,191 INFO ]: Start accepts. Automaton has 22 states. Word has length 77 [2018-06-22 11:02:53,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:53,191 INFO ]: With dead ends: 118 [2018-06-22 11:02:53,191 INFO ]: Without dead ends: 118 [2018-06-22 11:02:53,191 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:02:53,191 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:02:53,194 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-06-22 11:02:53,194 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:02:53,195 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-06-22 11:02:53,195 INFO ]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 77 [2018-06-22 11:02:53,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:53,195 INFO ]: Abstraction has 118 states and 131 transitions. [2018-06-22 11:02:53,195 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:02:53,195 INFO ]: Start isEmpty. Operand 118 states and 131 transitions. [2018-06-22 11:02:53,195 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:53,195 INFO ]: Found error trace [2018-06-22 11:02:53,195 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:53,195 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:53,195 INFO ]: Analyzing trace with hash 1193408084, now seen corresponding path program 14 times [2018-06-22 11:02:53,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:53,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:53,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:53,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:54,146 INFO ]: Checked inductivity of 183 backedges. 42 proven. 67 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:02:54,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:54,146 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:54,152 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:54,185 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:54,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:54,188 INFO ]: Computing forward predicates... [2018-06-22 11:02:54,283 INFO ]: Checked inductivity of 183 backedges. 42 proven. 62 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:02:54,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:54,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 23 [2018-06-22 11:02:54,314 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:02:54,314 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:02:54,314 INFO ]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:02:54,314 INFO ]: Start difference. First operand 118 states and 131 transitions. Second operand 23 states. [2018-06-22 11:02:54,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:54,644 INFO ]: Finished difference Result 120 states and 133 transitions. [2018-06-22 11:02:54,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:02:54,645 INFO ]: Start accepts. Automaton has 23 states. Word has length 77 [2018-06-22 11:02:54,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:54,645 INFO ]: With dead ends: 120 [2018-06-22 11:02:54,645 INFO ]: Without dead ends: 120 [2018-06-22 11:02:54,645 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:02:54,646 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:02:54,649 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-22 11:02:54,649 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 11:02:54,650 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-06-22 11:02:54,650 INFO ]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 77 [2018-06-22 11:02:54,650 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:54,650 INFO ]: Abstraction has 120 states and 133 transitions. [2018-06-22 11:02:54,650 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:02:54,650 INFO ]: Start isEmpty. Operand 120 states and 133 transitions. [2018-06-22 11:02:54,651 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:54,651 INFO ]: Found error trace [2018-06-22 11:02:54,651 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:54,651 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:54,651 INFO ]: Analyzing trace with hash -387313075, now seen corresponding path program 8 times [2018-06-22 11:02:54,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:54,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:54,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,651 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:54,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:55,050 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:02:55,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:55,050 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:55,055 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:55,097 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:55,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:55,101 INFO ]: Computing forward predicates... [2018-06-22 11:02:55,516 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:02:55,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:55,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-06-22 11:02:55,536 INFO ]: Interpolant automaton has 39 states [2018-06-22 11:02:55,536 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 11:02:55,537 INFO ]: CoverageRelationStatistics Valid=92, Invalid=1390, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:02:55,537 INFO ]: Start difference. First operand 120 states and 133 transitions. Second operand 39 states. [2018-06-22 11:02:55,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:55,936 INFO ]: Finished difference Result 126 states and 138 transitions. [2018-06-22 11:02:55,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:02:55,937 INFO ]: Start accepts. Automaton has 39 states. Word has length 77 [2018-06-22 11:02:55,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:55,937 INFO ]: With dead ends: 126 [2018-06-22 11:02:55,937 INFO ]: Without dead ends: 106 [2018-06-22 11:02:55,937 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 22 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=2398, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:02:55,937 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:02:55,941 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-06-22 11:02:55,941 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:02:55,941 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-06-22 11:02:55,941 INFO ]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 77 [2018-06-22 11:02:55,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:55,941 INFO ]: Abstraction has 104 states and 116 transitions. [2018-06-22 11:02:55,941 INFO ]: Interpolant automaton has 39 states. [2018-06-22 11:02:55,941 INFO ]: Start isEmpty. Operand 104 states and 116 transitions. [2018-06-22 11:02:55,942 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:55,942 INFO ]: Found error trace [2018-06-22 11:02:55,942 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:55,942 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:55,942 INFO ]: Analyzing trace with hash 1922874555, now seen corresponding path program 13 times [2018-06-22 11:02:55,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:55,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:55,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,943 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:55,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:56,332 INFO ]: Checked inductivity of 183 backedges. 56 proven. 53 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:02:56,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:56,334 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:56,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:56,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:56,374 INFO ]: Computing forward predicates... [2018-06-22 11:02:56,424 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:02:56,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:56,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 22 [2018-06-22 11:02:56,443 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:02:56,443 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:02:56,443 INFO ]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:02:56,443 INFO ]: Start difference. First operand 104 states and 116 transitions. Second operand 22 states. [2018-06-22 11:02:56,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:56,687 INFO ]: Finished difference Result 122 states and 135 transitions. [2018-06-22 11:02:56,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:56,687 INFO ]: Start accepts. Automaton has 22 states. Word has length 77 [2018-06-22 11:02:56,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:56,688 INFO ]: With dead ends: 122 [2018-06-22 11:02:56,688 INFO ]: Without dead ends: 122 [2018-06-22 11:02:56,688 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:02:56,688 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:02:56,691 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-06-22 11:02:56,691 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:02:56,692 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-06-22 11:02:56,692 INFO ]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 77 [2018-06-22 11:02:56,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:56,692 INFO ]: Abstraction has 122 states and 135 transitions. [2018-06-22 11:02:56,692 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:02:56,692 INFO ]: Start isEmpty. Operand 122 states and 135 transitions. [2018-06-22 11:02:56,693 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:56,693 INFO ]: Found error trace [2018-06-22 11:02:56,693 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:56,693 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:56,693 INFO ]: Analyzing trace with hash 632523727, now seen corresponding path program 8 times [2018-06-22 11:02:56,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:56,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:56,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:56,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,702 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:02:56,948 WARN ]: Verification canceled [2018-06-22 11:02:57,060 WARN ]: Timeout [2018-06-22 11:02:57,060 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:02:57 BoogieIcfgContainer [2018-06-22 11:02:57,060 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:02:57,061 INFO ]: Toolchain (without parser) took 55675.21 ms. Allocated memory was 305.7 MB in the beginning and 655.9 MB in the end (delta: 350.2 MB). Free memory was 259.0 MB in the beginning and 628.9 MB in the end (delta: -369.9 MB). Peak memory consumption was 406.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:57,062 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:02:57,062 INFO ]: ChcToBoogie took 45.95 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:57,062 INFO ]: Boogie Preprocessor took 45.30 ms. Allocated memory is still 305.7 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:57,062 INFO ]: RCFGBuilder took 353.54 ms. Allocated memory is still 305.7 MB. Free memory was 256.0 MB in the beginning and 243.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:57,063 INFO ]: TraceAbstraction took 55221.92 ms. Allocated memory was 305.7 MB in the beginning and 655.9 MB in the end (delta: 350.2 MB). Free memory was 242.9 MB in the beginning and 628.9 MB in the end (delta: -386.0 MB). Peak memory consumption was 390.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:57,064 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 45.95 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.30 ms. Allocated memory is still 305.7 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 353.54 ms. Allocated memory is still 305.7 MB. Free memory was 256.0 MB in the beginning and 243.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55221.92 ms. Allocated memory was 305.7 MB in the beginning and 655.9 MB in the end (delta: 350.2 MB). Free memory was 242.9 MB in the beginning and 628.9 MB in the end (delta: -386.0 MB). Peak memory consumption was 390.5 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 78 with TraceHistMax 7, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 48 locations, 1 error locations. TIMEOUT Result, 55.1s OverallTime, 59 OverallIterations, 8 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3313 SDtfs, 612 SDslu, 43921 SDs, 0 SdLazy, 14585 SolverSat, 484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3949 GetRequests, 2241 SyntacticMatches, 181 SemanticMatches, 1527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7332 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=46, 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.3s AutomataMinimizationTime, 58 MinimizatonAttempts, 214 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 5282 NumberOfCodeBlocks, 5282 NumberOfCodeBlocksAsserted, 192 NumberOfCheckSat, 5176 ConstructedInterpolants, 0 QuantifiedInterpolants, 1171096 SizeOfPredicates, 443 NumberOfNonLiveVariables, 11404 ConjunctsInSsa, 2312 ConjunctsInUnsatCore, 106 InterpolantComputations, 12 PerfectInterpolantSequences, 3634/6348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-02-57-076.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-02-57-076.csv Completed graceful shutdown