java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:59:20,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:59:20,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:59:20,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:59:20,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:59:20,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:59:20,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:59:20,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:59:20,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:59:20,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:59:20,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:59:20,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:59:20,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:59:20,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:59:20,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:59:20,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:59:20,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:59:20,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:59:20,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:59:20,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:59:20,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:59:20,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:59:20,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:59:20,994 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:59:20,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:59:20,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:59:20,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:59:21,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:59:21,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:59:21,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:59:21,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:59:21,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:59:21,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:59:21,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:59:21,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:59:21,012 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:59:21,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:59:21,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:59:21,025 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:59:21,025 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:59:21,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:59:21,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:59:21,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:59:21,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:59:21,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:59:21,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:59:21,027 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:59:21,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:59:21,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:59:21,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:59:21,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:59:21,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:59:21,028 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:59:21,029 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:59:21,029 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:59:21,076 INFO ]: Repository-Root is: /tmp [2018-06-22 00:59:21,088 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:59:21,092 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:59:21,093 INFO ]: Initializing SmtParser... [2018-06-22 00:59:21,093 INFO ]: SmtParser initialized [2018-06-22 00:59:21,094 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 [2018-06-22 00:59:21,095 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 00:59:21,183 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 unknown [2018-06-22 00:59:21,786 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 [2018-06-22 00:59:21,792 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:59:21,807 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:59:21,808 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:59:21,808 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:59:21,808 INFO ]: ChcToBoogie initialized [2018-06-22 00:59:21,811 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,897 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21 Unit [2018-06-22 00:59:21,897 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:59:21,898 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:59:21,898 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:59:21,898 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:59:21,918 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,918 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,935 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,935 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,944 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,946 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,948 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (1/1) ... [2018-06-22 00:59:21,953 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:59:21,954 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:59:21,954 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:59:21,954 INFO ]: RCFGBuilder initialized [2018-06-22 00:59:21,955 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:59:21,993 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:59:21,994 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:59:21,994 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:59:21,994 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:59:21,994 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:59:21,994 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 00:59:23,009 INFO ]: Using library mode [2018-06-22 00:59:23,010 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:23 BoogieIcfgContainer [2018-06-22 00:59:23,010 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:59:23,012 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:59:23,012 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:59:23,015 INFO ]: TraceAbstraction initialized [2018-06-22 00:59:23,015 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:21" (1/3) ... [2018-06-22 00:59:23,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b00ffc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:59:23, skipping insertion in model container [2018-06-22 00:59:23,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:21" (2/3) ... [2018-06-22 00:59:23,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b00ffc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:59:23, skipping insertion in model container [2018-06-22 00:59:23,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:23" (3/3) ... [2018-06-22 00:59:23,018 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:59:23,026 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:59:23,034 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:59:23,076 INFO ]: Using default assertion order modulation [2018-06-22 00:59:23,077 INFO ]: Interprodecural is true [2018-06-22 00:59:23,077 INFO ]: Hoare is false [2018-06-22 00:59:23,077 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:59:23,077 INFO ]: Backedges is TWOTRACK [2018-06-22 00:59:23,077 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:59:23,077 INFO ]: Difference is false [2018-06-22 00:59:23,077 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:59:23,077 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:59:23,096 INFO ]: Start isEmpty. Operand 46 states. [2018-06-22 00:59:23,111 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:59:23,111 INFO ]: Found error trace [2018-06-22 00:59:23,112 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:23,113 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:23,119 INFO ]: Analyzing trace with hash 895261568, now seen corresponding path program 1 times [2018-06-22 00:59:23,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:23,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:23,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:23,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:23,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:23,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:24,014 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:24,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:24,016 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:59:24,018 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:59:24,029 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:59:24,029 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:59:24,031 INFO ]: Start difference. First operand 46 states. Second operand 12 states. [2018-06-22 00:59:24,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:24,833 INFO ]: Finished difference Result 95 states and 111 transitions. [2018-06-22 00:59:24,834 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:59:24,835 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 00:59:24,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:24,855 INFO ]: With dead ends: 95 [2018-06-22 00:59:24,855 INFO ]: Without dead ends: 91 [2018-06-22 00:59:24,868 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:24,887 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 00:59:24,914 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 50. [2018-06-22 00:59:24,916 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 00:59:24,917 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-06-22 00:59:24,919 INFO ]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2018-06-22 00:59:24,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:24,920 INFO ]: Abstraction has 50 states and 57 transitions. [2018-06-22 00:59:24,920 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:59:24,920 INFO ]: Start isEmpty. Operand 50 states and 57 transitions. [2018-06-22 00:59:24,921 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:59:24,921 INFO ]: Found error trace [2018-06-22 00:59:24,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:24,921 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:24,921 INFO ]: Analyzing trace with hash -1916791847, now seen corresponding path program 1 times [2018-06-22 00:59:24,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:24,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:24,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:24,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:24,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:24,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:25,234 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:25,234 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:25,234 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:59:25,236 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:59:25,236 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:59:25,236 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:59:25,236 INFO ]: Start difference. First operand 50 states and 57 transitions. Second operand 12 states. [2018-06-22 00:59:25,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:25,869 INFO ]: Finished difference Result 101 states and 117 transitions. [2018-06-22 00:59:25,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:59:25,869 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-22 00:59:25,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:25,871 INFO ]: With dead ends: 101 [2018-06-22 00:59:25,871 INFO ]: Without dead ends: 97 [2018-06-22 00:59:25,872 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:25,872 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 00:59:25,877 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 50. [2018-06-22 00:59:25,877 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 00:59:25,878 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-06-22 00:59:25,879 INFO ]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2018-06-22 00:59:25,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:25,879 INFO ]: Abstraction has 50 states and 57 transitions. [2018-06-22 00:59:25,879 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:59:25,879 INFO ]: Start isEmpty. Operand 50 states and 57 transitions. [2018-06-22 00:59:25,880 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 00:59:25,880 INFO ]: Found error trace [2018-06-22 00:59:25,880 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] [2018-06-22 00:59:25,880 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:25,880 INFO ]: Analyzing trace with hash -221375861, now seen corresponding path program 1 times [2018-06-22 00:59:25,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:25,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:25,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:25,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:25,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:25,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:26,241 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:26,241 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:26,241 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 00:59:26,241 INFO ]: Interpolant automaton has 15 states [2018-06-22 00:59:26,241 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 00:59:26,242 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 00:59:26,242 INFO ]: Start difference. First operand 50 states and 57 transitions. Second operand 15 states. [2018-06-22 00:59:26,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:26,897 INFO ]: Finished difference Result 104 states and 120 transitions. [2018-06-22 00:59:26,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:59:26,900 INFO ]: Start accepts. Automaton has 15 states. Word has length 23 [2018-06-22 00:59:26,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:26,902 INFO ]: With dead ends: 104 [2018-06-22 00:59:26,902 INFO ]: Without dead ends: 101 [2018-06-22 00:59:26,902 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:59:26,902 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 00:59:26,911 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 54. [2018-06-22 00:59:26,911 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 00:59:26,913 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-06-22 00:59:26,913 INFO ]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 23 [2018-06-22 00:59:26,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:26,913 INFO ]: Abstraction has 54 states and 61 transitions. [2018-06-22 00:59:26,913 INFO ]: Interpolant automaton has 15 states. [2018-06-22 00:59:26,913 INFO ]: Start isEmpty. Operand 54 states and 61 transitions. [2018-06-22 00:59:26,914 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 00:59:26,914 INFO ]: Found error trace [2018-06-22 00:59:26,914 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 00:59:26,914 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:26,914 INFO ]: Analyzing trace with hash 353184565, now seen corresponding path program 1 times [2018-06-22 00:59:26,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:26,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:26,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:26,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:26,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:26,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:27,135 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:27,135 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:27,135 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 00:59:27,136 INFO ]: Interpolant automaton has 17 states [2018-06-22 00:59:27,136 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 00:59:27,136 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:59:27,136 INFO ]: Start difference. First operand 54 states and 61 transitions. Second operand 17 states. [2018-06-22 00:59:28,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:28,026 INFO ]: Finished difference Result 100 states and 116 transitions. [2018-06-22 00:59:28,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 00:59:28,106 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 00:59:28,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:28,107 INFO ]: With dead ends: 100 [2018-06-22 00:59:28,107 INFO ]: Without dead ends: 97 [2018-06-22 00:59:28,108 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2018-06-22 00:59:28,108 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 00:59:28,114 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 46. [2018-06-22 00:59:28,114 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 00:59:28,115 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-06-22 00:59:28,115 INFO ]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-06-22 00:59:28,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:28,115 INFO ]: Abstraction has 46 states and 53 transitions. [2018-06-22 00:59:28,116 INFO ]: Interpolant automaton has 17 states. [2018-06-22 00:59:28,116 INFO ]: Start isEmpty. Operand 46 states and 53 transitions. [2018-06-22 00:59:28,116 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:28,116 INFO ]: Found error trace [2018-06-22 00:59:28,116 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] [2018-06-22 00:59:28,117 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:28,117 INFO ]: Analyzing trace with hash 226428583, now seen corresponding path program 1 times [2018-06-22 00:59:28,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:28,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:28,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:28,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:28,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:28,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:28,476 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:28,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:28,476 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:28,477 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:28,477 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:28,477 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:28,477 INFO ]: Start difference. First operand 46 states and 53 transitions. Second operand 21 states. [2018-06-22 00:59:29,851 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-06-22 00:59:31,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:31,404 INFO ]: Finished difference Result 396 states and 464 transitions. [2018-06-22 00:59:31,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 00:59:31,404 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:31,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:31,409 INFO ]: With dead ends: 396 [2018-06-22 00:59:31,409 INFO ]: Without dead ends: 392 [2018-06-22 00:59:31,412 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2049, Invalid=5783, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 00:59:31,413 INFO ]: Start minimizeSevpa. Operand 392 states. [2018-06-22 00:59:31,425 INFO ]: Finished minimizeSevpa. Reduced states from 392 to 61. [2018-06-22 00:59:31,425 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 00:59:31,426 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-06-22 00:59:31,426 INFO ]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 30 [2018-06-22 00:59:31,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:31,427 INFO ]: Abstraction has 61 states and 71 transitions. [2018-06-22 00:59:31,427 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:31,427 INFO ]: Start isEmpty. Operand 61 states and 71 transitions. [2018-06-22 00:59:31,427 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:31,428 INFO ]: Found error trace [2018-06-22 00:59:31,428 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] [2018-06-22 00:59:31,428 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:31,428 INFO ]: Analyzing trace with hash 208180451, now seen corresponding path program 1 times [2018-06-22 00:59:31,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:31,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:31,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:31,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:31,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:31,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:31,733 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:31,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:31,733 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:31,733 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:31,733 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:31,734 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:31,734 INFO ]: Start difference. First operand 61 states and 71 transitions. Second operand 21 states. [2018-06-22 00:59:34,442 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 00:59:34,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:34,765 INFO ]: Finished difference Result 400 states and 471 transitions. [2018-06-22 00:59:34,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 00:59:34,767 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:34,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:34,770 INFO ]: With dead ends: 400 [2018-06-22 00:59:34,770 INFO ]: Without dead ends: 396 [2018-06-22 00:59:34,777 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2049, Invalid=5783, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 00:59:34,778 INFO ]: Start minimizeSevpa. Operand 396 states. [2018-06-22 00:59:34,792 INFO ]: Finished minimizeSevpa. Reduced states from 396 to 80. [2018-06-22 00:59:34,792 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 00:59:34,796 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-06-22 00:59:34,796 INFO ]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 30 [2018-06-22 00:59:34,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:34,796 INFO ]: Abstraction has 80 states and 96 transitions. [2018-06-22 00:59:34,797 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:34,797 INFO ]: Start isEmpty. Operand 80 states and 96 transitions. [2018-06-22 00:59:34,797 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:34,797 INFO ]: Found error trace [2018-06-22 00:59:34,797 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] [2018-06-22 00:59:34,797 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:34,797 INFO ]: Analyzing trace with hash -644506201, now seen corresponding path program 1 times [2018-06-22 00:59:34,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:34,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:34,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:34,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:34,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:34,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:35,137 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:35,137 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:35,137 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:35,137 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:35,137 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:35,137 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:35,138 INFO ]: Start difference. First operand 80 states and 96 transitions. Second operand 21 states. [2018-06-22 00:59:36,468 WARN ]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-06-22 00:59:36,618 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-06-22 00:59:38,293 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-22 00:59:38,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:38,610 INFO ]: Finished difference Result 299 states and 353 transitions. [2018-06-22 00:59:38,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-22 00:59:38,610 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:38,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:38,611 INFO ]: With dead ends: 299 [2018-06-22 00:59:38,612 INFO ]: Without dead ends: 295 [2018-06-22 00:59:38,613 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1525, Invalid=4025, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 00:59:38,613 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-22 00:59:38,620 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 91. [2018-06-22 00:59:38,620 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 00:59:38,621 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-06-22 00:59:38,622 INFO ]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 30 [2018-06-22 00:59:38,622 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:38,622 INFO ]: Abstraction has 91 states and 109 transitions. [2018-06-22 00:59:38,622 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:38,622 INFO ]: Start isEmpty. Operand 91 states and 109 transitions. [2018-06-22 00:59:38,623 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:38,623 INFO ]: Found error trace [2018-06-22 00:59:38,623 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] [2018-06-22 00:59:38,623 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:38,623 INFO ]: Analyzing trace with hash -1685910354, now seen corresponding path program 1 times [2018-06-22 00:59:38,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:38,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:38,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:38,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:38,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:38,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:38,964 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:38,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:38,964 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:38,965 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:38,965 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:38,965 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:38,965 INFO ]: Start difference. First operand 91 states and 109 transitions. Second operand 21 states. [2018-06-22 00:59:41,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:41,503 INFO ]: Finished difference Result 441 states and 520 transitions. [2018-06-22 00:59:41,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 00:59:41,505 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:41,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:41,508 INFO ]: With dead ends: 441 [2018-06-22 00:59:41,508 INFO ]: Without dead ends: 437 [2018-06-22 00:59:41,514 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2049, Invalid=5783, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 00:59:41,514 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-22 00:59:41,538 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 95. [2018-06-22 00:59:41,538 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 00:59:41,539 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2018-06-22 00:59:41,539 INFO ]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 30 [2018-06-22 00:59:41,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:41,540 INFO ]: Abstraction has 95 states and 113 transitions. [2018-06-22 00:59:41,540 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:41,540 INFO ]: Start isEmpty. Operand 95 states and 113 transitions. [2018-06-22 00:59:41,541 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:41,541 INFO ]: Found error trace [2018-06-22 00:59:41,541 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] [2018-06-22 00:59:41,541 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:41,541 INFO ]: Analyzing trace with hash -1704158486, now seen corresponding path program 1 times [2018-06-22 00:59:41,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:41,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:41,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:41,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:41,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:41,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:42,492 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:42,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:42,492 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:42,492 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:42,493 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:42,493 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:42,493 INFO ]: Start difference. First operand 95 states and 113 transitions. Second operand 21 states. [2018-06-22 00:59:44,834 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:44,834 INFO ]: Finished difference Result 445 states and 527 transitions. [2018-06-22 00:59:44,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 00:59:44,837 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:44,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:44,839 INFO ]: With dead ends: 445 [2018-06-22 00:59:44,839 INFO ]: Without dead ends: 441 [2018-06-22 00:59:44,841 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2049, Invalid=5783, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 00:59:44,842 INFO ]: Start minimizeSevpa. Operand 441 states. [2018-06-22 00:59:44,851 INFO ]: Finished minimizeSevpa. Reduced states from 441 to 102. [2018-06-22 00:59:44,851 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 00:59:44,854 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2018-06-22 00:59:44,854 INFO ]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 30 [2018-06-22 00:59:44,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:44,854 INFO ]: Abstraction has 102 states and 122 transitions. [2018-06-22 00:59:44,854 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:44,854 INFO ]: Start isEmpty. Operand 102 states and 122 transitions. [2018-06-22 00:59:44,855 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 00:59:44,855 INFO ]: Found error trace [2018-06-22 00:59:44,855 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] [2018-06-22 00:59:44,855 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:44,856 INFO ]: Analyzing trace with hash 1738122158, now seen corresponding path program 1 times [2018-06-22 00:59:44,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:44,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:44,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:44,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:44,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:44,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:45,146 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:45,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:45,147 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 00:59:45,147 INFO ]: Interpolant automaton has 21 states [2018-06-22 00:59:45,147 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 00:59:45,147 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:59:45,147 INFO ]: Start difference. First operand 102 states and 122 transitions. Second operand 21 states. [2018-06-22 00:59:46,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:46,933 INFO ]: Finished difference Result 344 states and 409 transitions. [2018-06-22 00:59:46,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-22 00:59:46,933 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-22 00:59:46,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:46,934 INFO ]: With dead ends: 344 [2018-06-22 00:59:46,934 INFO ]: Without dead ends: 340 [2018-06-22 00:59:46,936 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1525, Invalid=4025, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 00:59:46,936 INFO ]: Start minimizeSevpa. Operand 340 states. [2018-06-22 00:59:46,942 INFO ]: Finished minimizeSevpa. Reduced states from 340 to 91. [2018-06-22 00:59:46,942 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 00:59:46,943 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-06-22 00:59:46,943 INFO ]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 30 [2018-06-22 00:59:46,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:46,943 INFO ]: Abstraction has 91 states and 109 transitions. [2018-06-22 00:59:46,943 INFO ]: Interpolant automaton has 21 states. [2018-06-22 00:59:46,943 INFO ]: Start isEmpty. Operand 91 states and 109 transitions. [2018-06-22 00:59:46,948 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:59:46,948 INFO ]: Found error trace [2018-06-22 00:59:46,948 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] [2018-06-22 00:59:46,948 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:46,949 INFO ]: Analyzing trace with hash 1258733192, now seen corresponding path program 1 times [2018-06-22 00:59:46,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:46,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:46,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:46,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:46,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:46,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:47,249 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:47,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:47,249 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 00:59:47,250 INFO ]: Interpolant automaton has 22 states [2018-06-22 00:59:47,250 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 00:59:47,250 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:47,250 INFO ]: Start difference. First operand 91 states and 109 transitions. Second operand 22 states. [2018-06-22 00:59:50,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:50,203 INFO ]: Finished difference Result 603 states and 710 transitions. [2018-06-22 00:59:50,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 00:59:50,206 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 00:59:50,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:50,209 INFO ]: With dead ends: 603 [2018-06-22 00:59:50,209 INFO ]: Without dead ends: 599 [2018-06-22 00:59:50,214 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 00:59:50,215 INFO ]: Start minimizeSevpa. Operand 599 states. [2018-06-22 00:59:50,226 INFO ]: Finished minimizeSevpa. Reduced states from 599 to 110. [2018-06-22 00:59:50,227 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 00:59:50,227 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2018-06-22 00:59:50,227 INFO ]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 31 [2018-06-22 00:59:50,228 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:50,228 INFO ]: Abstraction has 110 states and 133 transitions. [2018-06-22 00:59:50,228 INFO ]: Interpolant automaton has 22 states. [2018-06-22 00:59:50,228 INFO ]: Start isEmpty. Operand 110 states and 133 transitions. [2018-06-22 00:59:50,228 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:59:50,228 INFO ]: Found error trace [2018-06-22 00:59:50,229 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] [2018-06-22 00:59:50,229 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:50,229 INFO ]: Analyzing trace with hash 1240485060, now seen corresponding path program 1 times [2018-06-22 00:59:50,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:50,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:50,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:50,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:50,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:50,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:51,199 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:51,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:51,199 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 00:59:51,199 INFO ]: Interpolant automaton has 22 states [2018-06-22 00:59:51,199 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 00:59:51,199 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:51,199 INFO ]: Start difference. First operand 110 states and 133 transitions. Second operand 22 states. [2018-06-22 00:59:52,627 WARN ]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-06-22 00:59:54,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:54,782 INFO ]: Finished difference Result 608 states and 719 transitions. [2018-06-22 00:59:54,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 00:59:54,783 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 00:59:54,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:54,785 INFO ]: With dead ends: 608 [2018-06-22 00:59:54,785 INFO ]: Without dead ends: 604 [2018-06-22 00:59:54,788 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3565 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 00:59:54,789 INFO ]: Start minimizeSevpa. Operand 604 states. [2018-06-22 00:59:54,798 INFO ]: Finished minimizeSevpa. Reduced states from 604 to 128. [2018-06-22 00:59:54,798 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 00:59:54,799 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2018-06-22 00:59:54,799 INFO ]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 31 [2018-06-22 00:59:54,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:54,799 INFO ]: Abstraction has 128 states and 158 transitions. [2018-06-22 00:59:54,799 INFO ]: Interpolant automaton has 22 states. [2018-06-22 00:59:54,799 INFO ]: Start isEmpty. Operand 128 states and 158 transitions. [2018-06-22 00:59:54,801 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:59:54,801 INFO ]: Found error trace [2018-06-22 00:59:54,802 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] [2018-06-22 00:59:54,802 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:54,802 INFO ]: Analyzing trace with hash 387798408, now seen corresponding path program 1 times [2018-06-22 00:59:54,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:54,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:54,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:54,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:54,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:54,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:55,088 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:55,088 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:55,088 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 00:59:55,089 INFO ]: Interpolant automaton has 22 states [2018-06-22 00:59:55,089 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 00:59:55,089 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:55,089 INFO ]: Start difference. First operand 128 states and 158 transitions. Second operand 22 states. [2018-06-22 00:59:56,427 WARN ]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-06-22 00:59:57,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:57,652 INFO ]: Finished difference Result 469 states and 559 transitions. [2018-06-22 00:59:57,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 00:59:57,652 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 00:59:57,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:57,653 INFO ]: With dead ends: 469 [2018-06-22 00:59:57,653 INFO ]: Without dead ends: 465 [2018-06-22 00:59:57,654 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2081, Invalid=5751, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 00:59:57,655 INFO ]: Start minimizeSevpa. Operand 465 states. [2018-06-22 00:59:57,660 INFO ]: Finished minimizeSevpa. Reduced states from 465 to 140. [2018-06-22 00:59:57,660 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 00:59:57,661 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2018-06-22 00:59:57,661 INFO ]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 31 [2018-06-22 00:59:57,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:57,661 INFO ]: Abstraction has 140 states and 173 transitions. [2018-06-22 00:59:57,661 INFO ]: Interpolant automaton has 22 states. [2018-06-22 00:59:57,661 INFO ]: Start isEmpty. Operand 140 states and 173 transitions. [2018-06-22 00:59:57,662 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:59:57,662 INFO ]: Found error trace [2018-06-22 00:59:57,662 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] [2018-06-22 00:59:57,662 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:57,662 INFO ]: Analyzing trace with hash 876732388, now seen corresponding path program 1 times [2018-06-22 00:59:57,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:57,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:57,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:57,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:57,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:57,684 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:57,968 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:59:57,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:57,969 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 00:59:57,969 INFO ]: Interpolant automaton has 22 states [2018-06-22 00:59:57,969 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 00:59:57,969 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:59:57,969 INFO ]: Start difference. First operand 140 states and 173 transitions. Second operand 22 states. [2018-06-22 01:00:01,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:01,091 INFO ]: Finished difference Result 642 states and 762 transitions. [2018-06-22 01:00:01,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:01,092 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:01,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:01,094 INFO ]: With dead ends: 642 [2018-06-22 01:00:01,094 INFO ]: Without dead ends: 638 [2018-06-22 01:00:01,095 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3543 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:01,098 INFO ]: Start minimizeSevpa. Operand 638 states. [2018-06-22 01:00:01,105 INFO ]: Finished minimizeSevpa. Reduced states from 638 to 152. [2018-06-22 01:00:01,105 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 01:00:01,106 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2018-06-22 01:00:01,106 INFO ]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 31 [2018-06-22 01:00:01,106 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:01,106 INFO ]: Abstraction has 152 states and 189 transitions. [2018-06-22 01:00:01,106 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:01,106 INFO ]: Start isEmpty. Operand 152 states and 189 transitions. [2018-06-22 01:00:01,107 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:01,107 INFO ]: Found error trace [2018-06-22 01:00:01,107 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] [2018-06-22 01:00:01,107 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:01,107 INFO ]: Analyzing trace with hash 858484256, now seen corresponding path program 1 times [2018-06-22 01:00:01,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:01,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:01,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:01,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:01,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:01,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:01,480 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:01,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:01,480 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:01,481 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:01,481 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:01,481 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:01,481 INFO ]: Start difference. First operand 152 states and 189 transitions. Second operand 22 states. [2018-06-22 01:00:04,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:04,470 INFO ]: Finished difference Result 647 states and 771 transitions. [2018-06-22 01:00:04,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:04,472 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:04,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:04,474 INFO ]: With dead ends: 647 [2018-06-22 01:00:04,474 INFO ]: Without dead ends: 643 [2018-06-22 01:00:04,476 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3563 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:04,477 INFO ]: Start minimizeSevpa. Operand 643 states. [2018-06-22 01:00:04,484 INFO ]: Finished minimizeSevpa. Reduced states from 643 to 169. [2018-06-22 01:00:04,484 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 01:00:04,485 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 212 transitions. [2018-06-22 01:00:04,485 INFO ]: Start accepts. Automaton has 169 states and 212 transitions. Word has length 31 [2018-06-22 01:00:04,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:04,485 INFO ]: Abstraction has 169 states and 212 transitions. [2018-06-22 01:00:04,485 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:04,485 INFO ]: Start isEmpty. Operand 169 states and 212 transitions. [2018-06-22 01:00:04,485 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:04,485 INFO ]: Found error trace [2018-06-22 01:00:04,485 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] [2018-06-22 01:00:04,485 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:04,485 INFO ]: Analyzing trace with hash 5797604, now seen corresponding path program 1 times [2018-06-22 01:00:04,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:04,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:04,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:04,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:04,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:04,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:04,810 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:04,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:04,810 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:04,810 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:04,810 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:04,810 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:04,810 INFO ]: Start difference. First operand 169 states and 212 transitions. Second operand 22 states. [2018-06-22 01:00:07,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:07,130 INFO ]: Finished difference Result 508 states and 611 transitions. [2018-06-22 01:00:07,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 01:00:07,130 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:07,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:07,131 INFO ]: With dead ends: 508 [2018-06-22 01:00:07,131 INFO ]: Without dead ends: 504 [2018-06-22 01:00:07,132 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2081, Invalid=5751, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 01:00:07,132 INFO ]: Start minimizeSevpa. Operand 504 states. [2018-06-22 01:00:07,138 INFO ]: Finished minimizeSevpa. Reduced states from 504 to 181. [2018-06-22 01:00:07,138 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-22 01:00:07,139 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2018-06-22 01:00:07,139 INFO ]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 31 [2018-06-22 01:00:07,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:07,139 INFO ]: Abstraction has 181 states and 227 transitions. [2018-06-22 01:00:07,139 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:07,139 INFO ]: Start isEmpty. Operand 181 states and 227 transitions. [2018-06-22 01:00:07,139 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:07,139 INFO ]: Found error trace [2018-06-22 01:00:07,139 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] [2018-06-22 01:00:07,139 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:07,140 INFO ]: Analyzing trace with hash 2105768289, now seen corresponding path program 1 times [2018-06-22 01:00:07,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:07,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:07,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:07,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:07,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:07,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:07,495 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:07,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:07,495 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:07,495 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:07,495 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:07,495 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:07,496 INFO ]: Start difference. First operand 181 states and 227 transitions. Second operand 22 states. [2018-06-22 01:00:10,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:10,556 INFO ]: Finished difference Result 686 states and 820 transitions. [2018-06-22 01:00:10,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:10,556 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:10,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:10,558 INFO ]: With dead ends: 686 [2018-06-22 01:00:10,558 INFO ]: Without dead ends: 682 [2018-06-22 01:00:10,559 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:10,559 INFO ]: Start minimizeSevpa. Operand 682 states. [2018-06-22 01:00:10,567 INFO ]: Finished minimizeSevpa. Reduced states from 682 to 181. [2018-06-22 01:00:10,567 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-22 01:00:10,567 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2018-06-22 01:00:10,567 INFO ]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 31 [2018-06-22 01:00:10,567 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:10,567 INFO ]: Abstraction has 181 states and 227 transitions. [2018-06-22 01:00:10,568 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:10,568 INFO ]: Start isEmpty. Operand 181 states and 227 transitions. [2018-06-22 01:00:10,568 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:10,568 INFO ]: Found error trace [2018-06-22 01:00:10,568 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] [2018-06-22 01:00:10,568 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:10,568 INFO ]: Analyzing trace with hash 2087520157, now seen corresponding path program 1 times [2018-06-22 01:00:10,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:10,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:10,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:10,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:10,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:10,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:10,982 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:10,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:10,982 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:10,982 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:10,982 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:10,982 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:10,982 INFO ]: Start difference. First operand 181 states and 227 transitions. Second operand 22 states. [2018-06-22 01:00:13,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:13,782 INFO ]: Finished difference Result 691 states and 829 transitions. [2018-06-22 01:00:13,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:13,783 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:13,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:13,784 INFO ]: With dead ends: 691 [2018-06-22 01:00:13,785 INFO ]: Without dead ends: 687 [2018-06-22 01:00:13,786 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3565 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:13,786 INFO ]: Start minimizeSevpa. Operand 687 states. [2018-06-22 01:00:13,793 INFO ]: Finished minimizeSevpa. Reduced states from 687 to 186. [2018-06-22 01:00:13,793 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-22 01:00:13,793 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2018-06-22 01:00:13,793 INFO ]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 31 [2018-06-22 01:00:13,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:13,793 INFO ]: Abstraction has 186 states and 234 transitions. [2018-06-22 01:00:13,793 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:13,793 INFO ]: Start isEmpty. Operand 186 states and 234 transitions. [2018-06-22 01:00:13,794 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:13,794 INFO ]: Found error trace [2018-06-22 01:00:13,794 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] [2018-06-22 01:00:13,794 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:13,794 INFO ]: Analyzing trace with hash 1234833505, now seen corresponding path program 1 times [2018-06-22 01:00:13,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:13,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:13,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:13,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:13,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:13,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:14,144 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:14,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:14,144 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:14,144 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:14,145 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:14,145 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:14,145 INFO ]: Start difference. First operand 186 states and 234 transitions. Second operand 22 states. [2018-06-22 01:00:16,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:16,420 INFO ]: Finished difference Result 552 states and 669 transitions. [2018-06-22 01:00:16,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 01:00:16,420 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:16,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:16,421 INFO ]: With dead ends: 552 [2018-06-22 01:00:16,421 INFO ]: Without dead ends: 548 [2018-06-22 01:00:16,422 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2081, Invalid=5751, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 01:00:16,422 INFO ]: Start minimizeSevpa. Operand 548 states. [2018-06-22 01:00:16,431 INFO ]: Finished minimizeSevpa. Reduced states from 548 to 182. [2018-06-22 01:00:16,431 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 01:00:16,432 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2018-06-22 01:00:16,432 INFO ]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 31 [2018-06-22 01:00:16,432 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:16,432 INFO ]: Abstraction has 182 states and 229 transitions. [2018-06-22 01:00:16,432 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:16,432 INFO ]: Start isEmpty. Operand 182 states and 229 transitions. [2018-06-22 01:00:16,433 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:16,433 INFO ]: Found error trace [2018-06-22 01:00:16,433 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] [2018-06-22 01:00:16,433 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:16,433 INFO ]: Analyzing trace with hash 1723767485, now seen corresponding path program 1 times [2018-06-22 01:00:16,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:16,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:16,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:16,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:16,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:16,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:17,445 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:17,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:17,446 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:17,446 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:17,446 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:17,446 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:17,446 INFO ]: Start difference. First operand 182 states and 229 transitions. Second operand 22 states. [2018-06-22 01:00:20,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:20,258 INFO ]: Finished difference Result 725 states and 872 transitions. [2018-06-22 01:00:20,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:20,259 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:20,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:20,260 INFO ]: With dead ends: 725 [2018-06-22 01:00:20,260 INFO ]: Without dead ends: 721 [2018-06-22 01:00:20,261 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3543 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:20,261 INFO ]: Start minimizeSevpa. Operand 721 states. [2018-06-22 01:00:20,268 INFO ]: Finished minimizeSevpa. Reduced states from 721 to 182. [2018-06-22 01:00:20,268 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 01:00:20,269 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2018-06-22 01:00:20,269 INFO ]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 31 [2018-06-22 01:00:20,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:20,269 INFO ]: Abstraction has 182 states and 229 transitions. [2018-06-22 01:00:20,269 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:20,269 INFO ]: Start isEmpty. Operand 182 states and 229 transitions. [2018-06-22 01:00:20,270 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:20,270 INFO ]: Found error trace [2018-06-22 01:00:20,270 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] [2018-06-22 01:00:20,270 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:20,270 INFO ]: Analyzing trace with hash 1705519353, now seen corresponding path program 1 times [2018-06-22 01:00:20,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:20,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:20,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:20,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:20,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:20,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:21,085 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:21,085 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:21,085 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:21,085 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:21,085 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:21,085 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:21,085 INFO ]: Start difference. First operand 182 states and 229 transitions. Second operand 22 states. [2018-06-22 01:00:23,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:23,933 INFO ]: Finished difference Result 730 states and 881 transitions. [2018-06-22 01:00:23,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 01:00:23,936 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:00:23,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:23,938 INFO ]: With dead ends: 730 [2018-06-22 01:00:23,938 INFO ]: Without dead ends: 726 [2018-06-22 01:00:23,939 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3563 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2847, Invalid=8495, Unknown=0, NotChecked=0, Total=11342 [2018-06-22 01:00:23,939 INFO ]: Start minimizeSevpa. Operand 726 states. [2018-06-22 01:00:23,948 INFO ]: Finished minimizeSevpa. Reduced states from 726 to 186. [2018-06-22 01:00:23,948 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-22 01:00:23,949 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2018-06-22 01:00:23,949 INFO ]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 31 [2018-06-22 01:00:23,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:23,949 INFO ]: Abstraction has 186 states and 234 transitions. [2018-06-22 01:00:23,949 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:00:23,949 INFO ]: Start isEmpty. Operand 186 states and 234 transitions. [2018-06-22 01:00:23,949 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:00:23,949 INFO ]: Found error trace [2018-06-22 01:00:23,949 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] [2018-06-22 01:00:23,949 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:23,950 INFO ]: Analyzing trace with hash 852832701, now seen corresponding path program 1 times [2018-06-22 01:00:23,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:23,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:23,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:23,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:23,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:23,966 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:24,296 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:00:24,296 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:24,296 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 01:00:24,296 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:00:24,296 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:00:24,296 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:00:24,296 INFO ]: Start difference. First operand 186 states and 234 transitions. Second operand 22 states. Received shutdown request... [2018-06-22 01:00:24,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:00:24,526 WARN ]: Verification canceled [2018-06-22 01:00:24,531 WARN ]: Timeout [2018-06-22 01:00:24,531 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:00:24 BoogieIcfgContainer [2018-06-22 01:00:24,531 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:00:24,531 INFO ]: Toolchain (without parser) took 62738.67 ms. Allocated memory was 304.1 MB in the beginning and 835.7 MB in the end (delta: 531.6 MB). Free memory was 226.5 MB in the beginning and 540.8 MB in the end (delta: -314.4 MB). Peak memory consumption was 217.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:24,532 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:00:24,532 INFO ]: ChcToBoogie took 89.60 ms. Allocated memory is still 304.1 MB. Free memory was 226.5 MB in the beginning and 223.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:24,532 INFO ]: Boogie Preprocessor took 55.85 ms. Allocated memory is still 304.1 MB. Free memory was 223.5 MB in the beginning and 221.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:24,533 INFO ]: RCFGBuilder took 1056.30 ms. Allocated memory was 304.1 MB in the beginning and 323.0 MB in the end (delta: 18.9 MB). Free memory was 221.4 MB in the beginning and 265.7 MB in the end (delta: -44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:24,533 INFO ]: TraceAbstraction took 61519.10 ms. Allocated memory was 323.0 MB in the beginning and 835.7 MB in the end (delta: 512.8 MB). Free memory was 265.7 MB in the beginning and 540.8 MB in the end (delta: -275.2 MB). Peak memory consumption was 237.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:24,535 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 89.60 ms. Allocated memory is still 304.1 MB. Free memory was 226.5 MB in the beginning and 223.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 55.85 ms. Allocated memory is still 304.1 MB. Free memory was 223.5 MB in the beginning and 221.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1056.30 ms. Allocated memory was 304.1 MB in the beginning and 323.0 MB in the end (delta: 18.9 MB). Free memory was 221.4 MB in the beginning and 265.7 MB in the end (delta: -44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61519.10 ms. Allocated memory was 323.0 MB in the beginning and 835.7 MB in the end (delta: 512.8 MB). Free memory was 265.7 MB in the beginning and 540.8 MB in the end (delta: -275.2 MB). Peak memory consumption was 237.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (186states) and interpolant automaton (currently 11 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. TIMEOUT Result, 61.4s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 50.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1864 SDtfs, 18040 SDslu, 40218 SDs, 0 SdLazy, 8742 SolverSat, 570 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1799 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46622 ImplicationChecksByTransitivity, 50.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=18, 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 6987 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 86340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 36/36 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/20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-00-24-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-00-24-544.csv Completed graceful shutdown