java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/gib2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:46:37,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:46:37,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:46:37,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:46:37,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:46:37,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:46:37,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:46:37,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:46:37,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:46:37,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:46:37,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:46:37,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:46:37,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:46:37,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:46:37,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:46:37,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:46:37,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:46:37,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:46:37,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:46:37,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:46:37,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:46:37,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:46:37,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:46:37,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:46:37,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:46:37,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:46:37,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:46:37,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:46:37,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:46:37,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:46:37,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:46:37,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:46:37,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:46:37,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:46:37,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:46:37,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:46:37,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:46:37,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:46:37,326 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:46:37,326 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:46:37,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:46:37,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:46:37,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:46:37,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:46:37,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:46:37,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:46:37,329 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:46:37,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:46:37,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:46:37,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:46:37,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:46:37,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:46:37,330 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:46:37,331 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:46:37,332 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:46:37,384 INFO ]: Repository-Root is: /tmp [2018-06-22 01:46:37,400 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:46:37,407 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:46:37,409 INFO ]: Initializing SmtParser... [2018-06-22 01:46:37,409 INFO ]: SmtParser initialized [2018-06-22 01:46:37,410 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/gib2.smt2 [2018-06-22 01:46:37,411 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:46:37,507 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/gib2.smt2 unknown [2018-06-22 01:46:37,724 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/gib2.smt2 [2018-06-22 01:46:37,733 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:46:37,742 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:46:37,743 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:46:37,743 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:46:37,743 INFO ]: ChcToBoogie initialized [2018-06-22 01:46:37,748 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,810 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37 Unit [2018-06-22 01:46:37,811 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:46:37,813 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:46:37,813 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:46:37,813 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:46:37,838 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,838 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,849 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,849 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,853 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,857 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,858 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... [2018-06-22 01:46:37,861 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:46:37,862 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:46:37,862 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:46:37,862 INFO ]: RCFGBuilder initialized [2018-06-22 01:46:37,863 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:46:37,887 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:46:37,888 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:46:37,888 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:46:37,888 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:46:37,888 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:46:37,888 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:46:38,222 INFO ]: Using library mode [2018-06-22 01:46:38,222 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:46:38 BoogieIcfgContainer [2018-06-22 01:46:38,222 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:46:38,225 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:46:38,225 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:46:38,235 INFO ]: TraceAbstraction initialized [2018-06-22 01:46:38,235 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:46:37" (1/3) ... [2018-06-22 01:46:38,236 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587021cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:46:38, skipping insertion in model container [2018-06-22 01:46:38,236 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:37" (2/3) ... [2018-06-22 01:46:38,236 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587021cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:46:38, skipping insertion in model container [2018-06-22 01:46:38,236 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:46:38" (3/3) ... [2018-06-22 01:46:38,238 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:46:38,250 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:46:38,262 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:46:38,328 INFO ]: Using default assertion order modulation [2018-06-22 01:46:38,329 INFO ]: Interprodecural is true [2018-06-22 01:46:38,329 INFO ]: Hoare is false [2018-06-22 01:46:38,329 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:46:38,329 INFO ]: Backedges is TWOTRACK [2018-06-22 01:46:38,329 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:46:38,329 INFO ]: Difference is false [2018-06-22 01:46:38,329 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:46:38,329 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:46:38,353 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:46:38,372 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:46:38,372 INFO ]: Found error trace [2018-06-22 01:46:38,373 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:38,374 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:38,379 INFO ]: Analyzing trace with hash 1539992467, now seen corresponding path program 1 times [2018-06-22 01:46:38,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:38,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:38,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:38,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:38,565 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:46:38,567 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:38,567 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:46:38,569 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:38,586 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:38,586 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:38,589 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:46:38,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:38,804 INFO ]: Finished difference Result 19 states and 25 transitions. [2018-06-22 01:46:38,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:38,806 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:46:38,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:38,815 INFO ]: With dead ends: 19 [2018-06-22 01:46:38,815 INFO ]: Without dead ends: 19 [2018-06-22 01:46:38,817 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:38,835 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:46:38,862 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:46:38,863 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:46:38,864 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-22 01:46:38,865 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 7 [2018-06-22 01:46:38,865 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:38,865 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-22 01:46:38,865 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:38,866 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-22 01:46:38,866 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:46:38,867 INFO ]: Found error trace [2018-06-22 01:46:38,867 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:38,867 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:38,867 INFO ]: Analyzing trace with hash 536617630, now seen corresponding path program 1 times [2018-06-22 01:46:38,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:38,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:38,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:38,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:38,931 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:46:38,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:38,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:46:38,933 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:46:38,933 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:46:38,933 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:46:38,933 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-06-22 01:46:38,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:38,957 INFO ]: Finished difference Result 29 states and 42 transitions. [2018-06-22 01:46:38,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:46:38,957 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:46:38,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:38,960 INFO ]: With dead ends: 29 [2018-06-22 01:46:38,960 INFO ]: Without dead ends: 29 [2018-06-22 01:46:38,960 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:46:38,961 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:46:38,966 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 01:46:38,966 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:46:38,967 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-22 01:46:38,967 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2018-06-22 01:46:38,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:38,968 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-22 01:46:38,968 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:46:38,968 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-22 01:46:38,968 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:46:38,968 INFO ]: Found error trace [2018-06-22 01:46:38,968 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:38,968 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:38,969 INFO ]: Analyzing trace with hash 536647421, now seen corresponding path program 1 times [2018-06-22 01:46:38,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:38,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:38,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:38,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:38,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:39,019 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:46:39,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:39,020 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:46:39,020 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:46:39,020 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:46:39,020 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:46:39,020 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 3 states. [2018-06-22 01:46:39,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:39,057 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-22 01:46:39,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:46:39,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:46:39,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:39,059 INFO ]: With dead ends: 25 [2018-06-22 01:46:39,059 INFO ]: Without dead ends: 25 [2018-06-22 01:46:39,060 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:46:39,060 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:46:39,064 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 01:46:39,064 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:46:39,065 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 01:46:39,065 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 8 [2018-06-22 01:46:39,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:39,065 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 01:46:39,066 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:46:39,066 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 01:46:39,066 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:46:39,066 INFO ]: Found error trace [2018-06-22 01:46:39,066 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:39,067 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:39,067 INFO ]: Analyzing trace with hash -690643292, now seen corresponding path program 1 times [2018-06-22 01:46:39,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:39,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:39,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:39,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:39,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:39,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:39,482 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:46:39,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:39,483 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:39,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:39,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:39,539 INFO ]: Computing forward predicates... [2018-06-22 01:46:39,585 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:46:39,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:39,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:46:39,608 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:46:39,608 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:46:39,608 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:46:39,609 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 7 states. [2018-06-22 01:46:40,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:40,772 INFO ]: Finished difference Result 48 states and 80 transitions. [2018-06-22 01:46:40,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:46:40,773 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-22 01:46:40,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:40,774 INFO ]: With dead ends: 48 [2018-06-22 01:46:40,774 INFO ]: Without dead ends: 26 [2018-06-22 01:46:40,774 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:46:40,774 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:46:40,778 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 01:46:40,778 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:46:40,779 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-22 01:46:40,779 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2018-06-22 01:46:40,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:40,779 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-22 01:46:40,779 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:46:40,779 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-22 01:46:40,780 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:46:40,780 INFO ]: Found error trace [2018-06-22 01:46:40,780 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:40,780 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:40,780 INFO ]: Analyzing trace with hash 1052167043, now seen corresponding path program 1 times [2018-06-22 01:46:40,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:40,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:40,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:40,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:40,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:40,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:40,943 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:46:40,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:40,943 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:40,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:40,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:40,982 INFO ]: Computing forward predicates... [2018-06-22 01:46:41,204 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:46:41,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:41,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 01:46:41,226 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:46:41,226 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:46:41,226 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:46:41,226 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 13 states. [2018-06-22 01:46:41,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:41,586 INFO ]: Finished difference Result 36 states and 49 transitions. [2018-06-22 01:46:41,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:46:41,587 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:46:41,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:41,588 INFO ]: With dead ends: 36 [2018-06-22 01:46:41,588 INFO ]: Without dead ends: 36 [2018-06-22 01:46:41,589 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:46:41,589 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:46:41,594 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 01:46:41,594 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:46:41,595 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-06-22 01:46:41,596 INFO ]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2018-06-22 01:46:41,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:41,596 INFO ]: Abstraction has 28 states and 39 transitions. [2018-06-22 01:46:41,596 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:46:41,596 INFO ]: Start isEmpty. Operand 28 states and 39 transitions. [2018-06-22 01:46:41,597 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:46:41,597 INFO ]: Found error trace [2018-06-22 01:46:41,599 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:41,599 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:41,599 INFO ]: Analyzing trace with hash -1138639607, now seen corresponding path program 2 times [2018-06-22 01:46:41,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:41,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:41,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:41,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:41,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:41,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:41,723 INFO ]: Checked inductivity of 24 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:41,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:41,723 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:41,732 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:46:41,765 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:46:41,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:41,767 INFO ]: Computing forward predicates... [2018-06-22 01:46:41,932 INFO ]: Checked inductivity of 24 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:41,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:41,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:46:41,953 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:46:41,953 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:46:41,954 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:46:41,954 INFO ]: Start difference. First operand 28 states and 39 transitions. Second operand 16 states. [2018-06-22 01:46:43,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:43,301 INFO ]: Finished difference Result 77 states and 147 transitions. [2018-06-22 01:46:43,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:46:43,301 INFO ]: Start accepts. Automaton has 16 states. Word has length 24 [2018-06-22 01:46:43,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:43,305 INFO ]: With dead ends: 77 [2018-06-22 01:46:43,305 INFO ]: Without dead ends: 77 [2018-06-22 01:46:43,305 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:46:43,305 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 01:46:43,322 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 51. [2018-06-22 01:46:43,322 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:46:43,324 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2018-06-22 01:46:43,324 INFO ]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 24 [2018-06-22 01:46:43,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:43,324 INFO ]: Abstraction has 51 states and 84 transitions. [2018-06-22 01:46:43,324 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:46:43,324 INFO ]: Start isEmpty. Operand 51 states and 84 transitions. [2018-06-22 01:46:43,326 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:46:43,326 INFO ]: Found error trace [2018-06-22 01:46:43,326 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:43,326 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:43,326 INFO ]: Analyzing trace with hash -1138609816, now seen corresponding path program 3 times [2018-06-22 01:46:43,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:43,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:43,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:43,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:43,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:43,596 INFO ]: Checked inductivity of 24 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:46:43,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:43,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:43,610 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:46:43,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:46:43,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:43,682 INFO ]: Computing forward predicates... [2018-06-22 01:46:44,087 INFO ]: Checked inductivity of 24 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:46:44,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:44,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-06-22 01:46:44,113 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:46:44,113 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:46:44,113 INFO ]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:46:44,115 INFO ]: Start difference. First operand 51 states and 84 transitions. Second operand 22 states. [2018-06-22 01:46:44,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:44,767 INFO ]: Finished difference Result 72 states and 111 transitions. [2018-06-22 01:46:44,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:46:44,768 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-22 01:46:44,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:44,770 INFO ]: With dead ends: 72 [2018-06-22 01:46:44,770 INFO ]: Without dead ends: 68 [2018-06-22 01:46:44,771 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:46:44,771 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:46:44,780 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 55. [2018-06-22 01:46:44,780 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:46:44,782 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2018-06-22 01:46:44,782 INFO ]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 24 [2018-06-22 01:46:44,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:44,783 INFO ]: Abstraction has 55 states and 92 transitions. [2018-06-22 01:46:44,783 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:46:44,783 INFO ]: Start isEmpty. Operand 55 states and 92 transitions. [2018-06-22 01:46:44,787 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:46:44,787 INFO ]: Found error trace [2018-06-22 01:46:44,787 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:44,787 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:44,787 INFO ]: Analyzing trace with hash 1443400909, now seen corresponding path program 4 times [2018-06-22 01:46:44,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:44,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:44,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:44,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:44,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:44,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:44,922 INFO ]: Checked inductivity of 51 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:46:44,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:44,922 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:44,929 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:46:44,978 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:46:44,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:44,981 INFO ]: Computing forward predicates... [2018-06-22 01:46:45,365 INFO ]: Checked inductivity of 51 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:46:45,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:45,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 01:46:45,393 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:46:45,394 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:46:45,394 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:46:45,394 INFO ]: Start difference. First operand 55 states and 92 transitions. Second operand 12 states. [2018-06-22 01:46:45,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:45,913 INFO ]: Finished difference Result 88 states and 164 transitions. [2018-06-22 01:46:45,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:46:45,913 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-22 01:46:45,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:45,917 INFO ]: With dead ends: 88 [2018-06-22 01:46:45,917 INFO ]: Without dead ends: 88 [2018-06-22 01:46:45,917 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:46:45,917 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:46:45,929 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-06-22 01:46:45,930 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:46:45,935 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 116 transitions. [2018-06-22 01:46:45,935 INFO ]: Start accepts. Automaton has 66 states and 116 transitions. Word has length 32 [2018-06-22 01:46:45,935 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:45,935 INFO ]: Abstraction has 66 states and 116 transitions. [2018-06-22 01:46:45,935 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:46:45,935 INFO ]: Start isEmpty. Operand 66 states and 116 transitions. [2018-06-22 01:46:45,939 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:46:45,939 INFO ]: Found error trace [2018-06-22 01:46:45,939 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:45,939 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:45,939 INFO ]: Analyzing trace with hash 426777293, now seen corresponding path program 5 times [2018-06-22 01:46:45,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:45,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:45,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:45,940 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:45,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:45,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,059 INFO ]: Checked inductivity of 51 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 01:46:46,059 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:46,059 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:46,075 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:46:46,111 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:46:46,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,113 INFO ]: Computing forward predicates... [2018-06-22 01:46:46,143 INFO ]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 01:46:46,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:46,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-06-22 01:46:46,163 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:46:46,163 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:46:46,163 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:46:46,163 INFO ]: Start difference. First operand 66 states and 116 transitions. Second operand 12 states. [2018-06-22 01:46:46,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:46,535 INFO ]: Finished difference Result 142 states and 250 transitions. [2018-06-22 01:46:46,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:46:46,536 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-22 01:46:46,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:46,537 INFO ]: With dead ends: 142 [2018-06-22 01:46:46,537 INFO ]: Without dead ends: 77 [2018-06-22 01:46:46,538 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:46:46,538 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 01:46:46,548 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-06-22 01:46:46,548 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:46:46,549 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-06-22 01:46:46,549 INFO ]: Start accepts. Automaton has 67 states and 105 transitions. Word has length 32 [2018-06-22 01:46:46,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:46,550 INFO ]: Abstraction has 67 states and 105 transitions. [2018-06-22 01:46:46,550 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:46:46,550 INFO ]: Start isEmpty. Operand 67 states and 105 transitions. [2018-06-22 01:46:46,552 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:46:46,552 INFO ]: Found error trace [2018-06-22 01:46:46,552 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1] [2018-06-22 01:46:46,552 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:46,552 INFO ]: Analyzing trace with hash 798486867, now seen corresponding path program 6 times [2018-06-22 01:46:46,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:46,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:46,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:46,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:46,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:46,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,939 INFO ]: Checked inductivity of 88 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 01:46:46,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:46,939 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:46,946 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:46:46,995 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:46:46,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,999 INFO ]: Computing forward predicates... [2018-06-22 01:46:47,667 INFO ]: Checked inductivity of 88 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:46:47,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:47,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2018-06-22 01:46:47,687 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:46:47,687 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:46:47,687 INFO ]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:46:47,688 INFO ]: Start difference. First operand 67 states and 105 transitions. Second operand 33 states. [2018-06-22 01:46:49,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:49,177 INFO ]: Finished difference Result 96 states and 148 transitions. [2018-06-22 01:46:49,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:46:49,177 INFO ]: Start accepts. Automaton has 33 states. Word has length 40 [2018-06-22 01:46:49,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:49,179 INFO ]: With dead ends: 96 [2018-06-22 01:46:49,179 INFO ]: Without dead ends: 88 [2018-06-22 01:46:49,179 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=309, Invalid=2043, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:46:49,180 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:46:49,187 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 73. [2018-06-22 01:46:49,187 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 01:46:49,189 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 117 transitions. [2018-06-22 01:46:49,189 INFO ]: Start accepts. Automaton has 73 states and 117 transitions. Word has length 40 [2018-06-22 01:46:49,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:49,189 INFO ]: Abstraction has 73 states and 117 transitions. [2018-06-22 01:46:49,189 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:46:49,189 INFO ]: Start isEmpty. Operand 73 states and 117 transitions. [2018-06-22 01:46:49,191 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:46:49,191 INFO ]: Found error trace [2018-06-22 01:46:49,191 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1] [2018-06-22 01:46:49,191 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:49,191 INFO ]: Analyzing trace with hash -55375682, now seen corresponding path program 7 times [2018-06-22 01:46:49,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:49,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:49,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:49,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:49,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:49,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:49,484 INFO ]: Checked inductivity of 192 backedges. 88 proven. 27 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 01:46:49,484 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:49,484 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:49,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:49,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:49,550 INFO ]: Computing forward predicates... [2018-06-22 01:46:49,627 INFO ]: Checked inductivity of 192 backedges. 68 proven. 70 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 01:46:49,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:49,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-06-22 01:46:49,688 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:46:49,688 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:46:49,688 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:46:49,689 INFO ]: Start difference. First operand 73 states and 117 transitions. Second operand 18 states. [2018-06-22 01:46:50,769 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:46:52,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:52,511 INFO ]: Finished difference Result 198 states and 391 transitions. [2018-06-22 01:46:52,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 01:46:52,511 INFO ]: Start accepts. Automaton has 18 states. Word has length 56 [2018-06-22 01:46:52,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:52,515 INFO ]: With dead ends: 198 [2018-06-22 01:46:52,515 INFO ]: Without dead ends: 198 [2018-06-22 01:46:52,517 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=892, Invalid=4220, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:46:52,517 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-22 01:46:52,546 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 106. [2018-06-22 01:46:52,546 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 01:46:52,548 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 189 transitions. [2018-06-22 01:46:52,549 INFO ]: Start accepts. Automaton has 106 states and 189 transitions. Word has length 56 [2018-06-22 01:46:52,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:52,550 INFO ]: Abstraction has 106 states and 189 transitions. [2018-06-22 01:46:52,550 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:46:52,550 INFO ]: Start isEmpty. Operand 106 states and 189 transitions. [2018-06-22 01:46:52,552 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-22 01:46:52,552 INFO ]: Found error trace [2018-06-22 01:46:52,552 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1] [2018-06-22 01:46:52,552 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:52,553 INFO ]: Analyzing trace with hash 945226659, now seen corresponding path program 8 times [2018-06-22 01:46:52,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:52,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:52,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:52,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:52,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:52,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:53,440 INFO ]: Checked inductivity of 259 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 01:46:53,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:53,516 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:53,524 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:46:53,590 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:46:53,590 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:53,613 INFO ]: Computing forward predicates... [2018-06-22 01:46:56,111 INFO ]: Checked inductivity of 259 backedges. 16 proven. 160 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 01:46:56,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:56,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 46 [2018-06-22 01:46:56,146 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:46:56,146 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:46:56,147 INFO ]: CoverageRelationStatistics Valid=118, Invalid=1952, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:46:56,147 INFO ]: Start difference. First operand 106 states and 189 transitions. Second operand 46 states. [2018-06-22 01:46:58,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:58,728 INFO ]: Finished difference Result 164 states and 305 transitions. [2018-06-22 01:46:58,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:46:58,728 INFO ]: Start accepts. Automaton has 46 states. Word has length 64 [2018-06-22 01:46:58,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:58,731 INFO ]: With dead ends: 164 [2018-06-22 01:46:58,731 INFO ]: Without dead ends: 152 [2018-06-22 01:46:58,733 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=414, Invalid=3876, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:46:58,733 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 01:46:58,748 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 122. [2018-06-22 01:46:58,748 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 01:46:58,758 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 242 transitions. [2018-06-22 01:46:58,758 INFO ]: Start accepts. Automaton has 122 states and 242 transitions. Word has length 64 [2018-06-22 01:46:58,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:58,759 INFO ]: Abstraction has 122 states and 242 transitions. [2018-06-22 01:46:58,759 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:46:58,759 INFO ]: Start isEmpty. Operand 122 states and 242 transitions. [2018-06-22 01:46:58,761 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-22 01:46:58,761 INFO ]: Found error trace [2018-06-22 01:46:58,761 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1] [2018-06-22 01:46:58,761 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:58,761 INFO ]: Analyzing trace with hash -485939960, now seen corresponding path program 9 times [2018-06-22 01:46:58,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:58,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:58,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:58,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:58,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:58,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:59,090 INFO ]: Checked inductivity of 336 backedges. 102 proven. 64 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-06-22 01:46:59,090 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:59,090 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:59,098 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:46:59,237 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:46:59,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:59,242 INFO ]: Computing forward predicates... [2018-06-22 01:46:59,551 INFO ]: Checked inductivity of 336 backedges. 151 proven. 86 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-22 01:46:59,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:59,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 26 [2018-06-22 01:46:59,570 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:46:59,570 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:46:59,571 INFO ]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:46:59,571 INFO ]: Start difference. First operand 122 states and 242 transitions. Second operand 26 states. [2018-06-22 01:47:00,856 WARN ]: Spent 276.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-22 01:47:01,517 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-22 01:47:06,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:47:06,454 INFO ]: Finished difference Result 444 states and 1095 transitions. [2018-06-22 01:47:06,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-06-22 01:47:06,455 INFO ]: Start accepts. Automaton has 26 states. Word has length 72 [2018-06-22 01:47:06,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:47:06,465 INFO ]: With dead ends: 444 [2018-06-22 01:47:06,465 INFO ]: Without dead ends: 436 [2018-06-22 01:47:06,471 INFO ]: 0 DeclaredPredicates, 199 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7069 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2252, Invalid=18054, Unknown=0, NotChecked=0, Total=20306 [2018-06-22 01:47:06,471 INFO ]: Start minimizeSevpa. Operand 436 states. [2018-06-22 01:47:06,519 INFO ]: Finished minimizeSevpa. Reduced states from 436 to 270. [2018-06-22 01:47:06,554 INFO ]: Start removeUnreachable. Operand 270 states. [2018-06-22 01:47:06,561 INFO ]: Finished removeUnreachable. Reduced from 270 states to 270 states and 600 transitions. [2018-06-22 01:47:06,561 INFO ]: Start accepts. Automaton has 270 states and 600 transitions. Word has length 72 [2018-06-22 01:47:06,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:47:06,562 INFO ]: Abstraction has 270 states and 600 transitions. [2018-06-22 01:47:06,562 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:47:06,562 INFO ]: Start isEmpty. Operand 270 states and 600 transitions. [2018-06-22 01:47:06,576 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-22 01:47:06,576 INFO ]: Found error trace [2018-06-22 01:47:06,576 INFO ]: trace histogram [13, 13, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1] [2018-06-22 01:47:06,576 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:47:06,576 INFO ]: Analyzing trace with hash 1366190046, now seen corresponding path program 10 times [2018-06-22 01:47:06,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:47:06,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:47:06,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:06,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:47:06,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:06,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:08,388 INFO ]: Checked inductivity of 744 backedges. 24 proven. 510 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-06-22 01:47:08,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:47:08,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:47:08,396 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:47:08,469 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:47:08,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:08,477 INFO ]: Computing forward predicates... [2018-06-22 01:47:11,883 INFO ]: Checked inductivity of 744 backedges. 32 proven. 462 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-22 01:47:11,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:47:11,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 30] total 63 [2018-06-22 01:47:11,906 INFO ]: Interpolant automaton has 63 states [2018-06-22 01:47:11,906 INFO ]: Constructing interpolant automaton starting with 63 interpolants. [2018-06-22 01:47:11,907 INFO ]: CoverageRelationStatistics Valid=167, Invalid=3739, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:47:11,907 INFO ]: Start difference. First operand 270 states and 600 transitions. Second operand 63 states. [2018-06-22 01:47:12,874 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 26 [2018-06-22 01:47:15,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:47:15,736 INFO ]: Finished difference Result 400 states and 871 transitions. [2018-06-22 01:47:15,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:47:15,736 INFO ]: Start accepts. Automaton has 63 states. Word has length 104 [2018-06-22 01:47:15,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:47:15,743 INFO ]: With dead ends: 400 [2018-06-22 01:47:15,743 INFO ]: Without dead ends: 376 [2018-06-22 01:47:15,745 INFO ]: 0 DeclaredPredicates, 193 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=634, Invalid=7198, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 01:47:15,746 INFO ]: Start minimizeSevpa. Operand 376 states. [2018-06-22 01:47:15,780 INFO ]: Finished minimizeSevpa. Reduced states from 376 to 295. [2018-06-22 01:47:15,780 INFO ]: Start removeUnreachable. Operand 295 states. [2018-06-22 01:47:15,785 INFO ]: Finished removeUnreachable. Reduced from 295 states to 295 states and 712 transitions. [2018-06-22 01:47:15,785 INFO ]: Start accepts. Automaton has 295 states and 712 transitions. Word has length 104 [2018-06-22 01:47:15,786 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:47:15,786 INFO ]: Abstraction has 295 states and 712 transitions. [2018-06-22 01:47:15,786 INFO ]: Interpolant automaton has 63 states. [2018-06-22 01:47:15,786 INFO ]: Start isEmpty. Operand 295 states and 712 transitions. [2018-06-22 01:47:15,796 INFO ]: Finished isEmpty. Found accepting run of length 121 [2018-06-22 01:47:15,796 INFO ]: Found error trace [2018-06-22 01:47:15,797 INFO ]: trace histogram [15, 15, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1] [2018-06-22 01:47:15,797 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:47:15,797 INFO ]: Analyzing trace with hash 1564072009, now seen corresponding path program 11 times [2018-06-22 01:47:15,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:47:15,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:47:15,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:15,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:47:15,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:15,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:16,014 INFO ]: Checked inductivity of 1008 backedges. 297 proven. 188 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-06-22 01:47:16,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:47:16,014 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:47:16,020 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:47:16,084 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:47:16,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:16,088 INFO ]: Computing forward predicates... [2018-06-22 01:47:16,113 INFO ]: Checked inductivity of 1008 backedges. 595 proven. 70 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-06-22 01:47:16,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:47:16,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 01:47:16,152 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:47:16,152 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:47:16,152 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:47:16,153 INFO ]: Start difference. First operand 295 states and 712 transitions. Second operand 16 states. [2018-06-22 01:47:17,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:47:17,055 INFO ]: Finished difference Result 736 states and 2063 transitions. [2018-06-22 01:47:17,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:47:17,058 INFO ]: Start accepts. Automaton has 16 states. Word has length 120 [2018-06-22 01:47:17,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:47:17,076 INFO ]: With dead ends: 736 [2018-06-22 01:47:17,076 INFO ]: Without dead ends: 719 [2018-06-22 01:47:17,077 INFO ]: 0 DeclaredPredicates, 172 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=2258, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:47:17,078 INFO ]: Start minimizeSevpa. Operand 719 states. [2018-06-22 01:47:17,140 INFO ]: Finished minimizeSevpa. Reduced states from 719 to 560. [2018-06-22 01:47:17,140 INFO ]: Start removeUnreachable. Operand 560 states. [2018-06-22 01:47:17,152 INFO ]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1516 transitions. [2018-06-22 01:47:17,152 INFO ]: Start accepts. Automaton has 560 states and 1516 transitions. Word has length 120 [2018-06-22 01:47:17,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:47:17,152 INFO ]: Abstraction has 560 states and 1516 transitions. [2018-06-22 01:47:17,152 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:47:17,152 INFO ]: Start isEmpty. Operand 560 states and 1516 transitions. [2018-06-22 01:47:17,163 INFO ]: Finished isEmpty. Found accepting run of length 145 [2018-06-22 01:47:17,163 INFO ]: Found error trace [2018-06-22 01:47:17,164 INFO ]: trace histogram [18, 18, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1] [2018-06-22 01:47:17,164 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:47:17,164 INFO ]: Analyzing trace with hash 1396937113, now seen corresponding path program 12 times [2018-06-22 01:47:17,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:47:17,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:47:17,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:17,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:47:17,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:17,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:17,634 INFO ]: Checked inductivity of 1479 backedges. 332 proven. 268 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-06-22 01:47:17,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:47:17,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:47:17,639 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:47:17,742 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 01:47:17,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:17,749 INFO ]: Computing forward predicates... [2018-06-22 01:47:18,064 INFO ]: Checked inductivity of 1479 backedges. 407 proven. 313 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-06-22 01:47:18,083 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:47:18,084 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-06-22 01:47:18,084 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:47:18,084 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:47:18,084 INFO ]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:47:18,084 INFO ]: Start difference. First operand 560 states and 1516 transitions. Second operand 30 states. [2018-06-22 01:47:23,813 WARN ]: Spent 296.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-22 01:47:25,290 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:47:30,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:47:30,428 INFO ]: Finished difference Result 4083 states and 10547 transitions. [2018-06-22 01:47:30,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-06-22 01:47:30,428 INFO ]: Start accepts. Automaton has 30 states. Word has length 144 [2018-06-22 01:47:30,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:47:30,539 INFO ]: With dead ends: 4083 [2018-06-22 01:47:30,539 INFO ]: Without dead ends: 2606 [2018-06-22 01:47:30,552 INFO ]: 0 DeclaredPredicates, 445 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43352 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11761, Invalid=87779, Unknown=0, NotChecked=0, Total=99540 [2018-06-22 01:47:30,554 INFO ]: Start minimizeSevpa. Operand 2606 states. [2018-06-22 01:47:30,814 INFO ]: Finished minimizeSevpa. Reduced states from 2606 to 1666. [2018-06-22 01:47:30,814 INFO ]: Start removeUnreachable. Operand 1666 states. [2018-06-22 01:47:30,863 INFO ]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 5197 transitions. [2018-06-22 01:47:30,863 INFO ]: Start accepts. Automaton has 1666 states and 5197 transitions. Word has length 144 [2018-06-22 01:47:30,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:47:30,864 INFO ]: Abstraction has 1666 states and 5197 transitions. [2018-06-22 01:47:30,864 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:47:30,864 INFO ]: Start isEmpty. Operand 1666 states and 5197 transitions. [2018-06-22 01:47:30,880 INFO ]: Finished isEmpty. Found accepting run of length 169 [2018-06-22 01:47:30,880 INFO ]: Found error trace [2018-06-22 01:47:30,880 INFO ]: trace histogram [21, 21, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1] [2018-06-22 01:47:30,881 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:47:30,881 INFO ]: Analyzing trace with hash 1962859241, now seen corresponding path program 13 times [2018-06-22 01:47:30,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:47:30,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:47:30,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:30,881 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:47:30,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:47:31,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:32,644 INFO ]: Checked inductivity of 2040 backedges. 40 proven. 1409 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-06-22 01:47:32,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:47:32,644 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:47:32,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:47:32,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:47:32,815 INFO ]: Computing forward predicates... [2018-06-22 01:47:38,945 INFO ]: Checked inductivity of 2040 backedges. 70 proven. 1269 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2018-06-22 01:47:38,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:47:38,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 39] total 82 [2018-06-22 01:47:38,967 INFO ]: Interpolant automaton has 82 states [2018-06-22 01:47:38,967 INFO ]: Constructing interpolant automaton starting with 82 interpolants. [2018-06-22 01:47:38,967 INFO ]: CoverageRelationStatistics Valid=215, Invalid=6427, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 01:47:38,967 INFO ]: Start difference. First operand 1666 states and 5197 transitions. Second operand 82 states. Received shutdown request... [2018-06-22 01:47:39,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:47:39,287 WARN ]: Verification canceled [2018-06-22 01:47:39,291 WARN ]: Timeout [2018-06-22 01:47:39,292 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:47:39 BoogieIcfgContainer [2018-06-22 01:47:39,292 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:47:39,292 INFO ]: Toolchain (without parser) took 61558.78 ms. Allocated memory was 314.6 MB in the beginning and 616.0 MB in the end (delta: 301.5 MB). Free memory was 271.1 MB in the beginning and 347.5 MB in the end (delta: -76.4 MB). Peak memory consumption was 225.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:39,293 INFO ]: SmtParser took 0.11 ms. Allocated memory is still 314.6 MB. Free memory is still 280.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:47:39,293 INFO ]: ChcToBoogie took 69.51 ms. Allocated memory is still 314.6 MB. Free memory was 270.1 MB in the beginning and 268.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:39,294 INFO ]: Boogie Preprocessor took 48.53 ms. Allocated memory is still 314.6 MB. Free memory was 268.1 MB in the beginning and 267.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:39,294 INFO ]: RCFGBuilder took 360.40 ms. Allocated memory is still 314.6 MB. Free memory was 267.0 MB in the beginning and 258.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:39,295 INFO ]: TraceAbstraction took 61066.72 ms. Allocated memory was 314.6 MB in the beginning and 616.0 MB in the end (delta: 301.5 MB). Free memory was 258.0 MB in the beginning and 347.5 MB in the end (delta: -89.5 MB). Peak memory consumption was 211.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:39,297 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.11 ms. Allocated memory is still 314.6 MB. Free memory is still 280.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.51 ms. Allocated memory is still 314.6 MB. Free memory was 270.1 MB in the beginning and 268.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.53 ms. Allocated memory is still 314.6 MB. Free memory was 268.1 MB in the beginning and 267.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 360.40 ms. Allocated memory is still 314.6 MB. Free memory was 267.0 MB in the beginning and 258.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61066.72 ms. Allocated memory was 314.6 MB in the beginning and 616.0 MB in the end (delta: 301.5 MB). Free memory was 258.0 MB in the beginning and 347.5 MB in the end (delta: -89.5 MB). Peak memory consumption was 211.9 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 (1666states) and interpolant automaton (currently 5 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (6 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 60.9s OverallTime, 17 OverallIterations, 21 TraceHistogramMax, 36.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 274 SDtfs, 928 SDslu, 2162 SDs, 0 SdLazy, 13095 SolverSat, 3474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1909 GetRequests, 877 SyntacticMatches, 14 SemanticMatches, 1018 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56060 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1666occurred in iteration=16, 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.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1578 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1744 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1816 ConstructedInterpolants, 44 QuantifiedInterpolants, 811787 SizeOfPredicates, 313 NumberOfNonLiveVariables, 5111 ConjunctsInSsa, 658 ConjunctsInUnsatCore, 31 InterpolantComputations, 3 PerfectInterpolantSequences, 7353/12620 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/gib2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-47-39-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/gib2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-47-39-418.csv Completed graceful shutdown