java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:49:51,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:49:51,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:49:51,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:49:51,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:49:51,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:49:51,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:49:51,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:49:51,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:49:51,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:49:51,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:49:51,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:49:51,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:49:51,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:49:51,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:49:51,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:49:51,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:49:51,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:49:51,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:49:51,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:49:51,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:49:51,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:49:51,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:49:51,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:49:51,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:49:51,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:49:51,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:49:51,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:49:51,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:49:51,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:49:51,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:49:51,475 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:49:51,475 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:49:51,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:49:51,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:49:51,477 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 10:49:51,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:49:51,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:49:51,499 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:49:51,499 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:49:51,500 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:49:51,500 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:49:51,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:49:51,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:49:51,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:49:51,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:49:51,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:49:51,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:49:51,502 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:49:51,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:49:51,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:49:51,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:49:51,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:49:51,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:49:51,506 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:49:51,507 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:49:51,507 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:49:51,550 INFO ]: Repository-Root is: /tmp [2018-06-22 10:49:51,566 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:49:51,571 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:49:51,572 INFO ]: Initializing SmtParser... [2018-06-22 10:49:51,573 INFO ]: SmtParser initialized [2018-06-22 10:49:51,573 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 [2018-06-22 10:49:51,574 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 10:49:51,667 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 unknown [2018-06-22 10:49:52,227 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 [2018-06-22 10:49:52,232 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:49:52,237 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:49:52,237 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:49:52,237 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:49:52,237 INFO ]: ChcToBoogie initialized [2018-06-22 10:49:52,240 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,300 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52 Unit [2018-06-22 10:49:52,300 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:49:52,301 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:49:52,301 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:49:52,301 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:49:52,322 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,323 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,335 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,335 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,348 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,357 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,359 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... [2018-06-22 10:49:52,362 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:49:52,363 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:49:52,363 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:49:52,363 INFO ]: RCFGBuilder initialized [2018-06-22 10:49:52,363 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:49:52,374 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:49:52,374 INFO ]: Found specification of procedure False [2018-06-22 10:49:52,374 INFO ]: Found implementation of procedure False [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h28 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h28 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h27 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h27 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h18 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h18 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h17 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h17 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h16 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h16 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h13 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h13 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h12 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h12 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h11 [2018-06-22 10:49:52,375 INFO ]: Found implementation of procedure h11 [2018-06-22 10:49:52,375 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:49:52,375 INFO ]: Found specification of procedure h10 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h10 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h7 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h7 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h6 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h6 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h3 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h3 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h2 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h2 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h1 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h1 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h26 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h26 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h25 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h25 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h24 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h24 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h20 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h20 [2018-06-22 10:49:52,376 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:49:52,376 INFO ]: Found specification of procedure h19 [2018-06-22 10:49:52,376 INFO ]: Found implementation of procedure h19 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h15 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h15 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h14 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h14 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h22 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h22 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h21 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h21 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h23 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h23 [2018-06-22 10:49:52,377 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:49:52,377 INFO ]: Found specification of procedure h31 [2018-06-22 10:49:52,377 INFO ]: Found implementation of procedure h31 [2018-06-22 10:49:52,378 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:49:52,378 INFO ]: Found specification of procedure h30 [2018-06-22 10:49:52,378 INFO ]: Found implementation of procedure h30 [2018-06-22 10:49:52,378 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:49:52,378 INFO ]: Found specification of procedure h29 [2018-06-22 10:49:52,378 INFO ]: Found implementation of procedure h29 [2018-06-22 10:49:52,378 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:49:52,378 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:49:52,378 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:49:52,975 INFO ]: Using library mode [2018-06-22 10:49:52,975 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:49:52 BoogieIcfgContainer [2018-06-22 10:49:52,975 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:49:52,977 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:49:52,977 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:49:52,980 INFO ]: TraceAbstraction initialized [2018-06-22 10:49:52,980 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:49:52" (1/3) ... [2018-06-22 10:49:52,981 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0c504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:49:52, skipping insertion in model container [2018-06-22 10:49:52,981 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:49:52" (2/3) ... [2018-06-22 10:49:52,981 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0c504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:49:52, skipping insertion in model container [2018-06-22 10:49:52,981 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:49:52" (3/3) ... [2018-06-22 10:49:52,983 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:49:52,993 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:49:53,001 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:49:53,037 INFO ]: Using default assertion order modulation [2018-06-22 10:49:53,037 INFO ]: Interprodecural is true [2018-06-22 10:49:53,037 INFO ]: Hoare is false [2018-06-22 10:49:53,037 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:49:53,037 INFO ]: Backedges is TWOTRACK [2018-06-22 10:49:53,037 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:49:53,037 INFO ]: Difference is false [2018-06-22 10:49:53,037 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:49:53,037 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:49:53,055 INFO ]: Start isEmpty. Operand 120 states. [2018-06-22 10:49:53,072 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:49:53,072 INFO ]: Found error trace [2018-06-22 10:49:53,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:49:53,073 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:49:53,078 INFO ]: Analyzing trace with hash -487071103, now seen corresponding path program 1 times [2018-06-22 10:49:53,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:49:53,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:49:53,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:53,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:49:53,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:53,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:49:54,632 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:49:54,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:49:54,635 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:49:54,637 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:49:54,653 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:49:54,654 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:49:54,658 INFO ]: Start difference. First operand 120 states. Second operand 16 states. [2018-06-22 10:49:55,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:49:55,141 INFO ]: Finished difference Result 130 states and 138 transitions. [2018-06-22 10:49:55,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:49:55,143 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 10:49:55,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:49:55,157 INFO ]: With dead ends: 130 [2018-06-22 10:49:55,157 INFO ]: Without dead ends: 130 [2018-06-22 10:49:55,158 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:49:55,174 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 10:49:55,206 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-06-22 10:49:55,208 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 10:49:55,211 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-06-22 10:49:55,212 INFO ]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 61 [2018-06-22 10:49:55,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:49:55,212 INFO ]: Abstraction has 130 states and 138 transitions. [2018-06-22 10:49:55,212 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:49:55,212 INFO ]: Start isEmpty. Operand 130 states and 138 transitions. [2018-06-22 10:49:55,216 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:49:55,216 INFO ]: Found error trace [2018-06-22 10:49:55,216 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:49:55,216 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:49:55,216 INFO ]: Analyzing trace with hash -848527040, now seen corresponding path program 1 times [2018-06-22 10:49:55,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:49:55,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:49:55,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:55,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:49:55,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:55,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:49:55,789 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:49:55,789 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:49:55,789 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:49:55,791 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:49:55,791 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:49:55,791 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:49:55,791 INFO ]: Start difference. First operand 130 states and 138 transitions. Second operand 18 states. [2018-06-22 10:49:56,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:49:56,260 INFO ]: Finished difference Result 134 states and 141 transitions. [2018-06-22 10:49:56,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:49:56,260 INFO ]: Start accepts. Automaton has 18 states. Word has length 69 [2018-06-22 10:49:56,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:49:56,263 INFO ]: With dead ends: 134 [2018-06-22 10:49:56,263 INFO ]: Without dead ends: 122 [2018-06-22 10:49:56,264 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:49:56,265 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 10:49:56,278 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-06-22 10:49:56,278 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 10:49:56,280 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-06-22 10:49:56,280 INFO ]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 69 [2018-06-22 10:49:56,281 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:49:56,281 INFO ]: Abstraction has 122 states and 129 transitions. [2018-06-22 10:49:56,281 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:49:56,281 INFO ]: Start isEmpty. Operand 122 states and 129 transitions. [2018-06-22 10:49:56,285 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:49:56,285 INFO ]: Found error trace [2018-06-22 10:49:56,285 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:49:56,285 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:49:56,285 INFO ]: Analyzing trace with hash -1679984371, now seen corresponding path program 1 times [2018-06-22 10:49:56,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:49:56,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:49:56,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:56,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:49:56,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:56,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:49:56,797 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:49:56,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:49:56,798 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:49:56,798 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:49:56,798 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:49:56,799 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:49:56,799 INFO ]: Start difference. First operand 122 states and 129 transitions. Second operand 26 states. [2018-06-22 10:49:57,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:49:57,551 INFO ]: Finished difference Result 148 states and 158 transitions. [2018-06-22 10:49:57,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:49:57,551 INFO ]: Start accepts. Automaton has 26 states. Word has length 97 [2018-06-22 10:49:57,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:49:57,554 INFO ]: With dead ends: 148 [2018-06-22 10:49:57,554 INFO ]: Without dead ends: 148 [2018-06-22 10:49:57,554 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:49:57,555 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 10:49:57,571 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-06-22 10:49:57,571 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:49:57,573 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-06-22 10:49:57,573 INFO ]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 97 [2018-06-22 10:49:57,574 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:49:57,574 INFO ]: Abstraction has 148 states and 158 transitions. [2018-06-22 10:49:57,574 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:49:57,574 INFO ]: Start isEmpty. Operand 148 states and 158 transitions. [2018-06-22 10:49:57,577 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:49:57,577 INFO ]: Found error trace [2018-06-22 10:49:57,577 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:49:57,577 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:49:57,577 INFO ]: Analyzing trace with hash 1923604431, now seen corresponding path program 1 times [2018-06-22 10:49:57,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:49:57,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:49:57,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:57,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:49:57,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:49:57,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:49:58,136 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:49:58,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:49:58,136 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 10:49:58,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:49:58,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:49:58,247 INFO ]: Computing forward predicates... [2018-06-22 10:49:59,276 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:49:59,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:49:59,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2018-06-22 10:49:59,307 INFO ]: Interpolant automaton has 47 states [2018-06-22 10:49:59,307 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 10:49:59,308 INFO ]: CoverageRelationStatistics Valid=107, Invalid=2055, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:49:59,308 INFO ]: Start difference. First operand 148 states and 158 transitions. Second operand 47 states. [2018-06-22 10:50:00,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:00,825 INFO ]: Finished difference Result 174 states and 187 transitions. [2018-06-22 10:50:00,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:50:00,826 INFO ]: Start accepts. Automaton has 47 states. Word has length 97 [2018-06-22 10:50:00,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:00,829 INFO ]: With dead ends: 174 [2018-06-22 10:50:00,829 INFO ]: Without dead ends: 174 [2018-06-22 10:50:00,830 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=2825, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 10:50:00,831 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 10:50:00,846 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 166. [2018-06-22 10:50:00,846 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-22 10:50:00,848 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-06-22 10:50:00,848 INFO ]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 97 [2018-06-22 10:50:00,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:00,848 INFO ]: Abstraction has 166 states and 179 transitions. [2018-06-22 10:50:00,848 INFO ]: Interpolant automaton has 47 states. [2018-06-22 10:50:00,848 INFO ]: Start isEmpty. Operand 166 states and 179 transitions. [2018-06-22 10:50:00,851 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:50:00,851 INFO ]: Found error trace [2018-06-22 10:50:00,851 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:00,851 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:00,851 INFO ]: Analyzing trace with hash 968721328, now seen corresponding path program 1 times [2018-06-22 10:50:00,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:00,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:00,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:00,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:00,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:00,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:01,247 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:01,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:01,247 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:50:01,247 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:50:01,247 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:50:01,248 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:50:01,248 INFO ]: Start difference. First operand 166 states and 179 transitions. Second operand 26 states. [2018-06-22 10:50:01,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:01,826 INFO ]: Finished difference Result 192 states and 208 transitions. [2018-06-22 10:50:01,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:50:01,826 INFO ]: Start accepts. Automaton has 26 states. Word has length 97 [2018-06-22 10:50:01,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:01,829 INFO ]: With dead ends: 192 [2018-06-22 10:50:01,829 INFO ]: Without dead ends: 192 [2018-06-22 10:50:01,829 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:50:01,830 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-22 10:50:01,847 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-06-22 10:50:01,847 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-22 10:50:01,849 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2018-06-22 10:50:01,849 INFO ]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 97 [2018-06-22 10:50:01,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:01,849 INFO ]: Abstraction has 184 states and 200 transitions. [2018-06-22 10:50:01,849 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:50:01,849 INFO ]: Start isEmpty. Operand 184 states and 200 transitions. [2018-06-22 10:50:01,851 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:50:01,851 INFO ]: Found error trace [2018-06-22 10:50:01,851 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:01,851 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:01,852 INFO ]: Analyzing trace with hash -1781066513, now seen corresponding path program 1 times [2018-06-22 10:50:01,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:01,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:01,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:01,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:01,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:01,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:02,273 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:02,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:02,273 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 10:50:02,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:02,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:02,374 INFO ]: Computing forward predicates... [2018-06-22 10:50:03,266 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:03,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:03,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 51 [2018-06-22 10:50:03,285 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:50:03,286 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:50:03,286 INFO ]: CoverageRelationStatistics Valid=117, Invalid=2433, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:50:03,286 INFO ]: Start difference. First operand 184 states and 200 transitions. Second operand 51 states. [2018-06-22 10:50:04,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:04,100 INFO ]: Finished difference Result 206 states and 222 transitions. [2018-06-22 10:50:04,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:50:04,101 INFO ]: Start accepts. Automaton has 51 states. Word has length 105 [2018-06-22 10:50:04,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:04,103 INFO ]: With dead ends: 206 [2018-06-22 10:50:04,103 INFO ]: Without dead ends: 194 [2018-06-22 10:50:04,105 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=3267, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:50:04,107 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-22 10:50:04,131 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-06-22 10:50:04,131 INFO ]: Start removeUnreachable. Operand 194 states. [2018-06-22 10:50:04,133 INFO ]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-06-22 10:50:04,133 INFO ]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 105 [2018-06-22 10:50:04,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:04,134 INFO ]: Abstraction has 194 states and 210 transitions. [2018-06-22 10:50:04,134 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:50:04,134 INFO ]: Start isEmpty. Operand 194 states and 210 transitions. [2018-06-22 10:50:04,136 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:50:04,136 INFO ]: Found error trace [2018-06-22 10:50:04,136 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:04,136 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:04,136 INFO ]: Analyzing trace with hash 1376981964, now seen corresponding path program 1 times [2018-06-22 10:50:04,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:04,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:04,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:04,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:04,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:04,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:05,179 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:05,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:05,179 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 10:50:05,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:05,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:05,261 INFO ]: Computing forward predicates... [2018-06-22 10:50:06,178 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:06,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:06,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 51 [2018-06-22 10:50:06,204 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:50:06,204 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:50:06,205 INFO ]: CoverageRelationStatistics Valid=117, Invalid=2433, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:50:06,205 INFO ]: Start difference. First operand 194 states and 210 transitions. Second operand 51 states. [2018-06-22 10:50:07,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:07,070 INFO ]: Finished difference Result 216 states and 232 transitions. [2018-06-22 10:50:07,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:50:07,072 INFO ]: Start accepts. Automaton has 51 states. Word has length 105 [2018-06-22 10:50:07,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:07,074 INFO ]: With dead ends: 216 [2018-06-22 10:50:07,074 INFO ]: Without dead ends: 204 [2018-06-22 10:50:07,075 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=3267, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:50:07,075 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-22 10:50:07,087 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-06-22 10:50:07,087 INFO ]: Start removeUnreachable. Operand 204 states. [2018-06-22 10:50:07,089 INFO ]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2018-06-22 10:50:07,089 INFO ]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 105 [2018-06-22 10:50:07,089 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:07,089 INFO ]: Abstraction has 204 states and 220 transitions. [2018-06-22 10:50:07,089 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:50:07,089 INFO ]: Start isEmpty. Operand 204 states and 220 transitions. [2018-06-22 10:50:07,091 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:50:07,091 INFO ]: Found error trace [2018-06-22 10:50:07,092 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:07,092 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:07,092 INFO ]: Analyzing trace with hash 1541949838, now seen corresponding path program 1 times [2018-06-22 10:50:07,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:07,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:07,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:07,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:07,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:07,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:07,455 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:07,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:07,455 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 10:50:07,455 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:50:07,455 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:50:07,456 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:50:07,456 INFO ]: Start difference. First operand 204 states and 220 transitions. Second operand 28 states. [2018-06-22 10:50:08,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:08,135 INFO ]: Finished difference Result 242 states and 261 transitions. [2018-06-22 10:50:08,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:50:08,135 INFO ]: Start accepts. Automaton has 28 states. Word has length 105 [2018-06-22 10:50:08,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:08,136 INFO ]: With dead ends: 242 [2018-06-22 10:50:08,136 INFO ]: Without dead ends: 230 [2018-06-22 10:50:08,136 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:50:08,137 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 10:50:08,160 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-06-22 10:50:08,160 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 10:50:08,161 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 248 transitions. [2018-06-22 10:50:08,161 INFO ]: Start accepts. Automaton has 230 states and 248 transitions. Word has length 105 [2018-06-22 10:50:08,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:08,164 INFO ]: Abstraction has 230 states and 248 transitions. [2018-06-22 10:50:08,164 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:50:08,165 INFO ]: Start isEmpty. Operand 230 states and 248 transitions. [2018-06-22 10:50:08,167 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:08,167 INFO ]: Found error trace [2018-06-22 10:50:08,167 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:08,167 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:08,167 INFO ]: Analyzing trace with hash 1871730684, now seen corresponding path program 1 times [2018-06-22 10:50:08,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:08,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:08,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:08,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:08,485 INFO ]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 10:50:08,485 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:08,485 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:08,486 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:08,486 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:08,486 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:08,486 INFO ]: Start difference. First operand 230 states and 248 transitions. Second operand 12 states. [2018-06-22 10:50:08,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:08,617 INFO ]: Finished difference Result 298 states and 341 transitions. [2018-06-22 10:50:08,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:08,620 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:50:08,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:08,623 INFO ]: With dead ends: 298 [2018-06-22 10:50:08,623 INFO ]: Without dead ends: 297 [2018-06-22 10:50:08,623 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:08,628 INFO ]: Start minimizeSevpa. Operand 297 states. [2018-06-22 10:50:08,645 INFO ]: Finished minimizeSevpa. Reduced states from 297 to 289. [2018-06-22 10:50:08,645 INFO ]: Start removeUnreachable. Operand 289 states. [2018-06-22 10:50:08,647 INFO ]: Finished removeUnreachable. Reduced from 289 states to 289 states and 328 transitions. [2018-06-22 10:50:08,647 INFO ]: Start accepts. Automaton has 289 states and 328 transitions. Word has length 133 [2018-06-22 10:50:08,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:08,648 INFO ]: Abstraction has 289 states and 328 transitions. [2018-06-22 10:50:08,648 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:08,648 INFO ]: Start isEmpty. Operand 289 states and 328 transitions. [2018-06-22 10:50:08,650 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:08,650 INFO ]: Found error trace [2018-06-22 10:50:08,651 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:08,651 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:08,651 INFO ]: Analyzing trace with hash -697949506, now seen corresponding path program 1 times [2018-06-22 10:50:08,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:08,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:08,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:08,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:08,819 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:50:08,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:08,819 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:08,819 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:08,819 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:08,819 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:08,819 INFO ]: Start difference. First operand 289 states and 328 transitions. Second operand 12 states. [2018-06-22 10:50:08,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:08,939 INFO ]: Finished difference Result 291 states and 331 transitions. [2018-06-22 10:50:08,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:08,943 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:50:08,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:08,945 INFO ]: With dead ends: 291 [2018-06-22 10:50:08,946 INFO ]: Without dead ends: 291 [2018-06-22 10:50:08,946 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:08,946 INFO ]: Start minimizeSevpa. Operand 291 states. [2018-06-22 10:50:08,962 INFO ]: Finished minimizeSevpa. Reduced states from 291 to 282. [2018-06-22 10:50:08,963 INFO ]: Start removeUnreachable. Operand 282 states. [2018-06-22 10:50:08,965 INFO ]: Finished removeUnreachable. Reduced from 282 states to 282 states and 309 transitions. [2018-06-22 10:50:08,965 INFO ]: Start accepts. Automaton has 282 states and 309 transitions. Word has length 133 [2018-06-22 10:50:08,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:08,965 INFO ]: Abstraction has 282 states and 309 transitions. [2018-06-22 10:50:08,965 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:08,965 INFO ]: Start isEmpty. Operand 282 states and 309 transitions. [2018-06-22 10:50:08,967 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:08,967 INFO ]: Found error trace [2018-06-22 10:50:08,967 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:08,967 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:08,968 INFO ]: Analyzing trace with hash 1429756635, now seen corresponding path program 1 times [2018-06-22 10:50:08,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:08,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:08,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:08,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:08,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:09,082 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:50:09,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:09,101 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:09,101 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:09,101 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:09,101 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:09,102 INFO ]: Start difference. First operand 282 states and 309 transitions. Second operand 12 states. [2018-06-22 10:50:09,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:09,217 INFO ]: Finished difference Result 346 states and 395 transitions. [2018-06-22 10:50:09,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:09,218 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:50:09,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:09,220 INFO ]: With dead ends: 346 [2018-06-22 10:50:09,220 INFO ]: Without dead ends: 329 [2018-06-22 10:50:09,220 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:09,221 INFO ]: Start minimizeSevpa. Operand 329 states. [2018-06-22 10:50:09,239 INFO ]: Finished minimizeSevpa. Reduced states from 329 to 314. [2018-06-22 10:50:09,239 INFO ]: Start removeUnreachable. Operand 314 states. [2018-06-22 10:50:09,242 INFO ]: Finished removeUnreachable. Reduced from 314 states to 314 states and 349 transitions. [2018-06-22 10:50:09,242 INFO ]: Start accepts. Automaton has 314 states and 349 transitions. Word has length 133 [2018-06-22 10:50:09,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:09,243 INFO ]: Abstraction has 314 states and 349 transitions. [2018-06-22 10:50:09,243 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:09,243 INFO ]: Start isEmpty. Operand 314 states and 349 transitions. [2018-06-22 10:50:09,249 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:09,249 INFO ]: Found error trace [2018-06-22 10:50:09,249 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:09,249 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:09,250 INFO ]: Analyzing trace with hash 616401499, now seen corresponding path program 2 times [2018-06-22 10:50:09,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:09,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:09,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:09,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:09,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:09,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:09,434 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:50:09,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:09,434 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:09,434 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:09,434 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:09,434 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:09,434 INFO ]: Start difference. First operand 314 states and 349 transitions. Second operand 12 states. [2018-06-22 10:50:09,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:09,582 INFO ]: Finished difference Result 345 states and 384 transitions. [2018-06-22 10:50:09,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:09,585 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:50:09,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:09,587 INFO ]: With dead ends: 345 [2018-06-22 10:50:09,587 INFO ]: Without dead ends: 306 [2018-06-22 10:50:09,587 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:09,588 INFO ]: Start minimizeSevpa. Operand 306 states. [2018-06-22 10:50:09,602 INFO ]: Finished minimizeSevpa. Reduced states from 306 to 295. [2018-06-22 10:50:09,602 INFO ]: Start removeUnreachable. Operand 295 states. [2018-06-22 10:50:09,604 INFO ]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2018-06-22 10:50:09,604 INFO ]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 133 [2018-06-22 10:50:09,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:09,604 INFO ]: Abstraction has 295 states and 325 transitions. [2018-06-22 10:50:09,604 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:09,604 INFO ]: Start isEmpty. Operand 295 states and 325 transitions. [2018-06-22 10:50:09,606 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:09,606 INFO ]: Found error trace [2018-06-22 10:50:09,606 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:09,606 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:09,607 INFO ]: Analyzing trace with hash 1085087614, now seen corresponding path program 2 times [2018-06-22 10:50:09,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:09,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:09,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:09,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:09,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:09,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:09,833 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:50:10,249 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:50:10,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:10,249 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:10,250 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:10,250 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:10,250 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:10,250 INFO ]: Start difference. First operand 295 states and 325 transitions. Second operand 12 states. [2018-06-22 10:50:10,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:10,406 INFO ]: Finished difference Result 280 states and 305 transitions. [2018-06-22 10:50:10,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:10,406 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:50:10,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:10,408 INFO ]: With dead ends: 280 [2018-06-22 10:50:10,408 INFO ]: Without dead ends: 265 [2018-06-22 10:50:10,408 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:10,408 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-22 10:50:10,421 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-06-22 10:50:10,421 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-22 10:50:10,422 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 286 transitions. [2018-06-22 10:50:10,422 INFO ]: Start accepts. Automaton has 264 states and 286 transitions. Word has length 133 [2018-06-22 10:50:10,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:10,423 INFO ]: Abstraction has 264 states and 286 transitions. [2018-06-22 10:50:10,423 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:10,423 INFO ]: Start isEmpty. Operand 264 states and 286 transitions. [2018-06-22 10:50:10,424 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:50:10,424 INFO ]: Found error trace [2018-06-22 10:50:10,424 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:10,424 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:10,425 INFO ]: Analyzing trace with hash -1953278691, now seen corresponding path program 2 times [2018-06-22 10:50:10,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:10,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:10,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:10,425 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:10,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:10,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:11,168 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:50:11,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:11,168 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:50:11,177 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:11,284 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:11,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:11,304 INFO ]: Computing forward predicates... [2018-06-22 10:50:12,424 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:50:12,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:12,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 62 [2018-06-22 10:50:12,445 INFO ]: Interpolant automaton has 62 states [2018-06-22 10:50:12,445 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 10:50:12,446 INFO ]: CoverageRelationStatistics Valid=149, Invalid=3633, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:50:12,446 INFO ]: Start difference. First operand 264 states and 286 transitions. Second operand 62 states. [2018-06-22 10:50:14,181 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 10:50:15,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:15,395 INFO ]: Finished difference Result 288 states and 313 transitions. [2018-06-22 10:50:15,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 10:50:15,395 INFO ]: Start accepts. Automaton has 62 states. Word has length 133 [2018-06-22 10:50:15,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:15,396 INFO ]: With dead ends: 288 [2018-06-22 10:50:15,396 INFO ]: Without dead ends: 189 [2018-06-22 10:50:15,398 INFO ]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=302, Invalid=7530, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 10:50:15,399 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-22 10:50:15,406 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-06-22 10:50:15,406 INFO ]: Start removeUnreachable. Operand 189 states. [2018-06-22 10:50:15,407 INFO ]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-06-22 10:50:15,407 INFO ]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 133 [2018-06-22 10:50:15,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:15,407 INFO ]: Abstraction has 189 states and 202 transitions. [2018-06-22 10:50:15,407 INFO ]: Interpolant automaton has 62 states. [2018-06-22 10:50:15,407 INFO ]: Start isEmpty. Operand 189 states and 202 transitions. [2018-06-22 10:50:15,409 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:50:15,409 INFO ]: Found error trace [2018-06-22 10:50:15,409 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:15,409 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:15,409 INFO ]: Analyzing trace with hash 867651806, now seen corresponding path program 2 times [2018-06-22 10:50:15,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:15,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:15,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:15,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:15,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:15,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:16,649 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:50:16,649 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:16,649 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 10:50:16,655 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:16,775 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:16,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:16,793 INFO ]: Computing forward predicates... [2018-06-22 10:50:18,343 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:50:18,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:18,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 66 [2018-06-22 10:50:18,364 INFO ]: Interpolant automaton has 66 states [2018-06-22 10:50:18,364 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-22 10:50:18,365 INFO ]: CoverageRelationStatistics Valid=159, Invalid=4131, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 10:50:18,365 INFO ]: Start difference. First operand 189 states and 202 transitions. Second operand 66 states. [2018-06-22 10:50:19,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:19,636 INFO ]: Finished difference Result 231 states and 247 transitions. [2018-06-22 10:50:19,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:50:19,636 INFO ]: Start accepts. Automaton has 66 states. Word has length 141 [2018-06-22 10:50:19,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:19,637 INFO ]: With dead ends: 231 [2018-06-22 10:50:19,637 INFO ]: Without dead ends: 129 [2018-06-22 10:50:19,639 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=8244, Unknown=0, NotChecked=0, Total=8556 [2018-06-22 10:50:19,639 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-22 10:50:19,647 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-06-22 10:50:19,647 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-22 10:50:19,647 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2018-06-22 10:50:19,647 INFO ]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 141 [2018-06-22 10:50:19,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:19,648 INFO ]: Abstraction has 129 states and 134 transitions. [2018-06-22 10:50:19,648 INFO ]: Interpolant automaton has 66 states. [2018-06-22 10:50:19,648 INFO ]: Start isEmpty. Operand 129 states and 134 transitions. [2018-06-22 10:50:19,649 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:50:19,649 INFO ]: Found error trace [2018-06-22 10:50:19,649 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:50:19,649 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:19,649 INFO ]: Analyzing trace with hash 1312548568, now seen corresponding path program 2 times [2018-06-22 10:50:19,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:19,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:19,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:19,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:19,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:19,669 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:20,254 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:50:20,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:20,254 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 10:50:20,260 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:20,352 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:20,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:20,358 INFO ]: Computing forward predicates... [2018-06-22 10:50:21,409 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:50:21,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:21,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 66 [2018-06-22 10:50:21,429 INFO ]: Interpolant automaton has 66 states [2018-06-22 10:50:21,429 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-22 10:50:21,430 INFO ]: CoverageRelationStatistics Valid=159, Invalid=4131, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 10:50:21,430 INFO ]: Start difference. First operand 129 states and 134 transitions. Second operand 66 states. [2018-06-22 10:50:22,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:22,621 INFO ]: Finished difference Result 153 states and 162 transitions. [2018-06-22 10:50:22,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:50:22,621 INFO ]: Start accepts. Automaton has 66 states. Word has length 141 [2018-06-22 10:50:22,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:22,622 INFO ]: With dead ends: 153 [2018-06-22 10:50:22,622 INFO ]: Without dead ends: 0 [2018-06-22 10:50:22,624 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=312, Invalid=8244, Unknown=0, NotChecked=0, Total=8556 [2018-06-22 10:50:22,624 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:50:22,624 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:50:22,624 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:50:22,624 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:50:22,624 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2018-06-22 10:50:22,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:22,624 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:50:22,624 INFO ]: Interpolant automaton has 66 states. [2018-06-22 10:50:22,624 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:50:22,624 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:50:22,630 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:50:22 BoogieIcfgContainer [2018-06-22 10:50:22,630 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:50:22,631 INFO ]: Toolchain (without parser) took 30399.02 ms. Allocated memory was 303.0 MB in the beginning and 672.1 MB in the end (delta: 369.1 MB). Free memory was 241.6 MB in the beginning and 241.9 MB in the end (delta: -256.2 kB). Peak memory consumption was 368.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:50:22,632 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:50:22,632 INFO ]: ChcToBoogie took 63.25 ms. Allocated memory is still 303.0 MB. Free memory was 241.6 MB in the beginning and 239.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:50:22,632 INFO ]: Boogie Preprocessor took 61.50 ms. Allocated memory is still 303.0 MB. Free memory was 239.6 MB in the beginning and 237.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:50:22,632 INFO ]: RCFGBuilder took 612.76 ms. Allocated memory is still 303.0 MB. Free memory was 237.6 MB in the beginning and 213.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:50:22,633 INFO ]: TraceAbstraction took 29653.65 ms. Allocated memory was 303.0 MB in the beginning and 672.1 MB in the end (delta: 369.1 MB). Free memory was 213.7 MB in the beginning and 241.9 MB in the end (delta: -28.2 MB). Peak memory consumption was 340.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:50:22,639 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 303.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.25 ms. Allocated memory is still 303.0 MB. Free memory was 241.6 MB in the beginning and 239.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.50 ms. Allocated memory is still 303.0 MB. Free memory was 239.6 MB in the beginning and 237.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 612.76 ms. Allocated memory is still 303.0 MB. Free memory was 237.6 MB in the beginning and 213.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 29653.65 ms. Allocated memory was 303.0 MB in the beginning and 672.1 MB in the end (delta: 369.1 MB). Free memory was 213.7 MB in the beginning and 241.9 MB in the end (delta: -28.2 MB). Peak memory consumption was 340.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 120 locations, 1 error locations. SAFE Result, 29.5s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1916 SDtfs, 122 SDslu, 45013 SDs, 0 SdLazy, 11679 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1205 GetRequests, 605 SyntacticMatches, 4 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5340 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=11, 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, 16 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 2538 NumberOfCodeBlocks, 2538 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2516 ConstructedInterpolants, 0 QuantifiedInterpolants, 796476 SizeOfPredicates, 30 NumberOfNonLiveVariables, 4466 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 398/572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/14.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-50-22-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/14.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-50-22-656.csv Received shutdown request...