java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:30:42,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:30:42,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:30:42,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:30:42,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:30:42,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:30:42,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:30:42,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:30:42,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:30:42,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:30:42,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:30:42,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:30:42,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:30:42,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:30:42,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:30:42,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:30:42,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:30:42,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:30:42,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:30:42,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:30:42,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:30:42,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:30:42,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:30:42,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:30:42,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:30:42,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:30:42,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:30:42,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:30:42,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:30:42,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:30:42,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:30:42,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:30:42,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:30:42,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:30:42,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:30:42,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:30:42,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:30:42,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:30:42,321 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:30:42,322 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:30:42,323 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:30:42,323 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:30:42,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:30:42,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:30:42,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:30:42,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:30:42,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:30:42,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:30:42,325 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:30:42,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:30:42,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:30:42,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:30:42,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:30:42,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:30:42,326 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:30:42,327 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:30:42,327 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:30:42,366 INFO ]: Repository-Root is: /tmp [2018-06-22 11:30:42,381 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:30:42,386 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:30:42,388 INFO ]: Initializing SmtParser... [2018-06-22 11:30:42,388 INFO ]: SmtParser initialized [2018-06-22 11:30:42,389 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 [2018-06-22 11:30:42,390 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:30:42,477 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 unknown [2018-06-22 11:30:42,655 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 [2018-06-22 11:30:42,660 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:30:42,666 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:30:42,667 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:30:42,667 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:30:42,667 INFO ]: ChcToBoogie initialized [2018-06-22 11:30:42,670 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,712 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42 Unit [2018-06-22 11:30:42,712 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:30:42,713 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:30:42,713 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:30:42,713 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:30:42,734 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,735 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,745 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,745 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,749 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,752 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,753 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... [2018-06-22 11:30:42,757 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:30:42,758 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:30:42,758 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:30:42,758 INFO ]: RCFGBuilder initialized [2018-06-22 11:30:42,759 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:30:42,776 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:30:42,776 INFO ]: Found specification of procedure False [2018-06-22 11:30:42,776 INFO ]: Found implementation of procedure False [2018-06-22 11:30:42,776 INFO ]: Specification and implementation of procedure zipDLRunknownCLN4 given in one single declaration [2018-06-22 11:30:42,776 INFO ]: Found specification of procedure zipDLRunknownCLN4 [2018-06-22 11:30:42,776 INFO ]: Found implementation of procedure zipDLRunknownCLN4 [2018-06-22 11:30:42,777 INFO ]: Specification and implementation of procedure zipDLRunknownCLN5 given in one single declaration [2018-06-22 11:30:42,777 INFO ]: Found specification of procedure zipDLRunknownCLN5 [2018-06-22 11:30:42,777 INFO ]: Found implementation of procedure zipDLRunknownCLN5 [2018-06-22 11:30:42,777 INFO ]: Specification and implementation of procedure mapDLRunknownCLN2 given in one single declaration [2018-06-22 11:30:42,777 INFO ]: Found specification of procedure mapDLRunknownCLN2 [2018-06-22 11:30:42,777 INFO ]: Found implementation of procedure mapDLRunknownCLN2 [2018-06-22 11:30:42,777 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:30:42,777 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:30:42,777 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:30:43,205 INFO ]: Using library mode [2018-06-22 11:30:43,205 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:30:43 BoogieIcfgContainer [2018-06-22 11:30:43,205 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:30:43,207 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:30:43,207 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:30:43,210 INFO ]: TraceAbstraction initialized [2018-06-22 11:30:43,210 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:30:42" (1/3) ... [2018-06-22 11:30:43,211 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d22ff7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:30:43, skipping insertion in model container [2018-06-22 11:30:43,211 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:30:42" (2/3) ... [2018-06-22 11:30:43,212 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d22ff7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:30:43, skipping insertion in model container [2018-06-22 11:30:43,212 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:30:43" (3/3) ... [2018-06-22 11:30:43,213 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:30:43,223 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:30:43,231 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:30:43,264 INFO ]: Using default assertion order modulation [2018-06-22 11:30:43,265 INFO ]: Interprodecural is true [2018-06-22 11:30:43,265 INFO ]: Hoare is false [2018-06-22 11:30:43,265 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:30:43,265 INFO ]: Backedges is TWOTRACK [2018-06-22 11:30:43,265 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:30:43,265 INFO ]: Difference is false [2018-06-22 11:30:43,265 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:30:43,265 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:30:43,278 INFO ]: Start isEmpty. Operand 26 states. [2018-06-22 11:30:43,296 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:30:43,296 INFO ]: Found error trace [2018-06-22 11:30:43,297 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:30:43,297 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:43,302 INFO ]: Analyzing trace with hash 87389567, now seen corresponding path program 1 times [2018-06-22 11:30:43,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:43,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:43,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:43,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:43,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:43,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:43,375 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:43,377 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:43,377 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:30:43,379 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:30:43,390 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:30:43,390 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:30:43,392 INFO ]: Start difference. First operand 26 states. Second operand 2 states. [2018-06-22 11:30:43,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:43,415 INFO ]: Finished difference Result 24 states and 34 transitions. [2018-06-22 11:30:43,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:30:43,416 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:30:43,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:43,430 INFO ]: With dead ends: 24 [2018-06-22 11:30:43,430 INFO ]: Without dead ends: 24 [2018-06-22 11:30:43,433 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:30:43,447 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:30:43,471 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:30:43,473 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:30:43,476 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:30:43,477 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 5 [2018-06-22 11:30:43,478 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:43,478 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:30:43,478 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:30:43,478 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:30:43,479 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:30:43,479 INFO ]: Found error trace [2018-06-22 11:30:43,479 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:43,480 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:43,481 INFO ]: Analyzing trace with hash -772527473, now seen corresponding path program 1 times [2018-06-22 11:30:43,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:43,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:43,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:43,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:43,728 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:30:43,748 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:43,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:43,748 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:30:43,750 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:30:43,750 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:30:43,750 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:43,750 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 4 states. [2018-06-22 11:30:44,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:44,012 INFO ]: Finished difference Result 28 states and 40 transitions. [2018-06-22 11:30:44,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:30:44,012 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:30:44,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:44,013 INFO ]: With dead ends: 28 [2018-06-22 11:30:44,013 INFO ]: Without dead ends: 28 [2018-06-22 11:30:44,014 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:30:44,014 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:30:44,029 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:30:44,029 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:30:44,030 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-06-22 11:30:44,030 INFO ]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 9 [2018-06-22 11:30:44,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:44,030 INFO ]: Abstraction has 26 states and 38 transitions. [2018-06-22 11:30:44,030 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:30:44,030 INFO ]: Start isEmpty. Operand 26 states and 38 transitions. [2018-06-22 11:30:44,031 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:30:44,031 INFO ]: Found error trace [2018-06-22 11:30:44,031 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:44,031 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:44,032 INFO ]: Analyzing trace with hash 570692083, now seen corresponding path program 1 times [2018-06-22 11:30:44,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:44,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:44,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:44,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:44,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:44,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:44,425 WARN ]: Spent 312.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:30:44,478 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:30:44,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:44,478 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:30:44,479 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:30:44,479 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:30:44,479 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:44,479 INFO ]: Start difference. First operand 26 states and 38 transitions. Second operand 5 states. [2018-06-22 11:30:44,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:44,662 INFO ]: Finished difference Result 26 states and 36 transitions. [2018-06-22 11:30:44,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:30:44,663 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:30:44,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:44,664 INFO ]: With dead ends: 26 [2018-06-22 11:30:44,664 INFO ]: Without dead ends: 24 [2018-06-22 11:30:44,664 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:30:44,664 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:30:44,670 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:30:44,671 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:30:44,671 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-22 11:30:44,672 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-06-22 11:30:44,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:44,672 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-22 11:30:44,672 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:30:44,672 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-22 11:30:44,674 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:30:44,674 INFO ]: Found error trace [2018-06-22 11:30:44,674 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:44,674 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:44,674 INFO ]: Analyzing trace with hash -22733069, now seen corresponding path program 1 times [2018-06-22 11:30:44,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:44,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:44,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:44,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:44,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:44,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:44,958 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:30:44,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:44,958 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:30:44,959 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:30:44,959 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:30:44,959 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:30:44,959 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 6 states. [2018-06-22 11:30:45,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:45,056 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 11:30:45,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:30:45,057 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:30:45,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:45,059 INFO ]: With dead ends: 29 [2018-06-22 11:30:45,059 INFO ]: Without dead ends: 29 [2018-06-22 11:30:45,060 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:30:45,060 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:30:45,067 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:30:45,067 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:30:45,068 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-22 11:30:45,068 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2018-06-22 11:30:45,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:45,068 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-22 11:30:45,068 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:30:45,069 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-22 11:30:45,070 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:30:45,070 INFO ]: Found error trace [2018-06-22 11:30:45,070 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:45,070 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:45,070 INFO ]: Analyzing trace with hash 108012663, now seen corresponding path program 1 times [2018-06-22 11:30:45,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:45,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:45,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:45,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:45,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:45,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:45,132 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:30:45,133 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:30:45,133 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:30:45,133 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:30:45,133 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:30:45,133 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:45,133 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2018-06-22 11:30:45,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:45,164 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-22 11:30:45,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:30:45,177 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:30:45,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:45,178 INFO ]: With dead ends: 29 [2018-06-22 11:30:45,178 INFO ]: Without dead ends: 29 [2018-06-22 11:30:45,178 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:30:45,179 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:30:45,181 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-06-22 11:30:45,181 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:30:45,188 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-06-22 11:30:45,188 INFO ]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 21 [2018-06-22 11:30:45,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:45,188 INFO ]: Abstraction has 24 states and 30 transitions. [2018-06-22 11:30:45,188 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:30:45,188 INFO ]: Start isEmpty. Operand 24 states and 30 transitions. [2018-06-22 11:30:45,189 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:30:45,189 INFO ]: Found error trace [2018-06-22 11:30:45,189 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:45,190 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:45,190 INFO ]: Analyzing trace with hash 1011124023, now seen corresponding path program 1 times [2018-06-22 11:30:45,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:45,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:45,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:45,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:45,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:45,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:45,333 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:30:45,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:45,333 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:45,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:45,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:45,382 INFO ]: Computing forward predicates... [2018-06-22 11:30:45,738 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:30:45,759 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:30:45,759 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-06-22 11:30:45,759 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:30:45,759 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:30:45,759 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:30:45,759 INFO ]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2018-06-22 11:30:45,982 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-06-22 11:30:46,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:46,083 INFO ]: Finished difference Result 29 states and 39 transitions. [2018-06-22 11:30:46,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:30:46,083 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:30:46,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:46,084 INFO ]: With dead ends: 29 [2018-06-22 11:30:46,084 INFO ]: Without dead ends: 26 [2018-06-22 11:30:46,084 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:30:46,084 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:30:46,088 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:30:46,088 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:30:46,088 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-06-22 11:30:46,088 INFO ]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2018-06-22 11:30:46,089 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:46,089 INFO ]: Abstraction has 26 states and 32 transitions. [2018-06-22 11:30:46,089 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:30:46,089 INFO ]: Start isEmpty. Operand 26 states and 32 transitions. [2018-06-22 11:30:46,089 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:30:46,089 INFO ]: Found error trace [2018-06-22 11:30:46,090 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:46,090 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:46,090 INFO ]: Analyzing trace with hash 310626491, now seen corresponding path program 1 times [2018-06-22 11:30:46,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:46,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:46,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:46,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:46,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:46,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:46,516 WARN ]: Spent 342.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:30:46,612 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:30:46,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:46,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:46,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:46,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:46,662 INFO ]: Computing forward predicates... [2018-06-22 11:30:46,865 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:30:46,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:46,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 11:30:46,885 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:30:46,885 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:30:46,886 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:30:46,886 INFO ]: Start difference. First operand 26 states and 32 transitions. Second operand 16 states. [2018-06-22 11:30:47,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:47,205 INFO ]: Finished difference Result 34 states and 44 transitions. [2018-06-22 11:30:47,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:30:47,205 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:30:47,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:47,206 INFO ]: With dead ends: 34 [2018-06-22 11:30:47,206 INFO ]: Without dead ends: 34 [2018-06-22 11:30:47,207 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:47,207 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:30:47,213 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:30:47,213 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:30:47,214 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-06-22 11:30:47,214 INFO ]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 29 [2018-06-22 11:30:47,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:47,214 INFO ]: Abstraction has 32 states and 42 transitions. [2018-06-22 11:30:47,214 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:30:47,214 INFO ]: Start isEmpty. Operand 32 states and 42 transitions. [2018-06-22 11:30:47,216 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:30:47,216 INFO ]: Found error trace [2018-06-22 11:30:47,216 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:47,216 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:47,216 INFO ]: Analyzing trace with hash 1735795647, now seen corresponding path program 2 times [2018-06-22 11:30:47,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:47,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:47,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:47,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:47,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:47,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:47,301 INFO ]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:30:47,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:47,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:47,307 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:47,351 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:47,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:47,354 INFO ]: Computing forward predicates... [2018-06-22 11:30:47,440 INFO ]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:30:47,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:47,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:30:47,460 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:30:47,460 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:30:47,460 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:30:47,460 INFO ]: Start difference. First operand 32 states and 42 transitions. Second operand 12 states. [2018-06-22 11:30:47,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:47,592 INFO ]: Finished difference Result 34 states and 43 transitions. [2018-06-22 11:30:47,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:30:47,593 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:30:47,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:47,594 INFO ]: With dead ends: 34 [2018-06-22 11:30:47,594 INFO ]: Without dead ends: 34 [2018-06-22 11:30:47,594 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:30:47,595 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:30:47,602 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-06-22 11:30:47,602 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:30:47,603 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-22 11:30:47,603 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 33 [2018-06-22 11:30:47,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:47,603 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-22 11:30:47,603 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:30:47,603 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-22 11:30:47,607 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:30:47,607 INFO ]: Found error trace [2018-06-22 11:30:47,607 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:47,607 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:47,607 INFO ]: Analyzing trace with hash 732775679, now seen corresponding path program 3 times [2018-06-22 11:30:47,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:47,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:47,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:47,608 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:47,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:47,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:47,794 INFO ]: Checked inductivity of 23 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:30:47,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:47,794 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) [2018-06-22 11:30:47,809 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:47,846 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:30:47,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:47,849 INFO ]: Computing forward predicates... [2018-06-22 11:30:47,968 INFO ]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:30:47,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:47,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-22 11:30:47,987 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:30:47,987 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:30:47,987 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:30:47,988 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 12 states. [2018-06-22 11:30:48,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:48,055 INFO ]: Finished difference Result 32 states and 40 transitions. [2018-06-22 11:30:48,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:30:48,055 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:30:48,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:48,056 INFO ]: With dead ends: 32 [2018-06-22 11:30:48,056 INFO ]: Without dead ends: 31 [2018-06-22 11:30:48,056 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:30:48,056 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:30:48,060 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 11:30:48,060 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:30:48,061 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-22 11:30:48,061 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2018-06-22 11:30:48,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:48,061 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-22 11:30:48,061 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:30:48,061 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-22 11:30:48,062 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:30:48,062 INFO ]: Found error trace [2018-06-22 11:30:48,062 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:48,062 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:48,062 INFO ]: Analyzing trace with hash 321281027, now seen corresponding path program 4 times [2018-06-22 11:30:48,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:48,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:48,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:48,063 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:48,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:48,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:48,412 INFO ]: Checked inductivity of 30 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:30:48,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:48,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:48,418 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:48,438 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:48,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:48,442 INFO ]: Computing forward predicates... [2018-06-22 11:30:48,702 INFO ]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:30:48,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:48,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2018-06-22 11:30:48,722 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:30:48,722 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:30:48,722 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:30:48,722 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 17 states. [2018-06-22 11:30:49,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:49,095 INFO ]: Finished difference Result 39 states and 50 transitions. [2018-06-22 11:30:49,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:30:49,096 INFO ]: Start accepts. Automaton has 17 states. Word has length 41 [2018-06-22 11:30:49,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:49,097 INFO ]: With dead ends: 39 [2018-06-22 11:30:49,097 INFO ]: Without dead ends: 39 [2018-06-22 11:30:49,097 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:30:49,097 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:30:49,103 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:30:49,104 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:30:49,104 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-06-22 11:30:49,104 INFO ]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 41 [2018-06-22 11:30:49,105 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:49,105 INFO ]: Abstraction has 37 states and 48 transitions. [2018-06-22 11:30:49,105 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:30:49,105 INFO ]: Start isEmpty. Operand 37 states and 48 transitions. [2018-06-22 11:30:49,106 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:30:49,106 INFO ]: Found error trace [2018-06-22 11:30:49,106 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:49,106 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:49,106 INFO ]: Analyzing trace with hash 1088908423, now seen corresponding path program 5 times [2018-06-22 11:30:49,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:49,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:49,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:49,107 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:49,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:49,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:49,250 INFO ]: Checked inductivity of 41 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:30:49,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:49,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:49,257 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:49,308 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:30:49,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:49,312 INFO ]: Computing forward predicates... [2018-06-22 11:30:49,415 INFO ]: Checked inductivity of 41 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:30:49,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:49,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2018-06-22 11:30:49,435 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:30:49,435 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:30:49,435 INFO ]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:49,435 INFO ]: Start difference. First operand 37 states and 48 transitions. Second operand 18 states. [2018-06-22 11:30:49,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:49,721 INFO ]: Finished difference Result 41 states and 55 transitions. [2018-06-22 11:30:49,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:30:49,722 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 11:30:49,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:49,723 INFO ]: With dead ends: 41 [2018-06-22 11:30:49,723 INFO ]: Without dead ends: 41 [2018-06-22 11:30:49,723 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:30:49,723 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:30:49,728 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-06-22 11:30:49,729 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:30:49,729 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-06-22 11:30:49,729 INFO ]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 45 [2018-06-22 11:30:49,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:49,730 INFO ]: Abstraction has 34 states and 42 transitions. [2018-06-22 11:30:49,730 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:30:49,730 INFO ]: Start isEmpty. Operand 34 states and 42 transitions. [2018-06-22 11:30:49,731 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:30:49,731 INFO ]: Found error trace [2018-06-22 11:30:49,731 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:49,732 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:49,732 INFO ]: Analyzing trace with hash 1952672839, now seen corresponding path program 6 times [2018-06-22 11:30:49,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:49,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:49,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:49,733 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:49,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:49,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:50,167 INFO ]: Checked inductivity of 52 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:30:50,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:50,167 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:50,175 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:30:50,246 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:30:50,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:50,250 INFO ]: Computing forward predicates... [2018-06-22 11:30:50,291 INFO ]: Checked inductivity of 52 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:30:50,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:50,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-06-22 11:30:50,324 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:30:50,325 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:30:50,325 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:30:50,325 INFO ]: Start difference. First operand 34 states and 42 transitions. Second operand 14 states. [2018-06-22 11:30:50,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:50,633 INFO ]: Finished difference Result 37 states and 46 transitions. [2018-06-22 11:30:50,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:30:50,634 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-22 11:30:50,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:50,634 INFO ]: With dead ends: 37 [2018-06-22 11:30:50,634 INFO ]: Without dead ends: 36 [2018-06-22 11:30:50,635 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:30:50,635 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:30:50,639 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:30:50,639 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:30:50,640 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-06-22 11:30:50,640 INFO ]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 49 [2018-06-22 11:30:50,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:50,640 INFO ]: Abstraction has 36 states and 44 transitions. [2018-06-22 11:30:50,640 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:30:50,640 INFO ]: Start isEmpty. Operand 36 states and 44 transitions. [2018-06-22 11:30:50,642 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:30:50,642 INFO ]: Found error trace [2018-06-22 11:30:50,642 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:50,642 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:50,642 INFO ]: Analyzing trace with hash 190691531, now seen corresponding path program 7 times [2018-06-22 11:30:50,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:50,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:50,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:50,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:50,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:50,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:50,882 INFO ]: Checked inductivity of 63 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:30:50,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:50,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:50,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:50,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:50,910 INFO ]: Computing forward predicates... [2018-06-22 11:30:51,270 INFO ]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:30:51,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:51,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2018-06-22 11:30:51,290 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:51,290 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:51,290 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:51,290 INFO ]: Start difference. First operand 36 states and 44 transitions. Second operand 20 states. [2018-06-22 11:30:51,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:51,798 INFO ]: Finished difference Result 44 states and 56 transitions. [2018-06-22 11:30:51,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:51,799 INFO ]: Start accepts. Automaton has 20 states. Word has length 53 [2018-06-22 11:30:51,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:51,800 INFO ]: With dead ends: 44 [2018-06-22 11:30:51,800 INFO ]: Without dead ends: 44 [2018-06-22 11:30:51,800 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:30:51,800 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:30:51,806 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 11:30:51,806 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:30:51,807 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-06-22 11:30:51,807 INFO ]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 53 [2018-06-22 11:30:51,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:51,807 INFO ]: Abstraction has 42 states and 54 transitions. [2018-06-22 11:30:51,807 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:51,807 INFO ]: Start isEmpty. Operand 42 states and 54 transitions. [2018-06-22 11:30:51,808 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:30:51,808 INFO ]: Found error trace [2018-06-22 11:30:51,808 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:51,808 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:51,809 INFO ]: Analyzing trace with hash -1887641905, now seen corresponding path program 8 times [2018-06-22 11:30:51,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:51,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:51,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:51,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:51,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:51,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:52,115 INFO ]: Checked inductivity of 78 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:30:52,115 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:52,115 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 11:30:52,122 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:52,142 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:52,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:52,145 INFO ]: Computing forward predicates... [2018-06-22 11:30:52,198 INFO ]: Checked inductivity of 78 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:30:52,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:52,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 11:30:52,229 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:30:52,229 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:30:52,229 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:30:52,229 INFO ]: Start difference. First operand 42 states and 54 transitions. Second operand 16 states. [2018-06-22 11:30:52,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:52,398 INFO ]: Finished difference Result 44 states and 55 transitions. [2018-06-22 11:30:52,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:52,398 INFO ]: Start accepts. Automaton has 16 states. Word has length 57 [2018-06-22 11:30:52,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:52,399 INFO ]: With dead ends: 44 [2018-06-22 11:30:52,399 INFO ]: Without dead ends: 44 [2018-06-22 11:30:52,399 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:30:52,399 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:30:52,403 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-06-22 11:30:52,403 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:30:52,404 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-06-22 11:30:52,404 INFO ]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 57 [2018-06-22 11:30:52,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:52,404 INFO ]: Abstraction has 39 states and 48 transitions. [2018-06-22 11:30:52,404 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:30:52,404 INFO ]: Start isEmpty. Operand 39 states and 48 transitions. [2018-06-22 11:30:52,405 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:30:52,405 INFO ]: Found error trace [2018-06-22 11:30:52,405 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:52,405 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:52,406 INFO ]: Analyzing trace with hash -1911038705, now seen corresponding path program 9 times [2018-06-22 11:30:52,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:52,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:52,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:52,406 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:52,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:52,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:52,529 INFO ]: Checked inductivity of 93 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:30:52,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:52,530 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:52,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:52,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:30:52,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:52,580 INFO ]: Computing forward predicates... [2018-06-22 11:30:52,626 INFO ]: Checked inductivity of 93 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:30:52,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:52,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 11:30:52,660 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:30:52,660 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:30:52,660 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:30:52,660 INFO ]: Start difference. First operand 39 states and 48 transitions. Second operand 16 states. [2018-06-22 11:30:52,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:52,792 INFO ]: Finished difference Result 42 states and 52 transitions. [2018-06-22 11:30:52,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:52,792 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 11:30:52,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:52,793 INFO ]: With dead ends: 42 [2018-06-22 11:30:52,793 INFO ]: Without dead ends: 41 [2018-06-22 11:30:52,793 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:30:52,793 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:30:52,800 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:30:52,800 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:30:52,801 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-06-22 11:30:52,801 INFO ]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 61 [2018-06-22 11:30:52,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:52,801 INFO ]: Abstraction has 41 states and 50 transitions. [2018-06-22 11:30:52,801 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:30:52,801 INFO ]: Start isEmpty. Operand 41 states and 50 transitions. [2018-06-22 11:30:52,803 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:30:52,803 INFO ]: Found error trace [2018-06-22 11:30:52,803 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:52,803 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:52,803 INFO ]: Analyzing trace with hash -54345965, now seen corresponding path program 10 times [2018-06-22 11:30:52,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:52,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:52,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:52,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:52,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:52,824 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:53,616 WARN ]: Spent 618.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:30:53,779 INFO ]: Checked inductivity of 108 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 11:30:53,779 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:53,779 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:53,786 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:53,812 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:53,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:53,815 INFO ]: Computing forward predicates... [2018-06-22 11:30:54,032 INFO ]: Checked inductivity of 108 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:30:54,051 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:54,051 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 23 [2018-06-22 11:30:54,051 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:30:54,051 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:30:54,052 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:30:54,052 INFO ]: Start difference. First operand 41 states and 50 transitions. Second operand 23 states. [2018-06-22 11:30:54,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:54,692 INFO ]: Finished difference Result 49 states and 62 transitions. [2018-06-22 11:30:54,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:54,693 INFO ]: Start accepts. Automaton has 23 states. Word has length 65 [2018-06-22 11:30:54,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:54,694 INFO ]: With dead ends: 49 [2018-06-22 11:30:54,694 INFO ]: Without dead ends: 49 [2018-06-22 11:30:54,694 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:30:54,694 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:30:54,700 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:30:54,700 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:30:54,700 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-06-22 11:30:54,701 INFO ]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 65 [2018-06-22 11:30:54,701 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:54,701 INFO ]: Abstraction has 47 states and 60 transitions. [2018-06-22 11:30:54,701 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:30:54,701 INFO ]: Start isEmpty. Operand 47 states and 60 transitions. [2018-06-22 11:30:54,702 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:30:54,702 INFO ]: Found error trace [2018-06-22 11:30:54,702 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:54,702 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:54,702 INFO ]: Analyzing trace with hash -1799923049, now seen corresponding path program 11 times [2018-06-22 11:30:54,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:54,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:54,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:54,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:54,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:54,715 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:54,905 INFO ]: Checked inductivity of 127 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:30:54,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:54,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:54,911 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:54,942 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:30:54,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:54,945 INFO ]: Computing forward predicates... [2018-06-22 11:30:55,041 INFO ]: Checked inductivity of 127 backedges. 25 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 11:30:55,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:55,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 22 [2018-06-22 11:30:55,072 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:30:55,072 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:30:55,073 INFO ]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:55,073 INFO ]: Start difference. First operand 47 states and 60 transitions. Second operand 22 states. [2018-06-22 11:30:55,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:55,535 INFO ]: Finished difference Result 51 states and 69 transitions. [2018-06-22 11:30:55,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:30:55,535 INFO ]: Start accepts. Automaton has 22 states. Word has length 69 [2018-06-22 11:30:55,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:55,536 INFO ]: With dead ends: 51 [2018-06-22 11:30:55,536 INFO ]: Without dead ends: 51 [2018-06-22 11:30:55,537 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:30:55,537 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:30:55,541 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-06-22 11:30:55,541 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:30:55,542 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-06-22 11:30:55,542 INFO ]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 69 [2018-06-22 11:30:55,542 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:55,542 INFO ]: Abstraction has 44 states and 54 transitions. [2018-06-22 11:30:55,542 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:30:55,542 INFO ]: Start isEmpty. Operand 44 states and 54 transitions. [2018-06-22 11:30:55,543 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:30:55,543 INFO ]: Found error trace [2018-06-22 11:30:55,543 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:55,543 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:55,543 INFO ]: Analyzing trace with hash -817662121, now seen corresponding path program 12 times [2018-06-22 11:30:55,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:55,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:55,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:55,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:55,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:55,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:55,845 INFO ]: Checked inductivity of 146 backedges. 40 proven. 24 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:30:55,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:55,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:55,850 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:30:55,880 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:30:55,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:55,882 INFO ]: Computing forward predicates... [2018-06-22 11:30:55,915 INFO ]: Checked inductivity of 146 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:30:55,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:55,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2018-06-22 11:30:55,935 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:30:55,935 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:30:55,935 INFO ]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:55,935 INFO ]: Start difference. First operand 44 states and 54 transitions. Second operand 18 states. [2018-06-22 11:30:56,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:56,083 INFO ]: Finished difference Result 47 states and 58 transitions. [2018-06-22 11:30:56,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:56,083 INFO ]: Start accepts. Automaton has 18 states. Word has length 73 [2018-06-22 11:30:56,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:56,084 INFO ]: With dead ends: 47 [2018-06-22 11:30:56,084 INFO ]: Without dead ends: 46 [2018-06-22 11:30:56,084 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:30:56,084 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:30:56,090 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:30:56,090 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:30:56,091 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-06-22 11:30:56,091 INFO ]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 73 [2018-06-22 11:30:56,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:56,091 INFO ]: Abstraction has 46 states and 56 transitions. [2018-06-22 11:30:56,091 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:30:56,091 INFO ]: Start isEmpty. Operand 46 states and 56 transitions. [2018-06-22 11:30:56,092 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:30:56,092 INFO ]: Found error trace [2018-06-22 11:30:56,092 INFO ]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:56,092 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:56,092 INFO ]: Analyzing trace with hash 364269275, now seen corresponding path program 13 times [2018-06-22 11:30:56,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:56,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:56,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:56,093 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:56,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:56,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:56,851 WARN ]: Spent 589.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:30:57,022 INFO ]: Checked inductivity of 165 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:30:57,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:57,022 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:57,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:57,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:57,058 INFO ]: Computing forward predicates... [2018-06-22 11:30:57,305 INFO ]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-06-22 11:30:57,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:57,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 26 [2018-06-22 11:30:57,325 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:30:57,325 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:30:57,325 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:30:57,325 INFO ]: Start difference. First operand 46 states and 56 transitions. Second operand 26 states. [2018-06-22 11:30:57,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:57,881 INFO ]: Finished difference Result 54 states and 68 transitions. [2018-06-22 11:30:57,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:30:57,881 INFO ]: Start accepts. Automaton has 26 states. Word has length 77 [2018-06-22 11:30:57,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:57,882 INFO ]: With dead ends: 54 [2018-06-22 11:30:57,882 INFO ]: Without dead ends: 54 [2018-06-22 11:30:57,883 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:30:57,883 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:30:57,889 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 11:30:57,889 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:30:57,890 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-06-22 11:30:57,890 INFO ]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 77 [2018-06-22 11:30:57,891 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:57,895 INFO ]: Abstraction has 52 states and 66 transitions. [2018-06-22 11:30:57,895 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:30:57,895 INFO ]: Start isEmpty. Operand 52 states and 66 transitions. [2018-06-22 11:30:57,896 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:30:57,896 INFO ]: Found error trace [2018-06-22 11:30:57,896 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:57,896 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:57,896 INFO ]: Analyzing trace with hash -1931493409, now seen corresponding path program 14 times [2018-06-22 11:30:57,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:57,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:57,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:57,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:57,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:57,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:58,177 INFO ]: Checked inductivity of 188 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-22 11:30:58,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:58,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:58,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:58,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:58,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:58,214 INFO ]: Computing forward predicates... [2018-06-22 11:30:58,302 INFO ]: Checked inductivity of 188 backedges. 30 proven. 52 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:30:58,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:58,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2018-06-22 11:30:58,321 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:58,321 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:58,322 INFO ]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:58,322 INFO ]: Start difference. First operand 52 states and 66 transitions. Second operand 20 states. [2018-06-22 11:30:58,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:58,634 INFO ]: Finished difference Result 54 states and 67 transitions. [2018-06-22 11:30:58,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:30:58,636 INFO ]: Start accepts. Automaton has 20 states. Word has length 81 [2018-06-22 11:30:58,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:58,637 INFO ]: With dead ends: 54 [2018-06-22 11:30:58,637 INFO ]: Without dead ends: 54 [2018-06-22 11:30:58,637 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:30:58,637 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:30:58,640 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 49. [2018-06-22 11:30:58,641 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:30:58,643 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-06-22 11:30:58,643 INFO ]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 81 [2018-06-22 11:30:58,643 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:58,643 INFO ]: Abstraction has 49 states and 60 transitions. [2018-06-22 11:30:58,643 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:58,643 INFO ]: Start isEmpty. Operand 49 states and 60 transitions. [2018-06-22 11:30:58,647 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:30:58,647 INFO ]: Found error trace [2018-06-22 11:30:58,647 INFO ]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:58,647 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:58,647 INFO ]: Analyzing trace with hash -1557718241, now seen corresponding path program 15 times [2018-06-22 11:30:58,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:58,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:58,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:58,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:58,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:58,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:58,908 INFO ]: Checked inductivity of 211 backedges. 57 proven. 35 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-22 11:30:58,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:58,933 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:58,938 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:58,972 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:30:58,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:58,975 INFO ]: Computing forward predicates... [2018-06-22 11:30:59,005 INFO ]: Checked inductivity of 211 backedges. 57 proven. 30 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-22 11:30:59,024 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:59,024 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2018-06-22 11:30:59,025 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:59,025 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:59,025 INFO ]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:59,025 INFO ]: Start difference. First operand 49 states and 60 transitions. Second operand 20 states. [2018-06-22 11:30:59,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:59,323 INFO ]: Finished difference Result 52 states and 64 transitions. [2018-06-22 11:30:59,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:30:59,323 INFO ]: Start accepts. Automaton has 20 states. Word has length 85 [2018-06-22 11:30:59,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:59,324 INFO ]: With dead ends: 52 [2018-06-22 11:30:59,324 INFO ]: Without dead ends: 51 [2018-06-22 11:30:59,324 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:30:59,324 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:30:59,327 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 11:30:59,327 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:30:59,328 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-06-22 11:30:59,328 INFO ]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 85 [2018-06-22 11:30:59,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:59,328 INFO ]: Abstraction has 51 states and 62 transitions. [2018-06-22 11:30:59,328 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:59,328 INFO ]: Start isEmpty. Operand 51 states and 62 transitions. [2018-06-22 11:30:59,329 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:30:59,329 INFO ]: Found error trace [2018-06-22 11:30:59,329 INFO ]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:59,329 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:59,329 INFO ]: Analyzing trace with hash 1734428707, now seen corresponding path program 16 times [2018-06-22 11:30:59,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:59,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:59,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:59,330 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:59,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:59,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:59,691 INFO ]: Checked inductivity of 234 backedges. 5 proven. 99 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 11:30:59,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:59,691 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:59,696 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:59,746 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:59,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:59,751 INFO ]: Computing forward predicates... [2018-06-22 11:31:00,155 INFO ]: Checked inductivity of 234 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-06-22 11:31:00,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:00,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 29 [2018-06-22 11:31:00,174 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:31:00,174 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:31:00,175 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:31:00,175 INFO ]: Start difference. First operand 51 states and 62 transitions. Second operand 29 states. [2018-06-22 11:31:00,917 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:00,918 INFO ]: Finished difference Result 59 states and 74 transitions. [2018-06-22 11:31:00,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:31:00,918 INFO ]: Start accepts. Automaton has 29 states. Word has length 89 [2018-06-22 11:31:00,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:00,919 INFO ]: With dead ends: 59 [2018-06-22 11:31:00,919 INFO ]: Without dead ends: 59 [2018-06-22 11:31:00,920 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 77 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:31:00,920 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:31:00,927 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-06-22 11:31:00,928 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:31:00,928 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2018-06-22 11:31:00,928 INFO ]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 89 [2018-06-22 11:31:00,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:00,929 INFO ]: Abstraction has 57 states and 72 transitions. [2018-06-22 11:31:00,929 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:31:00,929 INFO ]: Start isEmpty. Operand 57 states and 72 transitions. [2018-06-22 11:31:00,929 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:31:00,929 INFO ]: Found error trace [2018-06-22 11:31:00,930 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:00,930 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:00,930 INFO ]: Analyzing trace with hash -452530521, now seen corresponding path program 17 times [2018-06-22 11:31:00,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:00,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:00,931 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:00,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:00,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:01,289 INFO ]: Checked inductivity of 261 backedges. 56 proven. 62 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-22 11:31:01,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:01,290 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:01,297 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:01,338 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:31:01,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:01,341 INFO ]: Computing forward predicates... [2018-06-22 11:31:01,428 INFO ]: Checked inductivity of 261 backedges. 49 proven. 81 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 11:31:01,447 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:01,447 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 26 [2018-06-22 11:31:01,447 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:31:01,447 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:31:01,447 INFO ]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:31:01,447 INFO ]: Start difference. First operand 57 states and 72 transitions. Second operand 26 states. [2018-06-22 11:31:01,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:01,967 INFO ]: Finished difference Result 61 states and 83 transitions. [2018-06-22 11:31:01,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:31:01,967 INFO ]: Start accepts. Automaton has 26 states. Word has length 93 [2018-06-22 11:31:01,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:01,968 INFO ]: With dead ends: 61 [2018-06-22 11:31:01,968 INFO ]: Without dead ends: 61 [2018-06-22 11:31:01,969 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:31:01,969 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:31:01,973 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-06-22 11:31:01,973 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:31:01,974 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-06-22 11:31:01,974 INFO ]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 93 [2018-06-22 11:31:01,974 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:01,974 INFO ]: Abstraction has 54 states and 66 transitions. [2018-06-22 11:31:01,974 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:31:01,974 INFO ]: Start isEmpty. Operand 54 states and 66 transitions. [2018-06-22 11:31:01,975 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:31:01,975 INFO ]: Found error trace [2018-06-22 11:31:01,975 INFO ]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:01,975 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:01,975 INFO ]: Analyzing trace with hash 1070311527, now seen corresponding path program 18 times [2018-06-22 11:31:01,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:01,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:01,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:01,976 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:01,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:01,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:02,645 INFO ]: Checked inductivity of 288 backedges. 77 proven. 48 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-22 11:31:02,645 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:02,645 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:02,653 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:02,695 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:31:02,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:02,700 INFO ]: Computing forward predicates... [2018-06-22 11:31:02,753 INFO ]: Checked inductivity of 288 backedges. 77 proven. 42 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:31:02,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:02,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2018-06-22 11:31:02,773 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:31:02,773 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:31:02,773 INFO ]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:31:02,773 INFO ]: Start difference. First operand 54 states and 66 transitions. Second operand 22 states. [2018-06-22 11:31:03,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:03,025 INFO ]: Finished difference Result 57 states and 70 transitions. [2018-06-22 11:31:03,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:31:03,025 INFO ]: Start accepts. Automaton has 22 states. Word has length 97 [2018-06-22 11:31:03,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:03,026 INFO ]: With dead ends: 57 [2018-06-22 11:31:03,026 INFO ]: Without dead ends: 56 [2018-06-22 11:31:03,026 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:31:03,026 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:31:03,029 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:31:03,029 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:31:03,030 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-06-22 11:31:03,030 INFO ]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 97 [2018-06-22 11:31:03,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:03,030 INFO ]: Abstraction has 56 states and 68 transitions. [2018-06-22 11:31:03,030 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:31:03,030 INFO ]: Start isEmpty. Operand 56 states and 68 transitions. [2018-06-22 11:31:03,031 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:31:03,031 INFO ]: Found error trace [2018-06-22 11:31:03,031 INFO ]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:03,031 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:03,031 INFO ]: Analyzing trace with hash 464816875, now seen corresponding path program 19 times [2018-06-22 11:31:03,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:03,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:03,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:03,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:03,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:03,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:03,442 INFO ]: Checked inductivity of 315 backedges. 6 proven. 133 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-06-22 11:31:03,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:03,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:03,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:03,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:03,487 INFO ]: Computing forward predicates... [2018-06-22 11:31:03,818 INFO ]: Checked inductivity of 315 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-22 11:31:03,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:03,837 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 32 [2018-06-22 11:31:03,837 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:31:03,837 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:31:03,837 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:31:03,837 INFO ]: Start difference. First operand 56 states and 68 transitions. Second operand 32 states. [2018-06-22 11:31:05,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:05,101 INFO ]: Finished difference Result 64 states and 80 transitions. [2018-06-22 11:31:05,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:31:05,101 INFO ]: Start accepts. Automaton has 32 states. Word has length 101 [2018-06-22 11:31:05,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:05,102 INFO ]: With dead ends: 64 [2018-06-22 11:31:05,102 INFO ]: Without dead ends: 64 [2018-06-22 11:31:05,103 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 88 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=158, Invalid=2194, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:31:05,103 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:31:05,107 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-06-22 11:31:05,107 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:31:05,108 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-06-22 11:31:05,108 INFO ]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 101 [2018-06-22 11:31:05,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:05,108 INFO ]: Abstraction has 62 states and 78 transitions. [2018-06-22 11:31:05,108 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:31:05,108 INFO ]: Start isEmpty. Operand 62 states and 78 transitions. [2018-06-22 11:31:05,109 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:31:05,109 INFO ]: Found error trace [2018-06-22 11:31:05,109 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:05,109 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:05,109 INFO ]: Analyzing trace with hash -251279633, now seen corresponding path program 20 times [2018-06-22 11:31:05,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:05,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:05,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:05,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:05,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:05,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:05,458 INFO ]: Checked inductivity of 346 backedges. 72 proven. 83 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-22 11:31:05,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:05,458 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:05,467 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:05,522 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:05,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:05,526 INFO ]: Computing forward predicates... [2018-06-22 11:31:05,588 INFO ]: Checked inductivity of 346 backedges. 56 proven. 93 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-06-22 11:31:05,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:05,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2018-06-22 11:31:05,620 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:31:05,620 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:31:05,620 INFO ]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:31:05,620 INFO ]: Start difference. First operand 62 states and 78 transitions. Second operand 24 states. [2018-06-22 11:31:06,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:06,466 INFO ]: Finished difference Result 64 states and 79 transitions. [2018-06-22 11:31:06,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:31:06,466 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 11:31:06,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:06,467 INFO ]: With dead ends: 64 [2018-06-22 11:31:06,467 INFO ]: Without dead ends: 64 [2018-06-22 11:31:06,468 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:31:06,468 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:31:06,471 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-06-22 11:31:06,471 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:31:06,472 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-06-22 11:31:06,472 INFO ]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 105 [2018-06-22 11:31:06,473 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:06,473 INFO ]: Abstraction has 59 states and 72 transitions. [2018-06-22 11:31:06,473 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:31:06,473 INFO ]: Start isEmpty. Operand 59 states and 72 transitions. [2018-06-22 11:31:06,474 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:31:06,474 INFO ]: Found error trace [2018-06-22 11:31:06,474 INFO ]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:06,474 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:06,474 INFO ]: Analyzing trace with hash -603848913, now seen corresponding path program 21 times [2018-06-22 11:31:06,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:06,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:06,474 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:06,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:06,725 INFO ]: Checked inductivity of 377 backedges. 100 proven. 63 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-06-22 11:31:06,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:06,725 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:06,730 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:06,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:31:06,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:06,783 INFO ]: Computing forward predicates... [2018-06-22 11:31:06,841 INFO ]: Checked inductivity of 377 backedges. 100 proven. 56 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 11:31:06,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:06,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2018-06-22 11:31:06,867 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:31:06,867 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:31:06,867 INFO ]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:31:06,867 INFO ]: Start difference. First operand 59 states and 72 transitions. Second operand 24 states. [2018-06-22 11:31:07,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:07,112 INFO ]: Finished difference Result 62 states and 76 transitions. [2018-06-22 11:31:07,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:31:07,113 INFO ]: Start accepts. Automaton has 24 states. Word has length 109 [2018-06-22 11:31:07,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:07,113 INFO ]: With dead ends: 62 [2018-06-22 11:31:07,113 INFO ]: Without dead ends: 61 [2018-06-22 11:31:07,114 INFO ]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:31:07,114 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:31:07,117 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-22 11:31:07,117 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:31:07,118 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-06-22 11:31:07,118 INFO ]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 109 [2018-06-22 11:31:07,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:07,118 INFO ]: Abstraction has 61 states and 74 transitions. [2018-06-22 11:31:07,118 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:31:07,118 INFO ]: Start isEmpty. Operand 61 states and 74 transitions. [2018-06-22 11:31:07,119 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:31:07,119 INFO ]: Found error trace [2018-06-22 11:31:07,119 INFO ]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:07,119 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:07,119 INFO ]: Analyzing trace with hash 728299315, now seen corresponding path program 22 times [2018-06-22 11:31:07,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:07,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:07,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:07,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:07,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:07,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:07,654 WARN ]: Spent 359.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-06-22 11:31:08,173 INFO ]: Checked inductivity of 408 backedges. 7 proven. 172 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-06-22 11:31:08,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:08,173 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:08,179 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:08,222 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:08,222 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:08,226 INFO ]: Computing forward predicates... [2018-06-22 11:31:08,741 INFO ]: Checked inductivity of 408 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-22 11:31:08,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:08,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 35 [2018-06-22 11:31:08,761 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:31:08,761 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:31:08,761 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:31:08,761 INFO ]: Start difference. First operand 61 states and 74 transitions. Second operand 35 states. [2018-06-22 11:31:10,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:10,063 INFO ]: Finished difference Result 69 states and 86 transitions. [2018-06-22 11:31:10,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:31:10,064 INFO ]: Start accepts. Automaton has 35 states. Word has length 113 [2018-06-22 11:31:10,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:10,064 INFO ]: With dead ends: 69 [2018-06-22 11:31:10,064 INFO ]: Without dead ends: 69 [2018-06-22 11:31:10,065 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 99 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=176, Invalid=2686, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:31:10,065 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:31:10,069 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-06-22 11:31:10,069 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:31:10,070 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2018-06-22 11:31:10,071 INFO ]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 113 [2018-06-22 11:31:10,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:10,071 INFO ]: Abstraction has 67 states and 84 transitions. [2018-06-22 11:31:10,071 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:31:10,071 INFO ]: Start isEmpty. Operand 67 states and 84 transitions. [2018-06-22 11:31:10,072 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:31:10,072 INFO ]: Found error trace [2018-06-22 11:31:10,072 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:10,072 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:10,072 INFO ]: Analyzing trace with hash 561850551, now seen corresponding path program 23 times [2018-06-22 11:31:10,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:10,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:10,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:10,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:10,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:10,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:10,342 INFO ]: Checked inductivity of 443 backedges. 90 proven. 107 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:31:10,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:10,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:10,347 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:10,396 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:31:10,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:10,400 INFO ]: Computing forward predicates... [2018-06-22 11:31:10,503 INFO ]: Checked inductivity of 443 backedges. 81 proven. 132 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-06-22 11:31:10,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:10,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 30 [2018-06-22 11:31:10,522 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:31:10,522 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:31:10,523 INFO ]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:31:10,523 INFO ]: Start difference. First operand 67 states and 84 transitions. Second operand 30 states. [2018-06-22 11:31:11,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:11,028 INFO ]: Finished difference Result 71 states and 97 transitions. [2018-06-22 11:31:11,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:31:11,029 INFO ]: Start accepts. Automaton has 30 states. Word has length 117 [2018-06-22 11:31:11,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:11,029 INFO ]: With dead ends: 71 [2018-06-22 11:31:11,029 INFO ]: Without dead ends: 71 [2018-06-22 11:31:11,030 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1962, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:31:11,030 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:31:11,036 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-06-22 11:31:11,036 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:31:11,037 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-06-22 11:31:11,037 INFO ]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 117 [2018-06-22 11:31:11,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:11,037 INFO ]: Abstraction has 64 states and 78 transitions. [2018-06-22 11:31:11,037 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:31:11,037 INFO ]: Start isEmpty. Operand 64 states and 78 transitions. [2018-06-22 11:31:11,038 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:31:11,038 INFO ]: Found error trace [2018-06-22 11:31:11,038 INFO ]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:11,038 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:11,038 INFO ]: Analyzing trace with hash 1700986743, now seen corresponding path program 24 times [2018-06-22 11:31:11,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:11,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:11,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:11,039 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:11,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:11,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:11,616 INFO ]: Checked inductivity of 478 backedges. 126 proven. 80 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-06-22 11:31:11,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:11,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:11,623 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:11,674 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:31:11,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:11,677 INFO ]: Computing forward predicates... [2018-06-22 11:31:11,724 INFO ]: Checked inductivity of 478 backedges. 126 proven. 72 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-06-22 11:31:11,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:11,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2018-06-22 11:31:11,757 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:31:11,757 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:31:11,757 INFO ]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:31:11,757 INFO ]: Start difference. First operand 64 states and 78 transitions. Second operand 26 states. [2018-06-22 11:31:12,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:12,194 INFO ]: Finished difference Result 67 states and 82 transitions. [2018-06-22 11:31:12,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:31:12,194 INFO ]: Start accepts. Automaton has 26 states. Word has length 121 [2018-06-22 11:31:12,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:12,195 INFO ]: With dead ends: 67 [2018-06-22 11:31:12,195 INFO ]: Without dead ends: 66 [2018-06-22 11:31:12,196 INFO ]: 0 DeclaredPredicates, 176 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:31:12,196 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:31:12,198 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:31:12,198 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:31:12,199 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-06-22 11:31:12,199 INFO ]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 121 [2018-06-22 11:31:12,199 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:12,199 INFO ]: Abstraction has 66 states and 80 transitions. [2018-06-22 11:31:12,199 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:31:12,199 INFO ]: Start isEmpty. Operand 66 states and 80 transitions. [2018-06-22 11:31:12,200 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:31:12,200 INFO ]: Found error trace [2018-06-22 11:31:12,200 INFO ]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:12,200 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:12,200 INFO ]: Analyzing trace with hash -1811976965, now seen corresponding path program 25 times [2018-06-22 11:31:12,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:12,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:12,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:12,201 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:12,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:12,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:12,766 INFO ]: Checked inductivity of 513 backedges. 8 proven. 216 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-06-22 11:31:12,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:12,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:12,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:12,837 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:12,844 INFO ]: Computing forward predicates... [2018-06-22 11:31:13,419 INFO ]: Checked inductivity of 513 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-06-22 11:31:13,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:13,439 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 38 [2018-06-22 11:31:13,439 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:31:13,439 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:31:13,439 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:31:13,439 INFO ]: Start difference. First operand 66 states and 80 transitions. Second operand 38 states. [2018-06-22 11:31:14,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:14,552 INFO ]: Finished difference Result 74 states and 92 transitions. [2018-06-22 11:31:14,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:31:14,552 INFO ]: Start accepts. Automaton has 38 states. Word has length 125 [2018-06-22 11:31:14,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:14,553 INFO ]: With dead ends: 74 [2018-06-22 11:31:14,553 INFO ]: Without dead ends: 74 [2018-06-22 11:31:14,554 INFO ]: 0 DeclaredPredicates, 187 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=194, Invalid=3228, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:31:14,554 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:31:14,558 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-06-22 11:31:14,558 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:31:14,559 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2018-06-22 11:31:14,559 INFO ]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 125 [2018-06-22 11:31:14,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:14,559 INFO ]: Abstraction has 72 states and 90 transitions. [2018-06-22 11:31:14,559 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:31:14,560 INFO ]: Start isEmpty. Operand 72 states and 90 transitions. [2018-06-22 11:31:14,560 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 11:31:14,560 INFO ]: Found error trace [2018-06-22 11:31:14,560 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:14,561 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:14,561 INFO ]: Analyzing trace with hash -1177160705, now seen corresponding path program 26 times [2018-06-22 11:31:14,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:14,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:14,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:14,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:15,413 INFO ]: Checked inductivity of 552 backedges. 110 proven. 134 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-06-22 11:31:15,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:15,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:15,425 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:15,485 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:15,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:15,489 INFO ]: Computing forward predicates... [2018-06-22 11:31:15,592 INFO ]: Checked inductivity of 552 backedges. 90 proven. 146 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-06-22 11:31:15,611 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:15,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2018-06-22 11:31:15,611 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:31:15,611 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:31:15,611 INFO ]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:31:15,612 INFO ]: Start difference. First operand 72 states and 90 transitions. Second operand 28 states. [2018-06-22 11:31:15,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:15,964 INFO ]: Finished difference Result 74 states and 91 transitions. [2018-06-22 11:31:15,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:31:15,965 INFO ]: Start accepts. Automaton has 28 states. Word has length 129 [2018-06-22 11:31:15,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:15,965 INFO ]: With dead ends: 74 [2018-06-22 11:31:15,965 INFO ]: Without dead ends: 74 [2018-06-22 11:31:15,966 INFO ]: 0 DeclaredPredicates, 190 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=1750, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:31:15,966 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:31:15,969 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-06-22 11:31:15,969 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:31:15,970 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2018-06-22 11:31:15,970 INFO ]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 129 [2018-06-22 11:31:15,970 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:15,970 INFO ]: Abstraction has 69 states and 84 transitions. [2018-06-22 11:31:15,970 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:31:15,970 INFO ]: Start isEmpty. Operand 69 states and 84 transitions. [2018-06-22 11:31:15,971 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:31:15,971 INFO ]: Found error trace [2018-06-22 11:31:15,971 INFO ]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:15,971 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:15,971 INFO ]: Analyzing trace with hash -1236301505, now seen corresponding path program 27 times [2018-06-22 11:31:15,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:15,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:15,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:15,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:16,409 INFO ]: Checked inductivity of 591 backedges. 155 proven. 99 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-06-22 11:31:16,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:16,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:16,415 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:16,593 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 11:31:16,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:16,599 INFO ]: Computing forward predicates... [2018-06-22 11:31:16,800 INFO ]: Checked inductivity of 591 backedges. 155 proven. 90 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2018-06-22 11:31:16,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:16,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2018-06-22 11:31:16,831 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:31:16,831 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:31:16,831 INFO ]: CoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:31:16,831 INFO ]: Start difference. First operand 69 states and 84 transitions. Second operand 28 states. [2018-06-22 11:31:17,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:17,221 INFO ]: Finished difference Result 72 states and 88 transitions. [2018-06-22 11:31:17,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:31:17,221 INFO ]: Start accepts. Automaton has 28 states. Word has length 133 [2018-06-22 11:31:17,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:17,222 INFO ]: With dead ends: 72 [2018-06-22 11:31:17,222 INFO ]: Without dead ends: 71 [2018-06-22 11:31:17,223 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:31:17,223 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:31:17,226 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-06-22 11:31:17,226 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:31:17,226 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-06-22 11:31:17,226 INFO ]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 133 [2018-06-22 11:31:17,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:17,226 INFO ]: Abstraction has 71 states and 86 transitions. [2018-06-22 11:31:17,226 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:31:17,226 INFO ]: Start isEmpty. Operand 71 states and 86 transitions. [2018-06-22 11:31:17,230 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:31:17,230 INFO ]: Found error trace [2018-06-22 11:31:17,230 INFO ]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:17,230 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:17,230 INFO ]: Analyzing trace with hash 230739011, now seen corresponding path program 28 times [2018-06-22 11:31:17,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:17,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:17,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:17,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:17,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:17,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,798 INFO ]: Checked inductivity of 630 backedges. 9 proven. 265 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-06-22 11:31:17,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:17,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:17,803 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:17,857 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:17,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,864 INFO ]: Computing forward predicates... [2018-06-22 11:31:19,478 INFO ]: Checked inductivity of 630 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-06-22 11:31:19,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:19,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 41 [2018-06-22 11:31:19,505 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:31:19,505 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:31:19,506 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:31:19,506 INFO ]: Start difference. First operand 71 states and 86 transitions. Second operand 41 states. [2018-06-22 11:31:20,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:20,938 INFO ]: Finished difference Result 79 states and 98 transitions. [2018-06-22 11:31:20,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:31:20,938 INFO ]: Start accepts. Automaton has 41 states. Word has length 137 [2018-06-22 11:31:20,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:20,939 INFO ]: With dead ends: 79 [2018-06-22 11:31:20,939 INFO ]: Without dead ends: 79 [2018-06-22 11:31:20,940 INFO ]: 0 DeclaredPredicates, 205 GetRequests, 121 SyntacticMatches, 22 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=212, Invalid=3820, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:31:20,940 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:31:20,945 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-06-22 11:31:20,945 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:31:20,945 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-06-22 11:31:20,946 INFO ]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 137 [2018-06-22 11:31:20,946 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:20,946 INFO ]: Abstraction has 77 states and 96 transitions. [2018-06-22 11:31:20,946 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:31:20,946 INFO ]: Start isEmpty. Operand 77 states and 96 transitions. [2018-06-22 11:31:20,947 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:31:20,947 INFO ]: Found error trace [2018-06-22 11:31:20,947 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:20,947 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:20,947 INFO ]: Analyzing trace with hash 104925383, now seen corresponding path program 29 times [2018-06-22 11:31:20,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:20,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:20,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:20,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:20,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:20,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:21,309 INFO ]: Checked inductivity of 673 backedges. 132 proven. 164 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2018-06-22 11:31:21,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:21,309 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:21,316 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:21,376 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 11:31:21,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:21,381 INFO ]: Computing forward predicates... [2018-06-22 11:31:21,753 INFO ]: Checked inductivity of 673 backedges. 121 proven. 195 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-06-22 11:31:21,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:21,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 34 [2018-06-22 11:31:21,773 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:31:21,773 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:31:21,773 INFO ]: CoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:31:21,773 INFO ]: Start difference. First operand 77 states and 96 transitions. Second operand 34 states. [2018-06-22 11:31:22,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:22,467 INFO ]: Finished difference Result 81 states and 111 transitions. [2018-06-22 11:31:22,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:31:22,467 INFO ]: Start accepts. Automaton has 34 states. Word has length 141 [2018-06-22 11:31:22,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:22,468 INFO ]: With dead ends: 81 [2018-06-22 11:31:22,468 INFO ]: Without dead ends: 81 [2018-06-22 11:31:22,468 INFO ]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=536, Invalid=2656, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:31:22,468 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:31:22,473 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-06-22 11:31:22,473 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:31:22,474 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-06-22 11:31:22,474 INFO ]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 141 [2018-06-22 11:31:22,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:22,474 INFO ]: Abstraction has 74 states and 90 transitions. [2018-06-22 11:31:22,474 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:31:22,474 INFO ]: Start isEmpty. Operand 74 states and 90 transitions. [2018-06-22 11:31:22,475 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:31:22,475 INFO ]: Found error trace [2018-06-22 11:31:22,475 INFO ]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:22,475 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:22,475 INFO ]: Analyzing trace with hash 1274051719, now seen corresponding path program 30 times [2018-06-22 11:31:22,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:22,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:22,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:22,476 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:22,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:22,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,818 INFO ]: Checked inductivity of 716 backedges. 187 proven. 120 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2018-06-22 11:31:22,818 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:22,818 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:22,823 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:22,882 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:31:22,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,885 INFO ]: Computing forward predicates... [2018-06-22 11:31:22,950 INFO ]: Checked inductivity of 716 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-06-22 11:31:22,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:22,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 30 [2018-06-22 11:31:22,975 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:31:22,975 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:31:22,975 INFO ]: CoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:31:22,975 INFO ]: Start difference. First operand 74 states and 90 transitions. Second operand 30 states. [2018-06-22 11:31:23,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:23,334 INFO ]: Finished difference Result 77 states and 94 transitions. [2018-06-22 11:31:23,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:31:23,334 INFO ]: Start accepts. Automaton has 30 states. Word has length 145 [2018-06-22 11:31:23,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:23,335 INFO ]: With dead ends: 77 [2018-06-22 11:31:23,335 INFO ]: Without dead ends: 76 [2018-06-22 11:31:23,336 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:31:23,336 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:31:23,339 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-22 11:31:23,339 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:31:23,339 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2018-06-22 11:31:23,339 INFO ]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 145 [2018-06-22 11:31:23,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:23,339 INFO ]: Abstraction has 76 states and 92 transitions. [2018-06-22 11:31:23,339 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:31:23,339 INFO ]: Start isEmpty. Operand 76 states and 92 transitions. [2018-06-22 11:31:23,340 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:31:23,340 INFO ]: Found error trace [2018-06-22 11:31:23,340 INFO ]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:23,340 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:23,340 INFO ]: Analyzing trace with hash 1102968075, now seen corresponding path program 31 times [2018-06-22 11:31:23,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:23,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:23,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:23,340 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:23,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:23,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:23,685 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:31:24,142 INFO ]: Checked inductivity of 759 backedges. 10 proven. 319 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-06-22 11:31:24,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:24,142 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:24,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:24,200 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:24,205 INFO ]: Computing forward predicates... [2018-06-22 11:31:24,828 INFO ]: Checked inductivity of 759 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-06-22 11:31:24,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:24,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 44 [2018-06-22 11:31:24,847 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:31:24,847 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:31:24,847 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:31:24,848 INFO ]: Start difference. First operand 76 states and 92 transitions. Second operand 44 states. [2018-06-22 11:31:26,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:26,549 INFO ]: Finished difference Result 84 states and 104 transitions. [2018-06-22 11:31:26,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:31:26,550 INFO ]: Start accepts. Automaton has 44 states. Word has length 149 [2018-06-22 11:31:26,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:26,550 INFO ]: With dead ends: 84 [2018-06-22 11:31:26,550 INFO ]: Without dead ends: 84 [2018-06-22 11:31:26,551 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 132 SyntacticMatches, 24 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=4462, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:31:26,551 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:31:26,556 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-06-22 11:31:26,556 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:31:26,556 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2018-06-22 11:31:26,557 INFO ]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 149 [2018-06-22 11:31:26,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:26,557 INFO ]: Abstraction has 82 states and 102 transitions. [2018-06-22 11:31:26,557 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:31:26,557 INFO ]: Start isEmpty. Operand 82 states and 102 transitions. [2018-06-22 11:31:26,561 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 11:31:26,561 INFO ]: Found error trace [2018-06-22 11:31:26,561 INFO ]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:26,561 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:26,561 INFO ]: Analyzing trace with hash 297223951, now seen corresponding path program 32 times [2018-06-22 11:31:26,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:26,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:26,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:26,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:26,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:26,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:26,954 INFO ]: Checked inductivity of 806 backedges. 156 proven. 197 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-06-22 11:31:26,954 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:26,954 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:26,959 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:27,010 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:27,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:27,015 INFO ]: Computing forward predicates... [2018-06-22 11:31:27,154 INFO ]: Checked inductivity of 806 backedges. 132 proven. 211 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-06-22 11:31:27,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:27,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2018-06-22 11:31:27,185 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:31:27,185 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:31:27,185 INFO ]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:31:27,185 INFO ]: Start difference. First operand 82 states and 102 transitions. Second operand 32 states. [2018-06-22 11:31:27,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:27,634 INFO ]: Finished difference Result 84 states and 103 transitions. [2018-06-22 11:31:27,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:31:27,634 INFO ]: Start accepts. Automaton has 32 states. Word has length 153 [2018-06-22 11:31:27,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:27,635 INFO ]: With dead ends: 84 [2018-06-22 11:31:27,635 INFO ]: Without dead ends: 84 [2018-06-22 11:31:27,635 INFO ]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:31:27,636 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:31:27,639 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-06-22 11:31:27,639 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:31:27,640 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2018-06-22 11:31:27,640 INFO ]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 153 [2018-06-22 11:31:27,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:27,640 INFO ]: Abstraction has 79 states and 96 transitions. [2018-06-22 11:31:27,640 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:31:27,640 INFO ]: Start isEmpty. Operand 79 states and 96 transitions. [2018-06-22 11:31:27,641 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 11:31:27,641 INFO ]: Found error trace [2018-06-22 11:31:27,641 INFO ]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:27,641 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:27,641 INFO ]: Analyzing trace with hash 2083961167, now seen corresponding path program 33 times [2018-06-22 11:31:27,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:27,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:27,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:27,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:27,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:27,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:28,221 INFO ]: Checked inductivity of 853 backedges. 222 proven. 143 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-06-22 11:31:28,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:28,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:28,226 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:28,428 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:31:28,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:28,434 INFO ]: Computing forward predicates... [2018-06-22 11:31:28,649 INFO ]: Checked inductivity of 853 backedges. 222 proven. 132 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-06-22 11:31:28,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:28,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2018-06-22 11:31:28,669 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:31:28,669 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:31:28,669 INFO ]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:31:28,669 INFO ]: Start difference. First operand 79 states and 96 transitions. Second operand 32 states. [2018-06-22 11:31:29,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:29,097 INFO ]: Finished difference Result 82 states and 100 transitions. [2018-06-22 11:31:29,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:31:29,097 INFO ]: Start accepts. Automaton has 32 states. Word has length 157 [2018-06-22 11:31:29,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:29,098 INFO ]: With dead ends: 82 [2018-06-22 11:31:29,098 INFO ]: Without dead ends: 81 [2018-06-22 11:31:29,098 INFO ]: 0 DeclaredPredicates, 230 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:31:29,098 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:31:29,101 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-22 11:31:29,101 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:31:29,102 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2018-06-22 11:31:29,102 INFO ]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 157 [2018-06-22 11:31:29,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:29,102 INFO ]: Abstraction has 81 states and 98 transitions. [2018-06-22 11:31:29,102 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:31:29,102 INFO ]: Start isEmpty. Operand 81 states and 98 transitions. [2018-06-22 11:31:29,103 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 11:31:29,103 INFO ]: Found error trace [2018-06-22 11:31:29,103 INFO ]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:29,103 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:29,103 INFO ]: Analyzing trace with hash 2144323411, now seen corresponding path program 34 times [2018-06-22 11:31:29,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:29,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:29,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:29,104 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:29,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:29,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:29,847 WARN ]: Spent 585.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:31:30,371 INFO ]: Checked inductivity of 900 backedges. 11 proven. 378 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2018-06-22 11:31:30,371 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:30,371 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:30,377 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:30,434 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:30,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:30,441 INFO ]: Computing forward predicates... [2018-06-22 11:31:31,258 INFO ]: Checked inductivity of 900 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-06-22 11:31:31,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:31,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 47 [2018-06-22 11:31:31,277 INFO ]: Interpolant automaton has 47 states [2018-06-22 11:31:31,277 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 11:31:31,277 INFO ]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:31:31,277 INFO ]: Start difference. First operand 81 states and 98 transitions. Second operand 47 states. [2018-06-22 11:31:32,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:32,865 INFO ]: Finished difference Result 89 states and 110 transitions. [2018-06-22 11:31:32,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:31:32,865 INFO ]: Start accepts. Automaton has 47 states. Word has length 161 [2018-06-22 11:31:32,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:32,865 INFO ]: With dead ends: 89 [2018-06-22 11:31:32,865 INFO ]: Without dead ends: 89 [2018-06-22 11:31:32,866 INFO ]: 0 DeclaredPredicates, 241 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=248, Invalid=5154, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 11:31:32,866 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:31:32,870 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-06-22 11:31:32,870 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:31:32,870 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2018-06-22 11:31:32,870 INFO ]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 161 [2018-06-22 11:31:32,871 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:32,871 INFO ]: Abstraction has 87 states and 108 transitions. [2018-06-22 11:31:32,871 INFO ]: Interpolant automaton has 47 states. [2018-06-22 11:31:32,871 INFO ]: Start isEmpty. Operand 87 states and 108 transitions. [2018-06-22 11:31:32,872 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 11:31:32,872 INFO ]: Found error trace [2018-06-22 11:31:32,872 INFO ]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:32,872 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:32,872 INFO ]: Analyzing trace with hash -604401961, now seen corresponding path program 35 times [2018-06-22 11:31:32,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:32,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:32,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:32,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:32,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:32,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:33,707 INFO ]: Checked inductivity of 951 backedges. 182 proven. 233 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-06-22 11:31:33,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:33,707 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:33,713 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:33,788 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-22 11:31:33,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:33,792 INFO ]: Computing forward predicates... [2018-06-22 11:31:33,959 INFO ]: Checked inductivity of 951 backedges. 169 proven. 270 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-22 11:31:33,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:33,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 38 [2018-06-22 11:31:33,979 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:31:33,979 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:31:33,980 INFO ]: CoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:31:33,980 INFO ]: Start difference. First operand 87 states and 108 transitions. Second operand 38 states. [2018-06-22 11:31:35,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:35,029 INFO ]: Finished difference Result 91 states and 125 transitions. [2018-06-22 11:31:35,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:31:35,073 INFO ]: Start accepts. Automaton has 38 states. Word has length 165 [2018-06-22 11:31:35,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:35,074 INFO ]: With dead ends: 91 [2018-06-22 11:31:35,075 INFO ]: Without dead ends: 91 [2018-06-22 11:31:35,075 INFO ]: 0 DeclaredPredicates, 246 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=706, Invalid=3454, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 11:31:35,075 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:31:35,080 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-06-22 11:31:35,080 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:31:35,080 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-06-22 11:31:35,080 INFO ]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 165 [2018-06-22 11:31:35,082 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:35,082 INFO ]: Abstraction has 84 states and 102 transitions. [2018-06-22 11:31:35,082 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:31:35,082 INFO ]: Start isEmpty. Operand 84 states and 102 transitions. [2018-06-22 11:31:35,083 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 11:31:35,083 INFO ]: Found error trace [2018-06-22 11:31:35,083 INFO ]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:35,083 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:35,083 INFO ]: Analyzing trace with hash 735780759, now seen corresponding path program 36 times [2018-06-22 11:31:35,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:35,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:35,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:35,084 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:35,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:35,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:36,173 INFO ]: Checked inductivity of 1002 backedges. 260 proven. 168 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-06-22 11:31:36,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:36,173 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:36,179 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:36,253 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 11:31:36,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:36,256 INFO ]: Computing forward predicates... [2018-06-22 11:31:36,315 INFO ]: Checked inductivity of 1002 backedges. 260 proven. 156 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-06-22 11:31:36,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:36,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 34 [2018-06-22 11:31:36,334 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:31:36,334 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:31:36,334 INFO ]: CoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:31:36,334 INFO ]: Start difference. First operand 84 states and 102 transitions. Second operand 34 states. [2018-06-22 11:31:36,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:36,899 INFO ]: Finished difference Result 87 states and 106 transitions. [2018-06-22 11:31:36,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:31:36,900 INFO ]: Start accepts. Automaton has 34 states. Word has length 169 [2018-06-22 11:31:36,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:36,900 INFO ]: With dead ends: 87 [2018-06-22 11:31:36,900 INFO ]: Without dead ends: 86 [2018-06-22 11:31:36,901 INFO ]: 0 DeclaredPredicates, 248 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=662, Invalid=2760, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:31:36,901 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:31:36,903 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-06-22 11:31:36,903 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:31:36,904 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2018-06-22 11:31:36,904 INFO ]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 169 [2018-06-22 11:31:36,904 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:36,904 INFO ]: Abstraction has 86 states and 104 transitions. [2018-06-22 11:31:36,904 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:31:36,904 INFO ]: Start isEmpty. Operand 86 states and 104 transitions. [2018-06-22 11:31:36,905 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 11:31:36,905 INFO ]: Found error trace [2018-06-22 11:31:36,905 INFO ]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:36,905 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:36,905 INFO ]: Analyzing trace with hash -191421669, now seen corresponding path program 37 times [2018-06-22 11:31:36,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:36,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:36,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:36,905 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:36,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:36,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:37,384 WARN ]: Spent 318.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-22 11:31:37,953 INFO ]: Checked inductivity of 1053 backedges. 12 proven. 442 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-06-22 11:31:37,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:37,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:37,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:38,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:38,022 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 11:31:38,871 INFO ]: Timeout while computing interpolants [2018-06-22 11:31:39,072 WARN ]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:39,072 WARN ]: Verification canceled [2018-06-22 11:31:39,176 WARN ]: Timeout [2018-06-22 11:31:39,177 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:31:39 BoogieIcfgContainer [2018-06-22 11:31:39,177 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:31:39,177 INFO ]: Toolchain (without parser) took 56516.70 ms. Allocated memory was 306.7 MB in the beginning and 832.6 MB in the end (delta: 525.9 MB). Free memory was 262.2 MB in the beginning and 803.3 MB in the end (delta: -541.0 MB). Peak memory consumption was 454.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:31:39,178 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:31:39,178 INFO ]: ChcToBoogie took 45.79 ms. Allocated memory is still 306.7 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:31:39,178 INFO ]: Boogie Preprocessor took 44.15 ms. Allocated memory is still 306.7 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:31:39,178 INFO ]: RCFGBuilder took 447.71 ms. Allocated memory is still 306.7 MB. Free memory was 258.3 MB in the beginning and 249.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:31:39,179 INFO ]: TraceAbstraction took 55969.50 ms. Allocated memory was 306.7 MB in the beginning and 832.6 MB in the end (delta: 525.9 MB). Free memory was 249.3 MB in the beginning and 803.3 MB in the end (delta: -554.0 MB). Peak memory consumption was 441.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:31:39,181 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 45.79 ms. Allocated memory is still 306.7 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.15 ms. Allocated memory is still 306.7 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 447.71 ms. Allocated memory is still 306.7 MB. Free memory was 258.3 MB in the beginning and 249.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55969.50 ms. Allocated memory was 306.7 MB in the beginning and 832.6 MB in the end (delta: 525.9 MB). Free memory was 249.3 MB in the beginning and 803.3 MB in the end (delta: -554.0 MB). Peak memory consumption was 441.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 43 OverallIterations, 14 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1771 SDtfs, 685 SDslu, 25140 SDs, 0 SdLazy, 16474 SolverSat, 1204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5304 GetRequests, 3689 SyntacticMatches, 177 SemanticMatches, 1438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9958 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=40, 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, 42 MinimizatonAttempts, 107 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 7243 NumberOfCodeBlocks, 7243 NumberOfCodeBlocksAsserted, 223 NumberOfCheckSat, 7164 ConstructedInterpolants, 0 QuantifiedInterpolants, 2935032 SizeOfPredicates, 760 NumberOfNonLiveVariables, 13407 ConjunctsInSsa, 2001 ConjunctsInUnsatCore, 79 InterpolantComputations, 6 PerfectInterpolantSequences, 19544/26910 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/enc-zipmap.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-31-39-193.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zipmap.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-31-39-193.csv Completed graceful shutdown