java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:09:07,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:09:07,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:09:07,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:09:07,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:09:07,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:09:07,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:09:07,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:09:07,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:09:07,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:09:07,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:09:07,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:09:07,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:09:07,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:09:07,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:09:07,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:09:07,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:09:07,097 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:09:07,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:09:07,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:09:07,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:09:07,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:09:07,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:09:07,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:09:07,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:09:07,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:09:07,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:09:07,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:09:07,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:09:07,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:09:07,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:09:07,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:09:07,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:09:07,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:09:07,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:09:07,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:09:07,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:09:07,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:09:07,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:09:07,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:09:07,142 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:09:07,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:09:07,143 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:09:07,143 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:09:07,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:09:07,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:09:07,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:09:07,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:09:07,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:09:07,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:09:07,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:09:07,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:09:07,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:09:07,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:09:07,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:09:07,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:09:07,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:09:07,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:09:07,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:09:07,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:09:07,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:09:07,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:09:07,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:09:07,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:09:07,150 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:09:07,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:09:07,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:09:07,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:09:07,235 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:09:07,235 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:09:07,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c [2018-10-26 21:09:07,304 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b2234b39/587b183103f74efda51d25f47614b90c/FLAG36b0b5026 [2018-10-26 21:09:07,987 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:09:07,988 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c [2018-10-26 21:09:08,019 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b2234b39/587b183103f74efda51d25f47614b90c/FLAG36b0b5026 [2018-10-26 21:09:08,043 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b2234b39/587b183103f74efda51d25f47614b90c [2018-10-26 21:09:08,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:09:08,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:09:08,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:09:08,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:09:08,065 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:09:08,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:09:08" (1/1) ... [2018-10-26 21:09:08,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52735c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:08, skipping insertion in model container [2018-10-26 21:09:08,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:09:08" (1/1) ... [2018-10-26 21:09:08,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:09:08,166 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:09:08,792 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:09:08,797 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:09:09,008 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:09:09,028 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:09:09,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09 WrapperNode [2018-10-26 21:09:09,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:09:09,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:09:09,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:09:09,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:09:09,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:09:09,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:09:09,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:09:09,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:09:09,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:09:09,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:09:09,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:09:09,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:09:09,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:09:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:09:14,535 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:09:14,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:09:14 BoogieIcfgContainer [2018-10-26 21:09:14,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:09:14,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:09:14,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:09:14,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:09:14,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:09:08" (1/3) ... [2018-10-26 21:09:14,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5de806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:09:14, skipping insertion in model container [2018-10-26 21:09:14,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09" (2/3) ... [2018-10-26 21:09:14,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5de806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:09:14, skipping insertion in model container [2018-10-26 21:09:14,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:09:14" (3/3) ... [2018-10-26 21:09:14,546 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label25_true-unreach-call.c [2018-10-26 21:09:14,556 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:09:14,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:09:14,593 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:09:14,642 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:09:14,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:09:14,644 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:09:14,644 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:09:14,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:09:14,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:09:14,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:09:14,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:09:14,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:09:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-26 21:09:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 21:09:14,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:14,681 INFO L375 BasicCegarLoop]: 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] [2018-10-26 21:09:14,683 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:14,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash 18549650, now seen corresponding path program 1 times [2018-10-26 21:09:14,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:14,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:14,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:14,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:15,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:15,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:15,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:15,247 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-26 21:09:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:18,540 INFO L93 Difference]: Finished difference Result 958 states and 1725 transitions. [2018-10-26 21:09:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-26 21:09:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:18,569 INFO L225 Difference]: With dead ends: 958 [2018-10-26 21:09:18,569 INFO L226 Difference]: Without dead ends: 667 [2018-10-26 21:09:18,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-26 21:09:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-10-26 21:09:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-10-26 21:09:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 983 transitions. [2018-10-26 21:09:18,674 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 983 transitions. Word has length 32 [2018-10-26 21:09:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:18,675 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 983 transitions. [2018-10-26 21:09:18,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 983 transitions. [2018-10-26 21:09:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 21:09:18,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:18,682 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 21:09:18,682 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:18,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash -63351988, now seen corresponding path program 1 times [2018-10-26 21:09:18,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:18,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:18,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:18,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:18,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:18,949 INFO L87 Difference]: Start difference. First operand 667 states and 983 transitions. Second operand 4 states. [2018-10-26 21:09:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:23,217 INFO L93 Difference]: Finished difference Result 2464 states and 3711 transitions. [2018-10-26 21:09:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:23,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-26 21:09:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:23,230 INFO L225 Difference]: With dead ends: 2464 [2018-10-26 21:09:23,230 INFO L226 Difference]: Without dead ends: 1799 [2018-10-26 21:09:23,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-10-26 21:09:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1596. [2018-10-26 21:09:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2018-10-26 21:09:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2267 transitions. [2018-10-26 21:09:23,305 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2267 transitions. Word has length 102 [2018-10-26 21:09:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:23,306 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 2267 transitions. [2018-10-26 21:09:23,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2267 transitions. [2018-10-26 21:09:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 21:09:23,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:23,325 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-10-26 21:09:23,325 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:23,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1347254132, now seen corresponding path program 1 times [2018-10-26 21:09:23,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:23,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:23,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:23,780 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 21:09:23,941 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-10-26 21:09:24,564 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-10-26 21:09:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:24,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:09:24,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:09:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:09:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:09:24,653 INFO L87 Difference]: Start difference. First operand 1596 states and 2267 transitions. Second operand 7 states. [2018-10-26 21:09:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:29,394 INFO L93 Difference]: Finished difference Result 5055 states and 7097 transitions. [2018-10-26 21:09:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:09:29,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-10-26 21:09:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:29,412 INFO L225 Difference]: With dead ends: 5055 [2018-10-26 21:09:29,413 INFO L226 Difference]: Without dead ends: 3461 [2018-10-26 21:09:29,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:09:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2018-10-26 21:09:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3454. [2018-10-26 21:09:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2018-10-26 21:09:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4561 transitions. [2018-10-26 21:09:29,484 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4561 transitions. Word has length 123 [2018-10-26 21:09:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:29,485 INFO L481 AbstractCegarLoop]: Abstraction has 3454 states and 4561 transitions. [2018-10-26 21:09:29,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:09:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4561 transitions. [2018-10-26 21:09:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 21:09:29,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:29,488 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 21:09:29,489 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:29,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash -127123909, now seen corresponding path program 1 times [2018-10-26 21:09:29,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:29,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:29,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:29,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:29,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:09:29,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:29,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:29,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:29,803 INFO L87 Difference]: Start difference. First operand 3454 states and 4561 transitions. Second operand 4 states. [2018-10-26 21:09:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:32,327 INFO L93 Difference]: Finished difference Result 8777 states and 11599 transitions. [2018-10-26 21:09:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:32,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-10-26 21:09:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:32,351 INFO L225 Difference]: With dead ends: 8777 [2018-10-26 21:09:32,351 INFO L226 Difference]: Without dead ends: 5325 [2018-10-26 21:09:32,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2018-10-26 21:09:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 5119. [2018-10-26 21:09:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2018-10-26 21:09:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6439 transitions. [2018-10-26 21:09:32,450 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6439 transitions. Word has length 192 [2018-10-26 21:09:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:32,451 INFO L481 AbstractCegarLoop]: Abstraction has 5119 states and 6439 transitions. [2018-10-26 21:09:32,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6439 transitions. [2018-10-26 21:09:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-26 21:09:32,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:32,459 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 21:09:32,459 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1806737612, now seen corresponding path program 1 times [2018-10-26 21:09:32,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-26 21:09:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:32,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:09:32,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:09:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:32,695 INFO L87 Difference]: Start difference. First operand 5119 states and 6439 transitions. Second operand 3 states. [2018-10-26 21:09:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:34,924 INFO L93 Difference]: Finished difference Result 11530 states and 14899 transitions. [2018-10-26 21:09:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:09:34,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-26 21:09:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:34,952 INFO L225 Difference]: With dead ends: 11530 [2018-10-26 21:09:34,953 INFO L226 Difference]: Without dead ends: 6413 [2018-10-26 21:09:34,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2018-10-26 21:09:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 6413. [2018-10-26 21:09:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2018-10-26 21:09:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 8049 transitions. [2018-10-26 21:09:35,087 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 8049 transitions. Word has length 248 [2018-10-26 21:09:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:35,088 INFO L481 AbstractCegarLoop]: Abstraction has 6413 states and 8049 transitions. [2018-10-26 21:09:35,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:09:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 8049 transitions. [2018-10-26 21:09:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-26 21:09:35,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:35,100 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 21:09:35,100 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:35,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash 639833405, now seen corresponding path program 1 times [2018-10-26 21:09:35,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:35,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:35,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:35,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:35,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:35,560 INFO L87 Difference]: Start difference. First operand 6413 states and 8049 transitions. Second operand 4 states. [2018-10-26 21:09:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:37,884 INFO L93 Difference]: Finished difference Result 14864 states and 18977 transitions. [2018-10-26 21:09:37,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:37,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-26 21:09:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:37,918 INFO L225 Difference]: With dead ends: 14864 [2018-10-26 21:09:37,919 INFO L226 Difference]: Without dead ends: 7510 [2018-10-26 21:09:37,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2018-10-26 21:09:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 7317. [2018-10-26 21:09:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7317 states. [2018-10-26 21:09:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7317 states to 7317 states and 8856 transitions. [2018-10-26 21:09:38,131 INFO L78 Accepts]: Start accepts. Automaton has 7317 states and 8856 transitions. Word has length 267 [2018-10-26 21:09:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:38,132 INFO L481 AbstractCegarLoop]: Abstraction has 7317 states and 8856 transitions. [2018-10-26 21:09:38,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7317 states and 8856 transitions. [2018-10-26 21:09:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-26 21:09:38,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:38,139 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2018-10-26 21:09:38,140 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:38,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1651260540, now seen corresponding path program 1 times [2018-10-26 21:09:38,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 21:09:38,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:38,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:38,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:09:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:09:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:38,701 INFO L87 Difference]: Start difference. First operand 7317 states and 8856 transitions. Second operand 5 states. [2018-10-26 21:09:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:42,028 INFO L93 Difference]: Finished difference Result 21508 states and 25910 transitions. [2018-10-26 21:09:42,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:09:42,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2018-10-26 21:09:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:42,069 INFO L225 Difference]: With dead ends: 21508 [2018-10-26 21:09:42,069 INFO L226 Difference]: Without dead ends: 13636 [2018-10-26 21:09:42,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2018-10-26 21:09:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 12512. [2018-10-26 21:09:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12512 states. [2018-10-26 21:09:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12512 states to 12512 states and 14880 transitions. [2018-10-26 21:09:42,249 INFO L78 Accepts]: Start accepts. Automaton has 12512 states and 14880 transitions. Word has length 273 [2018-10-26 21:09:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:42,250 INFO L481 AbstractCegarLoop]: Abstraction has 12512 states and 14880 transitions. [2018-10-26 21:09:42,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:09:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 12512 states and 14880 transitions. [2018-10-26 21:09:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-26 21:09:42,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:42,261 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2018-10-26 21:09:42,262 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:42,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2075523106, now seen corresponding path program 1 times [2018-10-26 21:09:42,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:42,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 21:09:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:42,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:42,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:09:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:09:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:42,518 INFO L87 Difference]: Start difference. First operand 12512 states and 14880 transitions. Second operand 3 states. [2018-10-26 21:09:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:45,309 INFO L93 Difference]: Finished difference Result 27428 states and 32691 transitions. [2018-10-26 21:09:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:09:45,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-26 21:09:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:45,335 INFO L225 Difference]: With dead ends: 27428 [2018-10-26 21:09:45,336 INFO L226 Difference]: Without dead ends: 13432 [2018-10-26 21:09:45,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2018-10-26 21:09:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12875. [2018-10-26 21:09:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12875 states. [2018-10-26 21:09:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 15067 transitions. [2018-10-26 21:09:45,617 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 15067 transitions. Word has length 317 [2018-10-26 21:09:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:45,618 INFO L481 AbstractCegarLoop]: Abstraction has 12875 states and 15067 transitions. [2018-10-26 21:09:45,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:09:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 15067 transitions. [2018-10-26 21:09:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-26 21:09:45,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:45,636 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2018-10-26 21:09:45,636 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash 386797, now seen corresponding path program 1 times [2018-10-26 21:09:45,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:46,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:46,664 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:09:46,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:46,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 59 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:47,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:09:47,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 21:09:47,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:09:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:09:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:09:47,637 INFO L87 Difference]: Start difference. First operand 12875 states and 15067 transitions. Second operand 9 states. [2018-10-26 21:09:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:55,093 INFO L93 Difference]: Finished difference Result 32827 states and 38477 transitions. [2018-10-26 21:09:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:09:55,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 332 [2018-10-26 21:09:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:55,143 INFO L225 Difference]: With dead ends: 32827 [2018-10-26 21:09:55,143 INFO L226 Difference]: Without dead ends: 21625 [2018-10-26 21:09:55,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:09:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21625 states. [2018-10-26 21:09:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21625 to 16613. [2018-10-26 21:09:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16613 states. [2018-10-26 21:09:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16613 states to 16613 states and 19362 transitions. [2018-10-26 21:09:55,458 INFO L78 Accepts]: Start accepts. Automaton has 16613 states and 19362 transitions. Word has length 332 [2018-10-26 21:09:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:55,459 INFO L481 AbstractCegarLoop]: Abstraction has 16613 states and 19362 transitions. [2018-10-26 21:09:55,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:09:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16613 states and 19362 transitions. [2018-10-26 21:09:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-26 21:09:55,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:55,478 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:09:55,478 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:55,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1592391023, now seen corresponding path program 1 times [2018-10-26 21:09:55,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:55,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:55,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:55,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:55,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:56,157 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-26 21:09:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 21:09:56,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:56,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:56,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:56,237 INFO L87 Difference]: Start difference. First operand 16613 states and 19362 transitions. Second operand 4 states. [2018-10-26 21:09:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:58,376 INFO L93 Difference]: Finished difference Result 36402 states and 42403 transitions. [2018-10-26 21:09:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:58,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2018-10-26 21:09:58,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:58,410 INFO L225 Difference]: With dead ends: 36402 [2018-10-26 21:09:58,410 INFO L226 Difference]: Without dead ends: 19418 [2018-10-26 21:09:58,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19418 states. [2018-10-26 21:09:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19418 to 19015. [2018-10-26 21:09:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19015 states. [2018-10-26 21:09:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19015 states to 19015 states and 21917 transitions. [2018-10-26 21:09:58,634 INFO L78 Accepts]: Start accepts. Automaton has 19015 states and 21917 transitions. Word has length 356 [2018-10-26 21:09:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:58,635 INFO L481 AbstractCegarLoop]: Abstraction has 19015 states and 21917 transitions. [2018-10-26 21:09:58,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19015 states and 21917 transitions. [2018-10-26 21:09:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-26 21:09:58,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:58,656 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:09:58,656 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:58,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1469956884, now seen corresponding path program 1 times [2018-10-26 21:09:58,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:58,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:59,175 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-26 21:09:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:09:59,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:59,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:59,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:59,258 INFO L87 Difference]: Start difference. First operand 19015 states and 21917 transitions. Second operand 4 states. [2018-10-26 21:10:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:02,714 INFO L93 Difference]: Finished difference Result 38799 states and 44737 transitions. [2018-10-26 21:10:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:10:02,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2018-10-26 21:10:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:02,739 INFO L225 Difference]: With dead ends: 38799 [2018-10-26 21:10:02,739 INFO L226 Difference]: Without dead ends: 19971 [2018-10-26 21:10:02,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:10:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2018-10-26 21:10:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 19014. [2018-10-26 21:10:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19014 states. [2018-10-26 21:10:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 21463 transitions. [2018-10-26 21:10:03,012 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 21463 transitions. Word has length 402 [2018-10-26 21:10:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:03,013 INFO L481 AbstractCegarLoop]: Abstraction has 19014 states and 21463 transitions. [2018-10-26 21:10:03,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:10:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 21463 transitions. [2018-10-26 21:10:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-26 21:10:03,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:03,037 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 21:10:03,037 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:03,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1573777934, now seen corresponding path program 1 times [2018-10-26 21:10:03,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:03,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:03,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:03,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:03,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:10:03,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:10:03,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:10:03,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:10:03,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:10:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:10:03,679 INFO L87 Difference]: Start difference. First operand 19014 states and 21463 transitions. Second operand 5 states. [2018-10-26 21:10:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:07,983 INFO L93 Difference]: Finished difference Result 50422 states and 56888 transitions. [2018-10-26 21:10:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:10:07,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 433 [2018-10-26 21:10:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:08,012 INFO L225 Difference]: With dead ends: 50422 [2018-10-26 21:10:08,012 INFO L226 Difference]: Without dead ends: 31595 [2018-10-26 21:10:08,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:10:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31595 states. [2018-10-26 21:10:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31595 to 29554. [2018-10-26 21:10:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29554 states. [2018-10-26 21:10:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29554 states to 29554 states and 32397 transitions. [2018-10-26 21:10:08,389 INFO L78 Accepts]: Start accepts. Automaton has 29554 states and 32397 transitions. Word has length 433 [2018-10-26 21:10:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:08,389 INFO L481 AbstractCegarLoop]: Abstraction has 29554 states and 32397 transitions. [2018-10-26 21:10:08,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:10:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29554 states and 32397 transitions. [2018-10-26 21:10:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-10-26 21:10:08,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:08,416 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:10:08,416 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:08,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -187224792, now seen corresponding path program 1 times [2018-10-26 21:10:08,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:08,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:08,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:08,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 89 proven. 319 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-26 21:10:10,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:10:10,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:10:10,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:10,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:10:10,928 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2018-10-26 21:10:12,492 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-26 21:10:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 89 proven. 319 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-26 21:10:14,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:10:14,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-26 21:10:14,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:10:14,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:10:14,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:10:14,322 INFO L87 Difference]: Start difference. First operand 29554 states and 32397 transitions. Second operand 12 states. [2018-10-26 21:10:15,512 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-10-26 21:10:18,170 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-10-26 21:10:20,743 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2018-10-26 21:10:23,283 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-26 21:10:27,423 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2018-10-26 21:10:28,690 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-26 21:10:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:30,061 INFO L93 Difference]: Finished difference Result 69793 states and 76225 transitions. [2018-10-26 21:10:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 21:10:30,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 524 [2018-10-26 21:10:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:30,101 INFO L225 Difference]: With dead ends: 69793 [2018-10-26 21:10:30,101 INFO L226 Difference]: Without dead ends: 40425 [2018-10-26 21:10:30,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 511 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-10-26 21:10:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40425 states. [2018-10-26 21:10:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40425 to 29170. [2018-10-26 21:10:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29170 states. [2018-10-26 21:10:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29170 states to 29170 states and 31854 transitions. [2018-10-26 21:10:30,839 INFO L78 Accepts]: Start accepts. Automaton has 29170 states and 31854 transitions. Word has length 524 [2018-10-26 21:10:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:30,840 INFO L481 AbstractCegarLoop]: Abstraction has 29170 states and 31854 transitions. [2018-10-26 21:10:30,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:10:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29170 states and 31854 transitions. [2018-10-26 21:10:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-26 21:10:30,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:30,859 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:10:30,859 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:30,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:30,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1457264010, now seen corresponding path program 1 times [2018-10-26 21:10:30,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:30,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:30,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:31,265 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-26 21:10:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 21:10:31,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:10:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:10:31,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:10:31,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:10:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:10:31,398 INFO L87 Difference]: Start difference. First operand 29170 states and 31854 transitions. Second operand 4 states. [2018-10-26 21:10:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:33,218 INFO L93 Difference]: Finished difference Result 58909 states and 64312 transitions. [2018-10-26 21:10:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:10:33,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 572 [2018-10-26 21:10:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:33,252 INFO L225 Difference]: With dead ends: 58909 [2018-10-26 21:10:33,252 INFO L226 Difference]: Without dead ends: 29926 [2018-10-26 21:10:33,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:10:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29926 states. [2018-10-26 21:10:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29926 to 28984. [2018-10-26 21:10:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28984 states. [2018-10-26 21:10:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 31180 transitions. [2018-10-26 21:10:33,547 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 31180 transitions. Word has length 572 [2018-10-26 21:10:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:33,547 INFO L481 AbstractCegarLoop]: Abstraction has 28984 states and 31180 transitions. [2018-10-26 21:10:33,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:10:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 31180 transitions. [2018-10-26 21:10:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-10-26 21:10:33,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:33,561 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 21:10:33,561 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:33,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 396085645, now seen corresponding path program 1 times [2018-10-26 21:10:33,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:34,126 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:10:34,487 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-26 21:10:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 736 proven. 60 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-26 21:10:34,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:10:34,838 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:10:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:35,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:10:36,740 WARN L179 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2018-10-26 21:10:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 736 proven. 60 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-26 21:10:37,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:10:37,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-10-26 21:10:37,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:10:37,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:10:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:10:37,472 INFO L87 Difference]: Start difference. First operand 28984 states and 31180 transitions. Second operand 9 states. [2018-10-26 21:10:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:43,437 INFO L93 Difference]: Finished difference Result 57610 states and 61985 transitions. [2018-10-26 21:10:43,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:10:43,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 574 [2018-10-26 21:10:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:43,465 INFO L225 Difference]: With dead ends: 57610 [2018-10-26 21:10:43,465 INFO L226 Difference]: Without dead ends: 30852 [2018-10-26 21:10:43,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:10:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30852 states. [2018-10-26 21:10:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30852 to 28798. [2018-10-26 21:10:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2018-10-26 21:10:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 30957 transitions. [2018-10-26 21:10:43,796 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 30957 transitions. Word has length 574 [2018-10-26 21:10:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:43,797 INFO L481 AbstractCegarLoop]: Abstraction has 28798 states and 30957 transitions. [2018-10-26 21:10:43,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:10:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 30957 transitions. [2018-10-26 21:10:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-26 21:10:43,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:43,818 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:10:43,818 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:43,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 649228648, now seen corresponding path program 1 times [2018-10-26 21:10:43,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:43,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:43,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:43,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-10-26 21:10:44,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:10:44,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:10:44,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:10:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:10:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:10:44,734 INFO L87 Difference]: Start difference. First operand 28798 states and 30957 transitions. Second operand 7 states. [2018-10-26 21:10:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:49,122 INFO L93 Difference]: Finished difference Result 64999 states and 69821 transitions. [2018-10-26 21:10:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:10:49,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 639 [2018-10-26 21:10:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:49,156 INFO L225 Difference]: With dead ends: 64999 [2018-10-26 21:10:49,156 INFO L226 Difference]: Without dead ends: 38427 [2018-10-26 21:10:49,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:10:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38427 states. [2018-10-26 21:10:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38427 to 25458. [2018-10-26 21:10:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25458 states. [2018-10-26 21:10:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25458 states to 25458 states and 27345 transitions. [2018-10-26 21:10:49,440 INFO L78 Accepts]: Start accepts. Automaton has 25458 states and 27345 transitions. Word has length 639 [2018-10-26 21:10:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:49,442 INFO L481 AbstractCegarLoop]: Abstraction has 25458 states and 27345 transitions. [2018-10-26 21:10:49,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:10:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25458 states and 27345 transitions. [2018-10-26 21:10:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-26 21:10:49,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:49,459 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-26 21:10:49,459 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:49,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1912840326, now seen corresponding path program 1 times [2018-10-26 21:10:49,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:49,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:49,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-10-26 21:10:50,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:10:50,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:10:50,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:10:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:10:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:10:50,260 INFO L87 Difference]: Start difference. First operand 25458 states and 27345 transitions. Second operand 6 states. [2018-10-26 21:10:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:54,398 INFO L93 Difference]: Finished difference Result 58328 states and 62606 transitions. [2018-10-26 21:10:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:10:54,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 646 [2018-10-26 21:10:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:54,432 INFO L225 Difference]: With dead ends: 58328 [2018-10-26 21:10:54,432 INFO L226 Difference]: Without dead ends: 33616 [2018-10-26 21:10:54,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:10:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33616 states. [2018-10-26 21:10:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33616 to 26574. [2018-10-26 21:10:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26574 states. [2018-10-26 21:10:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26574 states to 26574 states and 28542 transitions. [2018-10-26 21:10:54,706 INFO L78 Accepts]: Start accepts. Automaton has 26574 states and 28542 transitions. Word has length 646 [2018-10-26 21:10:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:54,707 INFO L481 AbstractCegarLoop]: Abstraction has 26574 states and 28542 transitions. [2018-10-26 21:10:54,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:10:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26574 states and 28542 transitions. [2018-10-26 21:10:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-10-26 21:10:54,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:54,727 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:10:54,728 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:54,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1945478519, now seen corresponding path program 1 times [2018-10-26 21:10:54,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 30 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:10:55,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:10:55,859 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:10:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:56,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:10:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 155 proven. 851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:10:57,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:10:57,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-26 21:10:57,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:10:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:10:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:10:57,653 INFO L87 Difference]: Start difference. First operand 26574 states and 28542 transitions. Second operand 12 states. [2018-10-26 21:11:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:11:06,363 INFO L93 Difference]: Finished difference Result 76324 states and 81870 transitions. [2018-10-26 21:11:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:11:06,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 677 [2018-10-26 21:11:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:11:06,419 INFO L225 Difference]: With dead ends: 76324 [2018-10-26 21:11:06,419 INFO L226 Difference]: Without dead ends: 49941 [2018-10-26 21:11:06,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 671 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:11:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49941 states. [2018-10-26 21:11:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49941 to 36230. [2018-10-26 21:11:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36230 states. [2018-10-26 21:11:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36230 states to 36230 states and 38876 transitions. [2018-10-26 21:11:06,883 INFO L78 Accepts]: Start accepts. Automaton has 36230 states and 38876 transitions. Word has length 677 [2018-10-26 21:11:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:11:06,884 INFO L481 AbstractCegarLoop]: Abstraction has 36230 states and 38876 transitions. [2018-10-26 21:11:06,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:11:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36230 states and 38876 transitions. [2018-10-26 21:11:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-10-26 21:11:06,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:11:06,904 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:11:06,904 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:11:06,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:11:06,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1769512697, now seen corresponding path program 1 times [2018-10-26 21:11:06,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:11:06,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:11:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:11:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:11:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:11:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:11:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:11:09,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:11:09,290 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:11:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:11:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:11:09,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:11:37,996 WARN L179 SmtUtils]: Spent 28.06 s on a formula simplification. DAG size of input: 199 DAG size of output: 36 [2018-10-26 21:11:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 680 proven. 200 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 21:11:40,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:11:40,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-26 21:11:40,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:11:40,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:11:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:11:40,313 INFO L87 Difference]: Start difference. First operand 36230 states and 38876 transitions. Second operand 12 states. [2018-10-26 21:12:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:01,487 INFO L93 Difference]: Finished difference Result 105453 states and 112978 transitions. [2018-10-26 21:12:01,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:12:01,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 685 [2018-10-26 21:12:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:01,561 INFO L225 Difference]: With dead ends: 105453 [2018-10-26 21:12:01,561 INFO L226 Difference]: Without dead ends: 68674 [2018-10-26 21:12:01,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 683 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:12:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68674 states. [2018-10-26 21:12:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68674 to 37897. [2018-10-26 21:12:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37897 states. [2018-10-26 21:12:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37897 states to 37897 states and 40589 transitions. [2018-10-26 21:12:02,143 INFO L78 Accepts]: Start accepts. Automaton has 37897 states and 40589 transitions. Word has length 685 [2018-10-26 21:12:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:02,143 INFO L481 AbstractCegarLoop]: Abstraction has 37897 states and 40589 transitions. [2018-10-26 21:12:02,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:12:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 37897 states and 40589 transitions. [2018-10-26 21:12:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2018-10-26 21:12:02,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:02,173 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:12:02,174 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:02,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -260430783, now seen corresponding path program 1 times [2018-10-26 21:12:02,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 1440 proven. 687 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-26 21:12:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:12:04,500 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:12:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:04,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:12:06,232 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2018-10-26 21:12:13,366 WARN L179 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 209 DAG size of output: 38 [2018-10-26 21:12:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 245 proven. 1752 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-10-26 21:12:19,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:12:19,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-26 21:12:19,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:12:19,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:12:19,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=121, Unknown=1, NotChecked=0, Total=156 [2018-10-26 21:12:19,545 INFO L87 Difference]: Start difference. First operand 37897 states and 40589 transitions. Second operand 13 states. Received shutdown request... [2018-10-26 21:13:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:13:06,741 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:13:06,746 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:13:06,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:13:06 BoogieIcfgContainer [2018-10-26 21:13:06,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:13:06,747 INFO L168 Benchmark]: Toolchain (without parser) took 238690.64 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-26 21:13:06,748 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:13:06,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 970.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:13:06,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -833.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-26 21:13:06,752 INFO L168 Benchmark]: Boogie Preprocessor took 144.98 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:13:06,752 INFO L168 Benchmark]: RCFGBuilder took 5040.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 176.1 MB). Peak memory consumption was 176.1 MB. Max. memory is 7.1 GB. [2018-10-26 21:13:06,759 INFO L168 Benchmark]: TraceAbstraction took 232207.88 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -420.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-26 21:13:06,767 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 970.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 321.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -833.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.98 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5040.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 176.1 MB). Peak memory consumption was 176.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232207.88 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -420.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (37897states) and FLOYD_HOARE automaton (currently 3 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (85 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 232.1s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 152.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3905 SDtfs, 18519 SDslu, 3303 SDs, 0 SdLazy, 48490 SolverSat, 6518 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 134.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3900 GetRequests, 3752 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 54.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37897occurred in iteration=19, 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: 5.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 89453 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 65.2s InterpolantComputationTime, 12120 NumberOfCodeBlocks, 12120 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 12094 ConstructedInterpolants, 1274 QuantifiedInterpolants, 64564138 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4699 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 10627/17165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown