java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:27:49,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:27:49,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:27:49,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:27:49,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:27:49,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:27:49,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:27:49,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:27:49,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:27:49,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:27:49,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:27:49,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:27:49,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:27:49,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:27:49,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:27:49,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:27:49,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:27:49,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:27:49,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:27:49,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:27:49,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:27:49,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:27:49,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:27:49,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:27:49,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:27:49,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:27:49,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:27:49,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:27:49,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:27:49,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:27:49,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:27:49,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:27:49,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:27:49,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:27:49,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:27:49,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:27:49,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:27:49,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:27:49,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:27:49,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:27:49,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:27:49,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:27:49,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:27:49,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:27:49,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:27:49,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:27:49,519 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:27:49,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:27:49,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:27:49,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:27:49,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:27:49,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:27:49,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:27:49,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:27:49,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:27:49,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:27:49,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:27:49,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:27:49,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:27:49,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:27:49,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:27:49,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:27:49,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:27:49,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:27:49,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:27:49,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:27:49,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:27:49,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:27:49,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:27:49,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:27:49,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:27:49,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:27:49,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:27:49,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:27:49,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:27:49,592 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:27:49,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:27:49,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b95d4127/0b0ec72f87794bdc9ccb454bf434ac96/FLAGf4b2f11f8 [2019-09-08 12:27:50,155 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:27:50,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:27:50,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b95d4127/0b0ec72f87794bdc9ccb454bf434ac96/FLAGf4b2f11f8 [2019-09-08 12:27:50,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b95d4127/0b0ec72f87794bdc9ccb454bf434ac96 [2019-09-08 12:27:50,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:27:50,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:27:50,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:27:50,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:27:50,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:27:50,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:27:50" (1/1) ... [2019-09-08 12:27:50,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427c24f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:50, skipping insertion in model container [2019-09-08 12:27:50,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:27:50" (1/1) ... [2019-09-08 12:27:50,450 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:27:50,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:27:50,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:27:51,007 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:27:51,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:27:51,154 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:27:51,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51 WrapperNode [2019-09-08 12:27:51,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:27:51,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:27:51,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:27:51,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:27:51,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... [2019-09-08 12:27:51,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:27:51,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:27:51,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:27:51,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:27:51,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 12:27:51,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:27:51,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:27:51,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:27:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:27:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:27:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:27:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:27:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:27:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:27:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:27:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:27:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:27:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:27:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:27:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:27:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:27:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:27:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:27:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:27:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:27:51,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:27:52,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:27:52,424 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:27:52,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:27:52 BoogieIcfgContainer [2019-09-08 12:27:52,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:27:52,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:27:52,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:27:52,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:27:52,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:27:50" (1/3) ... [2019-09-08 12:27:52,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd233e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:27:52, skipping insertion in model container [2019-09-08 12:27:52,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:51" (2/3) ... [2019-09-08 12:27:52,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd233e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:27:52, skipping insertion in model container [2019-09-08 12:27:52,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:27:52" (3/3) ... [2019-09-08 12:27:52,434 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:27:52,445 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:27:52,468 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:27:52,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:27:52,534 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:27:52,535 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:27:52,536 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:27:52,536 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:27:52,537 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:27:52,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:27:52,538 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:27:52,538 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:27:52,538 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:27:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-09-08 12:27:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:27:52,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:52,576 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:52,579 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 171862004, now seen corresponding path program 1 times [2019-09-08 12:27:52,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:53,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:53,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:27:53,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:27:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:27:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:53,188 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 3 states. [2019-09-08 12:27:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:53,355 INFO L93 Difference]: Finished difference Result 355 states and 587 transitions. [2019-09-08 12:27:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:27:53,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:27:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:53,386 INFO L225 Difference]: With dead ends: 355 [2019-09-08 12:27:53,386 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 12:27:53,393 INFO L628 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 [2019-09-08 12:27:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 12:27:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-09-08 12:27:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 387 transitions. [2019-09-08 12:27:53,466 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 387 transitions. Word has length 95 [2019-09-08 12:27:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:53,467 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 387 transitions. [2019-09-08 12:27:53,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:27:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 387 transitions. [2019-09-08 12:27:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:27:53,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:53,472 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:53,472 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1189024244, now seen corresponding path program 1 times [2019-09-08 12:27:53,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:53,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:53,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:53,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:53,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:53,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:53,740 INFO L87 Difference]: Start difference. First operand 270 states and 387 transitions. Second operand 5 states. [2019-09-08 12:27:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:54,049 INFO L93 Difference]: Finished difference Result 489 states and 722 transitions. [2019-09-08 12:27:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:54,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:27:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:54,055 INFO L225 Difference]: With dead ends: 489 [2019-09-08 12:27:54,056 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:54,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 384 transitions. [2019-09-08 12:27:54,127 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 384 transitions. Word has length 97 [2019-09-08 12:27:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:54,134 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 384 transitions. [2019-09-08 12:27:54,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 384 transitions. [2019-09-08 12:27:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:54,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:54,143 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:54,143 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 119724555, now seen corresponding path program 1 times [2019-09-08 12:27:54,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:54,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:54,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:54,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:54,325 INFO L87 Difference]: Start difference. First operand 270 states and 384 transitions. Second operand 5 states. [2019-09-08 12:27:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:54,535 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2019-09-08 12:27:54,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:54,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 12:27:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:54,539 INFO L225 Difference]: With dead ends: 485 [2019-09-08 12:27:54,539 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:54,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 381 transitions. [2019-09-08 12:27:54,580 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 381 transitions. Word has length 98 [2019-09-08 12:27:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:54,582 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 381 transitions. [2019-09-08 12:27:54,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 381 transitions. [2019-09-08 12:27:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:27:54,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:54,592 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:54,592 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash 540542213, now seen corresponding path program 1 times [2019-09-08 12:27:54,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:54,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:54,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:54,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:54,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:54,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:54,778 INFO L87 Difference]: Start difference. First operand 270 states and 381 transitions. Second operand 5 states. [2019-09-08 12:27:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:54,978 INFO L93 Difference]: Finished difference Result 477 states and 697 transitions. [2019-09-08 12:27:54,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:54,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 12:27:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:54,982 INFO L225 Difference]: With dead ends: 477 [2019-09-08 12:27:54,982 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:54,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2019-09-08 12:27:55,009 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 99 [2019-09-08 12:27:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:55,011 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2019-09-08 12:27:55,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2019-09-08 12:27:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:27:55,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:55,014 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:55,015 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 298030891, now seen corresponding path program 1 times [2019-09-08 12:27:55,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:55,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:55,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:55,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:55,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:55,150 INFO L87 Difference]: Start difference. First operand 270 states and 378 transitions. Second operand 5 states. [2019-09-08 12:27:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:55,351 INFO L93 Difference]: Finished difference Result 473 states and 687 transitions. [2019-09-08 12:27:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:55,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:27:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:55,354 INFO L225 Difference]: With dead ends: 473 [2019-09-08 12:27:55,354 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:55,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 375 transitions. [2019-09-08 12:27:55,374 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 375 transitions. Word has length 100 [2019-09-08 12:27:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:55,376 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 375 transitions. [2019-09-08 12:27:55,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 375 transitions. [2019-09-08 12:27:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:27:55,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:55,377 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:55,378 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash -317145100, now seen corresponding path program 1 times [2019-09-08 12:27:55,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:55,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:55,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:55,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:55,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:55,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:55,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:55,512 INFO L87 Difference]: Start difference. First operand 270 states and 375 transitions. Second operand 5 states. [2019-09-08 12:27:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:55,709 INFO L93 Difference]: Finished difference Result 481 states and 690 transitions. [2019-09-08 12:27:55,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:55,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 12:27:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:55,714 INFO L225 Difference]: With dead ends: 481 [2019-09-08 12:27:55,714 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:55,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 372 transitions. [2019-09-08 12:27:55,736 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 372 transitions. Word has length 101 [2019-09-08 12:27:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:55,736 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 372 transitions. [2019-09-08 12:27:55,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 372 transitions. [2019-09-08 12:27:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:55,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:55,754 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:55,755 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -761237271, now seen corresponding path program 1 times [2019-09-08 12:27:55,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:55,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:55,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:55,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:55,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:55,893 INFO L87 Difference]: Start difference. First operand 270 states and 372 transitions. Second operand 5 states. [2019-09-08 12:27:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:56,080 INFO L93 Difference]: Finished difference Result 469 states and 672 transitions. [2019-09-08 12:27:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:56,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:27:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:56,082 INFO L225 Difference]: With dead ends: 469 [2019-09-08 12:27:56,082 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 12:27:56,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:27:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 12:27:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-08 12:27:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:27:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 369 transitions. [2019-09-08 12:27:56,103 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 369 transitions. Word has length 102 [2019-09-08 12:27:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:56,104 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 369 transitions. [2019-09-08 12:27:56,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 369 transitions. [2019-09-08 12:27:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:56,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:56,105 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:56,106 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1874562471, now seen corresponding path program 1 times [2019-09-08 12:27:56,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:56,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:56,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:56,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:56,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:56,302 INFO L87 Difference]: Start difference. First operand 270 states and 369 transitions. Second operand 8 states. [2019-09-08 12:27:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:56,747 INFO L93 Difference]: Finished difference Result 1201 states and 1754 transitions. [2019-09-08 12:27:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:27:56,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:27:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:56,754 INFO L225 Difference]: With dead ends: 1201 [2019-09-08 12:27:56,754 INFO L226 Difference]: Without dead ends: 1065 [2019-09-08 12:27:56,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:27:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-09-08 12:27:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 334. [2019-09-08 12:27:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-08 12:27:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2019-09-08 12:27:56,818 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 103 [2019-09-08 12:27:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:56,819 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2019-09-08 12:27:56,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:27:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2019-09-08 12:27:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:56,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:56,821 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:56,821 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 536999613, now seen corresponding path program 1 times [2019-09-08 12:27:56,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:56,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:56,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:57,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:57,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:57,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:57,026 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. Second operand 8 states. [2019-09-08 12:27:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:57,370 INFO L93 Difference]: Finished difference Result 1266 states and 1853 transitions. [2019-09-08 12:27:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:27:57,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:27:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:57,377 INFO L225 Difference]: With dead ends: 1266 [2019-09-08 12:27:57,377 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:27:57,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:27:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:27:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 514. [2019-09-08 12:27:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 12:27:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 739 transitions. [2019-09-08 12:27:57,439 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 739 transitions. Word has length 103 [2019-09-08 12:27:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:57,439 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 739 transitions. [2019-09-08 12:27:57,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:27:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 739 transitions. [2019-09-08 12:27:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:57,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:57,441 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:57,441 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1732033126, now seen corresponding path program 1 times [2019-09-08 12:27:57,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:57,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:57,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:57,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:57,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:57,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:57,592 INFO L87 Difference]: Start difference. First operand 514 states and 739 transitions. Second operand 5 states. [2019-09-08 12:27:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:57,813 INFO L93 Difference]: Finished difference Result 965 states and 1411 transitions. [2019-09-08 12:27:57,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:57,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:27:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:57,820 INFO L225 Difference]: With dead ends: 965 [2019-09-08 12:27:57,820 INFO L226 Difference]: Without dead ends: 829 [2019-09-08 12:27:57,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:27:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-08 12:27:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 732. [2019-09-08 12:27:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-08 12:27:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1068 transitions. [2019-09-08 12:27:57,924 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1068 transitions. Word has length 103 [2019-09-08 12:27:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:57,924 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 1068 transitions. [2019-09-08 12:27:57,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1068 transitions. [2019-09-08 12:27:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:57,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:57,926 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:57,926 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -362799159, now seen corresponding path program 1 times [2019-09-08 12:27:57,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:57,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:57,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:27:58,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:27:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:27:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:58,008 INFO L87 Difference]: Start difference. First operand 732 states and 1068 transitions. Second operand 3 states. [2019-09-08 12:27:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:58,148 INFO L93 Difference]: Finished difference Result 1353 states and 1999 transitions. [2019-09-08 12:27:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:27:58,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 12:27:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:58,154 INFO L225 Difference]: With dead ends: 1353 [2019-09-08 12:27:58,154 INFO L226 Difference]: Without dead ends: 803 [2019-09-08 12:27:58,156 INFO L628 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 [2019-09-08 12:27:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-09-08 12:27:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 801. [2019-09-08 12:27:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-09-08 12:27:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1164 transitions. [2019-09-08 12:27:58,289 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1164 transitions. Word has length 103 [2019-09-08 12:27:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:58,289 INFO L475 AbstractCegarLoop]: Abstraction has 801 states and 1164 transitions. [2019-09-08 12:27:58,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:27:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1164 transitions. [2019-09-08 12:27:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:58,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:58,291 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:58,292 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -604016886, now seen corresponding path program 1 times [2019-09-08 12:27:58,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:58,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:58,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:58,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:58,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:27:58,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:27:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:27:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:58,356 INFO L87 Difference]: Start difference. First operand 801 states and 1164 transitions. Second operand 3 states. [2019-09-08 12:27:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:58,518 INFO L93 Difference]: Finished difference Result 1983 states and 2913 transitions. [2019-09-08 12:27:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:27:58,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 12:27:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:58,526 INFO L225 Difference]: With dead ends: 1983 [2019-09-08 12:27:58,526 INFO L226 Difference]: Without dead ends: 1364 [2019-09-08 12:27:58,528 INFO L628 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 [2019-09-08 12:27:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-08 12:27:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2019-09-08 12:27:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-08 12:27:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1974 transitions. [2019-09-08 12:27:58,684 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1974 transitions. Word has length 103 [2019-09-08 12:27:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:58,684 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1974 transitions. [2019-09-08 12:27:58,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:27:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1974 transitions. [2019-09-08 12:27:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:58,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:58,686 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:58,686 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash 258657232, now seen corresponding path program 1 times [2019-09-08 12:27:58,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:58,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:58,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:58,788 INFO L87 Difference]: Start difference. First operand 1362 states and 1974 transitions. Second operand 5 states. [2019-09-08 12:27:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:59,123 INFO L93 Difference]: Finished difference Result 2160 states and 3140 transitions. [2019-09-08 12:27:59,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:59,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:27:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:59,133 INFO L225 Difference]: With dead ends: 2160 [2019-09-08 12:27:59,133 INFO L226 Difference]: Without dead ends: 1638 [2019-09-08 12:27:59,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:27:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-09-08 12:27:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1494. [2019-09-08 12:27:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-09-08 12:27:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2168 transitions. [2019-09-08 12:27:59,316 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2168 transitions. Word has length 103 [2019-09-08 12:27:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:59,317 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2168 transitions. [2019-09-08 12:27:59,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2168 transitions. [2019-09-08 12:27:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:27:59,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:59,318 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:59,319 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1863479507, now seen corresponding path program 1 times [2019-09-08 12:27:59,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:59,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:59,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:59,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:59,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:59,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:59,513 INFO L87 Difference]: Start difference. First operand 1494 states and 2168 transitions. Second operand 8 states. [2019-09-08 12:28:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:00,415 INFO L93 Difference]: Finished difference Result 4968 states and 7272 transitions. [2019-09-08 12:28:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:28:00,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:28:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:00,438 INFO L225 Difference]: With dead ends: 4968 [2019-09-08 12:28:00,439 INFO L226 Difference]: Without dead ends: 4315 [2019-09-08 12:28:00,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:28:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-09-08 12:28:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 1763. [2019-09-08 12:28:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-09-08 12:28:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2563 transitions. [2019-09-08 12:28:00,725 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2563 transitions. Word has length 103 [2019-09-08 12:28:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:00,725 INFO L475 AbstractCegarLoop]: Abstraction has 1763 states and 2563 transitions. [2019-09-08 12:28:00,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:28:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2563 transitions. [2019-09-08 12:28:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:28:00,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:00,727 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:00,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1229981692, now seen corresponding path program 1 times [2019-09-08 12:28:00,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:00,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:00,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:00,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:28:00,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:28:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:28:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:28:00,889 INFO L87 Difference]: Start difference. First operand 1763 states and 2563 transitions. Second operand 8 states. [2019-09-08 12:28:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:01,763 INFO L93 Difference]: Finished difference Result 5176 states and 7580 transitions. [2019-09-08 12:28:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:28:01,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:28:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:01,787 INFO L225 Difference]: With dead ends: 5176 [2019-09-08 12:28:01,787 INFO L226 Difference]: Without dead ends: 4523 [2019-09-08 12:28:01,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:28:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2019-09-08 12:28:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 2047. [2019-09-08 12:28:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-09-08 12:28:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2982 transitions. [2019-09-08 12:28:02,080 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2982 transitions. Word has length 103 [2019-09-08 12:28:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:02,080 INFO L475 AbstractCegarLoop]: Abstraction has 2047 states and 2982 transitions. [2019-09-08 12:28:02,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:28:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2982 transitions. [2019-09-08 12:28:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:28:02,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:02,082 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:02,082 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1636218723, now seen corresponding path program 1 times [2019-09-08 12:28:02,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:02,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:02,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:02,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:02,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:02,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:02,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:02,193 INFO L87 Difference]: Start difference. First operand 2047 states and 2982 transitions. Second operand 5 states. [2019-09-08 12:28:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:02,733 INFO L93 Difference]: Finished difference Result 3415 states and 4989 transitions. [2019-09-08 12:28:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:28:02,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 12:28:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:02,753 INFO L225 Difference]: With dead ends: 3415 [2019-09-08 12:28:02,753 INFO L226 Difference]: Without dead ends: 3413 [2019-09-08 12:28:02,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:28:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-09-08 12:28:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 2061. [2019-09-08 12:28:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-09-08 12:28:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2990 transitions. [2019-09-08 12:28:03,055 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2990 transitions. Word has length 104 [2019-09-08 12:28:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:03,055 INFO L475 AbstractCegarLoop]: Abstraction has 2061 states and 2990 transitions. [2019-09-08 12:28:03,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2990 transitions. [2019-09-08 12:28:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:28:03,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:03,057 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:03,057 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1313866017, now seen corresponding path program 1 times [2019-09-08 12:28:03,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:03,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:03,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:03,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:03,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:03,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:03,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:28:03,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:28:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:28:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:28:03,168 INFO L87 Difference]: Start difference. First operand 2061 states and 2990 transitions. Second operand 4 states. [2019-09-08 12:28:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:03,690 INFO L93 Difference]: Finished difference Result 4800 states and 6995 transitions. [2019-09-08 12:28:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:28:03,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 12:28:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:03,704 INFO L225 Difference]: With dead ends: 4800 [2019-09-08 12:28:03,705 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:28:03,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:28:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:28:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2947. [2019-09-08 12:28:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4270 transitions. [2019-09-08 12:28:04,058 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4270 transitions. Word has length 104 [2019-09-08 12:28:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:04,058 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4270 transitions. [2019-09-08 12:28:04,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:28:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4270 transitions. [2019-09-08 12:28:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:28:04,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:04,060 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:04,060 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -235929603, now seen corresponding path program 1 times [2019-09-08 12:28:04,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:04,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:04,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:04,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:04,309 INFO L87 Difference]: Start difference. First operand 2947 states and 4270 transitions. Second operand 10 states. [2019-09-08 12:28:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:05,903 INFO L93 Difference]: Finished difference Result 8565 states and 12433 transitions. [2019-09-08 12:28:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:28:05,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:28:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:05,938 INFO L225 Difference]: With dead ends: 8565 [2019-09-08 12:28:05,938 INFO L226 Difference]: Without dead ends: 5736 [2019-09-08 12:28:05,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:28:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2019-09-08 12:28:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 2947. [2019-09-08 12:28:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4268 transitions. [2019-09-08 12:28:06,308 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4268 transitions. Word has length 105 [2019-09-08 12:28:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:06,308 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4268 transitions. [2019-09-08 12:28:06,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4268 transitions. [2019-09-08 12:28:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:28:06,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:06,311 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:06,311 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash 457052476, now seen corresponding path program 1 times [2019-09-08 12:28:06,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:06,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:06,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:06,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:06,584 INFO L87 Difference]: Start difference. First operand 2947 states and 4268 transitions. Second operand 10 states. [2019-09-08 12:28:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:08,123 INFO L93 Difference]: Finished difference Result 8679 states and 12592 transitions. [2019-09-08 12:28:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:28:08,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:28:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:08,137 INFO L225 Difference]: With dead ends: 8679 [2019-09-08 12:28:08,138 INFO L226 Difference]: Without dead ends: 5860 [2019-09-08 12:28:08,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:28:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-09-08 12:28:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 2947. [2019-09-08 12:28:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4264 transitions. [2019-09-08 12:28:08,603 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4264 transitions. Word has length 105 [2019-09-08 12:28:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:08,603 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4264 transitions. [2019-09-08 12:28:08,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4264 transitions. [2019-09-08 12:28:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:28:08,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:08,605 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:08,605 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1202767598, now seen corresponding path program 1 times [2019-09-08 12:28:08,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:08,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:08,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:08,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:08,840 INFO L87 Difference]: Start difference. First operand 2947 states and 4264 transitions. Second operand 9 states. [2019-09-08 12:28:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:10,131 INFO L93 Difference]: Finished difference Result 8398 states and 12206 transitions. [2019-09-08 12:28:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:28:10,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:28:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:10,143 INFO L225 Difference]: With dead ends: 8398 [2019-09-08 12:28:10,143 INFO L226 Difference]: Without dead ends: 5691 [2019-09-08 12:28:10,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:28:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2019-09-08 12:28:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 2947. [2019-09-08 12:28:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4263 transitions. [2019-09-08 12:28:10,628 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4263 transitions. Word has length 105 [2019-09-08 12:28:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:10,628 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4263 transitions. [2019-09-08 12:28:10,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4263 transitions. [2019-09-08 12:28:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:28:10,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:10,630 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:10,630 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1247777740, now seen corresponding path program 1 times [2019-09-08 12:28:10,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:10,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:10,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:10,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:10,868 INFO L87 Difference]: Start difference. First operand 2947 states and 4263 transitions. Second operand 10 states. [2019-09-08 12:28:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:12,388 INFO L93 Difference]: Finished difference Result 8604 states and 12467 transitions. [2019-09-08 12:28:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:28:12,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-08 12:28:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:12,405 INFO L225 Difference]: With dead ends: 8604 [2019-09-08 12:28:12,405 INFO L226 Difference]: Without dead ends: 5830 [2019-09-08 12:28:12,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:28:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2019-09-08 12:28:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 2947. [2019-09-08 12:28:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4257 transitions. [2019-09-08 12:28:12,991 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4257 transitions. Word has length 106 [2019-09-08 12:28:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:12,991 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4257 transitions. [2019-09-08 12:28:12,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4257 transitions. [2019-09-08 12:28:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:28:12,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:12,993 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:12,993 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1487430692, now seen corresponding path program 1 times [2019-09-08 12:28:12,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:12,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:13,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:13,224 INFO L87 Difference]: Start difference. First operand 2947 states and 4257 transitions. Second operand 10 states. [2019-09-08 12:28:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:15,063 INFO L93 Difference]: Finished difference Result 8649 states and 12523 transitions. [2019-09-08 12:28:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:28:15,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-09-08 12:28:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:15,075 INFO L225 Difference]: With dead ends: 8649 [2019-09-08 12:28:15,075 INFO L226 Difference]: Without dead ends: 5850 [2019-09-08 12:28:15,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:28:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-09-08 12:28:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 2947. [2019-09-08 12:28:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4252 transitions. [2019-09-08 12:28:15,631 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4252 transitions. Word has length 107 [2019-09-08 12:28:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:15,632 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4252 transitions. [2019-09-08 12:28:15,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4252 transitions. [2019-09-08 12:28:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:28:15,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:15,633 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:15,634 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 89521878, now seen corresponding path program 1 times [2019-09-08 12:28:15,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:15,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:15,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:15,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:15,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:15,850 INFO L87 Difference]: Start difference. First operand 2947 states and 4252 transitions. Second operand 10 states. [2019-09-08 12:28:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:18,010 INFO L93 Difference]: Finished difference Result 8549 states and 12368 transitions. [2019-09-08 12:28:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:28:18,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-08 12:28:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:18,020 INFO L225 Difference]: With dead ends: 8549 [2019-09-08 12:28:18,020 INFO L226 Difference]: Without dead ends: 5805 [2019-09-08 12:28:18,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:28:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-09-08 12:28:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 2947. [2019-09-08 12:28:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:28:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4245 transitions. [2019-09-08 12:28:18,706 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4245 transitions. Word has length 108 [2019-09-08 12:28:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:18,707 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4245 transitions. [2019-09-08 12:28:18,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4245 transitions. [2019-09-08 12:28:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:18,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:18,708 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:18,708 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1141422456, now seen corresponding path program 1 times [2019-09-08 12:28:18,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:18,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:19,942 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:28:20,088 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:28:20,275 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:28:20,431 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:28:20,624 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:28:21,177 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:28:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:22,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:28:22,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:28:22,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:28:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:28:22,566 INFO L87 Difference]: Start difference. First operand 2947 states and 4245 transitions. Second operand 36 states. [2019-09-08 12:28:22,825 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 12:28:23,909 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-08 12:28:24,282 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 12:28:24,489 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:28:24,913 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 12:28:25,527 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-08 12:28:25,984 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-08 12:28:26,585 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-09-08 12:28:27,231 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2019-09-08 12:28:28,026 WARN L188 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 142 [2019-09-08 12:28:28,836 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 151 [2019-09-08 12:28:29,791 WARN L188 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 164 [2019-09-08 12:28:30,930 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 206 DAG size of output: 191 [2019-09-08 12:28:33,095 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 224 DAG size of output: 205 [2019-09-08 12:28:33,524 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-08 12:28:33,938 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-08 12:28:34,439 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-09-08 12:28:34,846 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-09-08 12:28:35,592 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2019-09-08 12:28:36,232 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-08 12:28:36,826 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-08 12:28:37,436 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-08 12:28:38,333 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-08 12:28:39,020 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-08 12:28:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:48,413 INFO L93 Difference]: Finished difference Result 14171 states and 20561 transitions. [2019-09-08 12:28:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 12:28:48,413 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:28:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:48,428 INFO L225 Difference]: With dead ends: 14171 [2019-09-08 12:28:48,428 INFO L226 Difference]: Without dead ends: 12804 [2019-09-08 12:28:48,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=956, Invalid=4594, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 12:28:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12804 states. [2019-09-08 12:28:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12804 to 2990. [2019-09-08 12:28:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-09-08 12:28:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4300 transitions. [2019-09-08 12:28:49,274 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4300 transitions. Word has length 109 [2019-09-08 12:28:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:49,275 INFO L475 AbstractCegarLoop]: Abstraction has 2990 states and 4300 transitions. [2019-09-08 12:28:49,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:28:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4300 transitions. [2019-09-08 12:28:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:49,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:49,276 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:49,277 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash -962103610, now seen corresponding path program 1 times [2019-09-08 12:28:49,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:49,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:49,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:49,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:50,217 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:28:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:28:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:28:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:28:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:28:50,967 INFO L87 Difference]: Start difference. First operand 2990 states and 4300 transitions. Second operand 25 states. [2019-09-08 12:28:52,032 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:28:52,337 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:28:52,716 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:28:53,112 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 12:28:53,603 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-08 12:28:54,130 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-09-08 12:28:54,370 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 12:28:54,514 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 12:28:54,891 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:28:55,366 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:28:55,696 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:28:56,057 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:28:56,515 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:28:56,947 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:29:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:01,474 INFO L93 Difference]: Finished difference Result 13297 states and 19296 transitions. [2019-09-08 12:29:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:29:01,474 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-09-08 12:29:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:01,487 INFO L225 Difference]: With dead ends: 13297 [2019-09-08 12:29:01,488 INFO L226 Difference]: Without dead ends: 11901 [2019-09-08 12:29:01,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:29:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11901 states. [2019-09-08 12:29:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11901 to 2990. [2019-09-08 12:29:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-09-08 12:29:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4296 transitions. [2019-09-08 12:29:02,413 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4296 transitions. Word has length 109 [2019-09-08 12:29:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:02,413 INFO L475 AbstractCegarLoop]: Abstraction has 2990 states and 4296 transitions. [2019-09-08 12:29:02,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:29:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4296 transitions. [2019-09-08 12:29:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:29:02,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:02,415 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:02,415 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:02,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1830243783, now seen corresponding path program 1 times [2019-09-08 12:29:02,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:02,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:03,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:29:03,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:29:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:29:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:29:03,423 INFO L87 Difference]: Start difference. First operand 2990 states and 4296 transitions. Second operand 19 states. [2019-09-08 12:29:04,225 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:29:04,512 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-08 12:29:04,853 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-08 12:29:05,031 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-08 12:29:05,402 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:29:05,632 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:29:05,842 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:29:06,066 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:29:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:10,291 INFO L93 Difference]: Finished difference Result 14152 states and 20544 transitions. [2019-09-08 12:29:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:29:10,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-08 12:29:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:10,306 INFO L225 Difference]: With dead ends: 14152 [2019-09-08 12:29:10,306 INFO L226 Difference]: Without dead ends: 12747 [2019-09-08 12:29:10,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:29:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12747 states. [2019-09-08 12:29:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12747 to 2957. [2019-09-08 12:29:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2957 states. [2019-09-08 12:29:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4253 transitions. [2019-09-08 12:29:11,285 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4253 transitions. Word has length 109 [2019-09-08 12:29:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:11,285 INFO L475 AbstractCegarLoop]: Abstraction has 2957 states and 4253 transitions. [2019-09-08 12:29:11,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:29:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4253 transitions. [2019-09-08 12:29:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:29:11,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:11,286 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:11,286 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -279703384, now seen corresponding path program 1 times [2019-09-08 12:29:11,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:11,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:12,439 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:29:12,592 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:29:12,776 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 12:29:12,933 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:29:13,118 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 12:29:13,447 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 12:29:13,802 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-08 12:29:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:15,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:15,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:29:15,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:29:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:29:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:29:15,130 INFO L87 Difference]: Start difference. First operand 2957 states and 4253 transitions. Second operand 36 states. [2019-09-08 12:29:15,347 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:29:16,620 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:29:16,818 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:29:17,402 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:29:17,722 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:29:18,065 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-08 12:29:18,543 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-08 12:29:19,056 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-08 12:29:19,713 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-09-08 12:29:20,392 WARN L188 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 123 [2019-09-08 12:29:21,232 WARN L188 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 141 [2019-09-08 12:29:22,179 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-09-08 12:29:23,328 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 216 DAG size of output: 180 [2019-09-08 12:29:23,703 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-08 12:29:24,381 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-08 12:29:24,937 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-08 12:29:25,505 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-08 12:29:26,334 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-08 12:29:27,010 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-08 12:29:27,977 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-08 12:29:28,674 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-08 12:29:30,736 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-08 12:29:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:41,957 INFO L93 Difference]: Finished difference Result 15273 states and 22157 transitions. [2019-09-08 12:29:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 12:29:41,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:29:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:41,977 INFO L225 Difference]: With dead ends: 15273 [2019-09-08 12:29:41,978 INFO L226 Difference]: Without dead ends: 14298 [2019-09-08 12:29:41,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=950, Invalid=4306, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 12:29:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14298 states. [2019-09-08 12:29:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14298 to 3024. [2019-09-08 12:29:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2019-09-08 12:29:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 4340 transitions. [2019-09-08 12:29:43,264 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 4340 transitions. Word has length 109 [2019-09-08 12:29:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:43,264 INFO L475 AbstractCegarLoop]: Abstraction has 3024 states and 4340 transitions. [2019-09-08 12:29:43,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:29:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 4340 transitions. [2019-09-08 12:29:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:29:43,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:43,265 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:43,265 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash -684647096, now seen corresponding path program 1 times [2019-09-08 12:29:43,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:43,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:43,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:44,599 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:44,755 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:29:44,916 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:45,452 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:47,561 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:49,886 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:51,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:29:51,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:29:51,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:29:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:29:51,515 INFO L87 Difference]: Start difference. First operand 3024 states and 4340 transitions. Second operand 36 states. [2019-09-08 12:29:51,725 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-08 12:29:53,074 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:29:53,718 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-08 12:29:54,090 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 12:29:54,428 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-08 12:29:54,968 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 108 [2019-09-08 12:29:55,629 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 128 [2019-09-08 12:29:56,582 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 138 [2019-09-08 12:29:59,607 WARN L188 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 201 DAG size of output: 159 [2019-09-08 12:30:36,386 WARN L188 SmtUtils]: Spent 36.56 s on a formula simplification. DAG size of input: 230 DAG size of output: 187 [2019-09-08 12:31:14,005 WARN L188 SmtUtils]: Spent 37.45 s on a formula simplification. DAG size of input: 255 DAG size of output: 211 [2019-09-08 12:31:46,563 WARN L188 SmtUtils]: Spent 32.36 s on a formula simplification. DAG size of input: 275 DAG size of output: 230 [2019-09-08 12:31:49,006 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2019-09-08 12:31:49,350 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2019-09-08 12:31:49,692 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-08 12:31:50,008 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:31:50,321 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:31:53,339 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 12:31:54,154 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-08 12:32:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:10,104 INFO L93 Difference]: Finished difference Result 20917 states and 30352 transitions. [2019-09-08 12:32:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 12:32:10,105 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:32:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:10,129 INFO L225 Difference]: With dead ends: 20917 [2019-09-08 12:32:10,130 INFO L226 Difference]: Without dead ends: 19550 [2019-09-08 12:32:10,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 123.6s TimeCoverageRelationStatistics Valid=779, Invalid=4477, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 12:32:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19550 states. [2019-09-08 12:32:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19550 to 3044. [2019-09-08 12:32:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3044 states. [2019-09-08 12:32:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4364 transitions. [2019-09-08 12:32:11,435 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4364 transitions. Word has length 109 [2019-09-08 12:32:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:11,435 INFO L475 AbstractCegarLoop]: Abstraction has 3044 states and 4364 transitions. [2019-09-08 12:32:11,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:32:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4364 transitions. [2019-09-08 12:32:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:32:11,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:11,437 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:11,437 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1165404091, now seen corresponding path program 1 times [2019-09-08 12:32:11,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:11,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:11,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:32:12,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:32:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:32:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:32:12,477 INFO L87 Difference]: Start difference. First operand 3044 states and 4364 transitions. Second operand 19 states. [2019-09-08 12:32:13,063 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 12:32:13,297 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:32:13,595 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-08 12:32:14,023 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-08 12:32:14,191 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 12:32:14,599 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 12:32:14,909 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:32:15,082 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:32:15,352 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:32:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:20,937 INFO L93 Difference]: Finished difference Result 14115 states and 20479 transitions. [2019-09-08 12:32:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:32:20,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-08 12:32:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:20,949 INFO L225 Difference]: With dead ends: 14115 [2019-09-08 12:32:20,949 INFO L226 Difference]: Without dead ends: 12748 [2019-09-08 12:32:20,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:32:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12748 states. [2019-09-08 12:32:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12748 to 3023. [2019-09-08 12:32:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3023 states. [2019-09-08 12:32:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4336 transitions. [2019-09-08 12:32:22,189 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4336 transitions. Word has length 109 [2019-09-08 12:32:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:22,189 INFO L475 AbstractCegarLoop]: Abstraction has 3023 states and 4336 transitions. [2019-09-08 12:32:22,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:32:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4336 transitions. [2019-09-08 12:32:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:32:22,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:22,190 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:22,191 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2037834854, now seen corresponding path program 1 times [2019-09-08 12:32:22,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:22,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:23,031 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:32:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:23,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:23,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 12:32:23,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:32:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:32:23,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:32:23,706 INFO L87 Difference]: Start difference. First operand 3023 states and 4336 transitions. Second operand 23 states. [2019-09-08 12:32:24,765 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:32:24,989 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-08 12:32:25,319 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-08 12:32:25,718 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-09-08 12:32:26,208 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 106 [2019-09-08 12:32:26,445 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:32:26,692 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:32:27,023 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:32:27,246 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 12:32:27,499 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 12:32:27,871 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:32:28,186 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:32:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:37,470 INFO L93 Difference]: Finished difference Result 16695 states and 24222 transitions. [2019-09-08 12:32:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:32:37,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2019-09-08 12:32:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:37,485 INFO L225 Difference]: With dead ends: 16695 [2019-09-08 12:32:37,485 INFO L226 Difference]: Without dead ends: 15274 [2019-09-08 12:32:37,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=440, Invalid=1540, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:32:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-09-08 12:32:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 3000. [2019-09-08 12:32:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-09-08 12:32:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4302 transitions. [2019-09-08 12:32:38,879 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4302 transitions. Word has length 109 [2019-09-08 12:32:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:38,879 INFO L475 AbstractCegarLoop]: Abstraction has 3000 states and 4302 transitions. [2019-09-08 12:32:38,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 12:32:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4302 transitions. [2019-09-08 12:32:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:32:38,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:38,880 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:38,881 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1244058685, now seen corresponding path program 1 times [2019-09-08 12:32:38,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:39,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:39,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:32:39,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:32:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:32:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:32:39,434 INFO L87 Difference]: Start difference. First operand 3000 states and 4302 transitions. Second operand 13 states. [2019-09-08 12:32:39,735 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-08 12:32:39,880 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:32:40,034 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:32:40,331 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:32:40,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:32:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:45,951 INFO L93 Difference]: Finished difference Result 12549 states and 18172 transitions. [2019-09-08 12:32:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:45,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:32:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:45,961 INFO L225 Difference]: With dead ends: 12549 [2019-09-08 12:32:45,962 INFO L226 Difference]: Without dead ends: 11127 [2019-09-08 12:32:45,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:32:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11127 states. [2019-09-08 12:32:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11127 to 2964. [2019-09-08 12:32:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2019-09-08 12:32:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4254 transitions. [2019-09-08 12:32:47,461 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4254 transitions. Word has length 110 [2019-09-08 12:32:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:47,461 INFO L475 AbstractCegarLoop]: Abstraction has 2964 states and 4254 transitions. [2019-09-08 12:32:47,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:32:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4254 transitions. [2019-09-08 12:32:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:32:47,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:47,462 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:47,462 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash -325705726, now seen corresponding path program 1 times [2019-09-08 12:32:47,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:48,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:32:48,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:32:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:32:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:32:48,376 INFO L87 Difference]: Start difference. First operand 2964 states and 4254 transitions. Second operand 19 states. [2019-09-08 12:32:48,989 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:32:49,206 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:32:49,504 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 12:32:49,826 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 12:32:50,011 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:32:50,358 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:32:50,609 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:32:50,850 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:32:51,091 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:32:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:57,678 INFO L93 Difference]: Finished difference Result 12465 states and 18084 transitions. [2019-09-08 12:32:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:32:57,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-09-08 12:32:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:57,689 INFO L225 Difference]: With dead ends: 12465 [2019-09-08 12:32:57,689 INFO L226 Difference]: Without dead ends: 11470 [2019-09-08 12:32:57,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:32:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2019-09-08 12:32:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 2969. [2019-09-08 12:32:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2019-09-08 12:32:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4255 transitions. [2019-09-08 12:32:59,197 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4255 transitions. Word has length 110 [2019-09-08 12:32:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:59,198 INFO L475 AbstractCegarLoop]: Abstraction has 2969 states and 4255 transitions. [2019-09-08 12:32:59,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:32:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4255 transitions. [2019-09-08 12:32:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:32:59,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:59,199 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:59,200 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash -823899427, now seen corresponding path program 1 times [2019-09-08 12:32:59,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:59,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:59,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:59,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:33:00,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:33:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:33:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:33:00,989 INFO L87 Difference]: Start difference. First operand 2969 states and 4255 transitions. Second operand 24 states. [2019-09-08 12:33:02,275 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-08 12:33:02,500 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-08 12:33:02,820 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-09-08 12:33:03,221 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2019-09-08 12:33:03,784 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 114 [2019-09-08 12:33:04,052 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:33:04,316 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:33:04,545 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-08 12:33:04,961 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-08 12:33:06,055 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-08 12:33:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:16,853 INFO L93 Difference]: Finished difference Result 17598 states and 25544 transitions. [2019-09-08 12:33:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:33:16,853 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 110 [2019-09-08 12:33:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:16,869 INFO L225 Difference]: With dead ends: 17598 [2019-09-08 12:33:16,869 INFO L226 Difference]: Without dead ends: 16623 [2019-09-08 12:33:16,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 12:33:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16623 states. [2019-09-08 12:33:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16623 to 2985. [2019-09-08 12:33:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2019-09-08 12:33:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4275 transitions. [2019-09-08 12:33:18,436 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4275 transitions. Word has length 110 [2019-09-08 12:33:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:18,436 INFO L475 AbstractCegarLoop]: Abstraction has 2985 states and 4275 transitions. [2019-09-08 12:33:18,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:33:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4275 transitions. [2019-09-08 12:33:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:33:18,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:18,437 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:18,438 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1409895325, now seen corresponding path program 1 times [2019-09-08 12:33:18,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:33:18,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:33:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:33:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:33:18,931 INFO L87 Difference]: Start difference. First operand 2985 states and 4275 transitions. Second operand 12 states. [2019-09-08 12:33:19,427 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-08 12:33:19,601 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:33:19,768 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:33:19,949 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:33:20,100 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:33:20,706 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 12:33:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:27,581 INFO L93 Difference]: Finished difference Result 13978 states and 20283 transitions. [2019-09-08 12:33:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:33:27,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-08 12:33:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:27,594 INFO L225 Difference]: With dead ends: 13978 [2019-09-08 12:33:27,594 INFO L226 Difference]: Without dead ends: 12556 [2019-09-08 12:33:27,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:33:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12556 states. [2019-09-08 12:33:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12556 to 2807. [2019-09-08 12:33:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2807 states. [2019-09-08 12:33:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 4027 transitions. [2019-09-08 12:33:29,248 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 4027 transitions. Word has length 110 [2019-09-08 12:33:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:29,248 INFO L475 AbstractCegarLoop]: Abstraction has 2807 states and 4027 transitions. [2019-09-08 12:33:29,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:33:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 4027 transitions. [2019-09-08 12:33:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:33:29,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:29,249 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:29,250 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1071046942, now seen corresponding path program 1 times [2019-09-08 12:33:29,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:29,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:29,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:29,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:33:29,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:33:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:33:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:33:29,750 INFO L87 Difference]: Start difference. First operand 2807 states and 4027 transitions. Second operand 12 states. [2019-09-08 12:33:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:36,735 INFO L93 Difference]: Finished difference Result 12138 states and 17593 transitions. [2019-09-08 12:33:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:33:36,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-08 12:33:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:36,745 INFO L225 Difference]: With dead ends: 12138 [2019-09-08 12:33:36,746 INFO L226 Difference]: Without dead ends: 10736 [2019-09-08 12:33:36,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10736 states. [2019-09-08 12:33:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10736 to 2771. [2019-09-08 12:33:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2019-09-08 12:33:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3982 transitions. [2019-09-08 12:33:38,413 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3982 transitions. Word has length 111 [2019-09-08 12:33:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:38,413 INFO L475 AbstractCegarLoop]: Abstraction has 2771 states and 3982 transitions. [2019-09-08 12:33:38,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:33:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3982 transitions. [2019-09-08 12:33:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:33:38,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:38,415 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:38,415 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 611351621, now seen corresponding path program 1 times [2019-09-08 12:33:38,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:38,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:33:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:33:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:33:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:33:39,353 INFO L87 Difference]: Start difference. First operand 2771 states and 3982 transitions. Second operand 18 states. [2019-09-08 12:33:40,075 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 12:33:40,281 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:33:40,586 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-08 12:33:40,779 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:33:41,020 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:33:41,247 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:33:41,444 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:33:41,818 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 12:33:42,062 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:33:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:54,237 INFO L93 Difference]: Finished difference Result 19774 states and 28755 transitions. [2019-09-08 12:33:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:33:54,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2019-09-08 12:33:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:54,253 INFO L225 Difference]: With dead ends: 19774 [2019-09-08 12:33:54,254 INFO L226 Difference]: Without dead ends: 18799 [2019-09-08 12:33:54,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:33:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18799 states. [2019-09-08 12:33:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18799 to 2772. [2019-09-08 12:33:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2019-09-08 12:33:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3983 transitions. [2019-09-08 12:33:55,993 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3983 transitions. Word has length 111 [2019-09-08 12:33:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:55,993 INFO L475 AbstractCegarLoop]: Abstraction has 2772 states and 3983 transitions. [2019-09-08 12:33:55,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:33:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3983 transitions. [2019-09-08 12:33:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:33:55,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:55,994 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:55,995 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash -530919988, now seen corresponding path program 1 times [2019-09-08 12:33:55,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:55,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:55,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:33:56,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:33:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:33:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:33:56,540 INFO L87 Difference]: Start difference. First operand 2772 states and 3983 transitions. Second operand 13 states. [2019-09-08 12:33:56,961 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:33:57,116 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:33:57,272 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:33:57,604 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:33:57,822 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:34:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:04,805 INFO L93 Difference]: Finished difference Result 12013 states and 17440 transitions. [2019-09-08 12:34:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:04,806 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2019-09-08 12:34:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:04,816 INFO L225 Difference]: With dead ends: 12013 [2019-09-08 12:34:04,816 INFO L226 Difference]: Without dead ends: 10642 [2019-09-08 12:34:04,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:34:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10642 states. [2019-09-08 12:34:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10642 to 2766. [2019-09-08 12:34:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:34:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3975 transitions. [2019-09-08 12:34:06,638 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3975 transitions. Word has length 111 [2019-09-08 12:34:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:06,638 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3975 transitions. [2019-09-08 12:34:06,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:34:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3975 transitions. [2019-09-08 12:34:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:34:06,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:06,640 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:06,640 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -106667668, now seen corresponding path program 1 times [2019-09-08 12:34:06,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:07,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:34:07,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:34:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:34:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:34:07,110 INFO L87 Difference]: Start difference. First operand 2766 states and 3975 transitions. Second operand 12 states. [2019-09-08 12:34:07,539 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:34:07,689 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:34:07,857 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:34:08,169 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:34:08,390 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:34:08,535 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:34:09,813 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-08 12:34:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:17,910 INFO L93 Difference]: Finished difference Result 14255 states and 20700 transitions. [2019-09-08 12:34:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:34:17,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-08 12:34:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:17,923 INFO L225 Difference]: With dead ends: 14255 [2019-09-08 12:34:17,923 INFO L226 Difference]: Without dead ends: 13260 [2019-09-08 12:34:17,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:34:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13260 states. [2019-09-08 12:34:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13260 to 2744. [2019-09-08 12:34:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-09-08 12:34:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3948 transitions. [2019-09-08 12:34:19,825 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3948 transitions. Word has length 111 [2019-09-08 12:34:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:19,826 INFO L475 AbstractCegarLoop]: Abstraction has 2744 states and 3948 transitions. [2019-09-08 12:34:19,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:34:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3948 transitions. [2019-09-08 12:34:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:34:19,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:19,826 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:19,827 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1526289660, now seen corresponding path program 1 times [2019-09-08 12:34:19,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:20,443 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:34:21,494 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:34:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:22,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:22,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:34:22,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:34:22,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:34:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:34:22,708 INFO L87 Difference]: Start difference. First operand 2744 states and 3948 transitions. Second operand 33 states. [2019-09-08 12:34:24,011 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 12:34:24,204 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:34:24,462 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:34:24,721 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:34:25,028 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:34:25,354 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-08 12:34:25,762 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-08 12:34:26,189 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-08 12:34:26,762 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-08 12:34:27,395 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 125 [2019-09-08 12:34:27,620 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-08 12:34:27,848 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-08 12:34:29,934 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 12:34:30,961 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 12:34:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:50,869 INFO L93 Difference]: Finished difference Result 22770 states and 33134 transitions. [2019-09-08 12:34:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 12:34:50,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 111 [2019-09-08 12:34:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:50,890 INFO L225 Difference]: With dead ends: 22770 [2019-09-08 12:34:50,890 INFO L226 Difference]: Without dead ends: 21796 [2019-09-08 12:34:50,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=723, Invalid=3699, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 12:34:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21796 states. [2019-09-08 12:34:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21796 to 2756. [2019-09-08 12:34:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2019-09-08 12:34:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3963 transitions. [2019-09-08 12:34:53,030 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3963 transitions. Word has length 111 [2019-09-08 12:34:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:53,031 INFO L475 AbstractCegarLoop]: Abstraction has 2756 states and 3963 transitions. [2019-09-08 12:34:53,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:34:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3963 transitions. [2019-09-08 12:34:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:34:53,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:53,031 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:53,031 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash -302657023, now seen corresponding path program 1 times [2019-09-08 12:34:53,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:54,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:54,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:34:54,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:34:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:34:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:34:54,557 INFO L87 Difference]: Start difference. First operand 2756 states and 3963 transitions. Second operand 26 states. [2019-09-08 12:34:55,711 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:34:55,902 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:34:56,148 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:34:56,427 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-08 12:34:56,799 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-09-08 12:34:57,207 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-08 12:34:57,363 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:34:57,516 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:34:59,556 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:35:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:16,222 INFO L93 Difference]: Finished difference Result 20463 states and 29803 transitions. [2019-09-08 12:35:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:35:16,222 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2019-09-08 12:35:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:16,242 INFO L225 Difference]: With dead ends: 20463 [2019-09-08 12:35:16,242 INFO L226 Difference]: Without dead ends: 19489 [2019-09-08 12:35:16,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=414, Invalid=2136, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:35:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19489 states. [2019-09-08 12:35:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19489 to 2752. [2019-09-08 12:35:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-09-08 12:35:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3958 transitions. [2019-09-08 12:35:18,362 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3958 transitions. Word has length 112 [2019-09-08 12:35:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:18,362 INFO L475 AbstractCegarLoop]: Abstraction has 2752 states and 3958 transitions. [2019-09-08 12:35:18,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:35:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3958 transitions. [2019-09-08 12:35:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:35:18,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:18,363 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:18,363 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1054557246, now seen corresponding path program 1 times [2019-09-08 12:35:18,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:18,798 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-08 12:35:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:19,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:19,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:35:19,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:35:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:35:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:35:19,194 INFO L87 Difference]: Start difference. First operand 2752 states and 3958 transitions. Second operand 13 states. [2019-09-08 12:35:19,660 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-09-08 12:35:19,870 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:35:20,031 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:35:20,204 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:35:20,475 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-08 12:35:20,734 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-08 12:35:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:29,279 INFO L93 Difference]: Finished difference Result 11568 states and 16802 transitions. [2019-09-08 12:35:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:29,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-08 12:35:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:29,290 INFO L225 Difference]: With dead ends: 11568 [2019-09-08 12:35:29,290 INFO L226 Difference]: Without dead ends: 10594 [2019-09-08 12:35:29,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:35:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10594 states. [2019-09-08 12:35:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10594 to 2718. [2019-09-08 12:35:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-09-08 12:35:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3916 transitions. [2019-09-08 12:35:31,461 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3916 transitions. Word has length 112 [2019-09-08 12:35:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:31,461 INFO L475 AbstractCegarLoop]: Abstraction has 2718 states and 3916 transitions. [2019-09-08 12:35:31,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:35:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3916 transitions. [2019-09-08 12:35:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:35:31,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:31,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:31,463 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -95034080, now seen corresponding path program 1 times [2019-09-08 12:35:31,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:31,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:31,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:31,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:31,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:31,524 INFO L87 Difference]: Start difference. First operand 2718 states and 3916 transitions. Second operand 3 states. [2019-09-08 12:35:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:35,678 INFO L93 Difference]: Finished difference Result 7778 states and 11240 transitions. [2019-09-08 12:35:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:35,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:35:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:35,683 INFO L225 Difference]: With dead ends: 7778 [2019-09-08 12:35:35,683 INFO L226 Difference]: Without dead ends: 5168 [2019-09-08 12:35:35,686 INFO L628 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 [2019-09-08 12:35:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-09-08 12:35:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5006. [2019-09-08 12:35:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5006 states. [2019-09-08 12:35:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7197 transitions. [2019-09-08 12:35:39,652 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7197 transitions. Word has length 142 [2019-09-08 12:35:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:39,652 INFO L475 AbstractCegarLoop]: Abstraction has 5006 states and 7197 transitions. [2019-09-08 12:35:39,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7197 transitions. [2019-09-08 12:35:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:35:39,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:39,654 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:39,654 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1750292162, now seen corresponding path program 1 times [2019-09-08 12:35:39,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:39,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:39,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:39,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:39,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:39,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:39,722 INFO L87 Difference]: Start difference. First operand 5006 states and 7197 transitions. Second operand 3 states. [2019-09-08 12:35:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:47,538 INFO L93 Difference]: Finished difference Result 14482 states and 20803 transitions. [2019-09-08 12:35:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:47,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 12:35:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:47,548 INFO L225 Difference]: With dead ends: 14482 [2019-09-08 12:35:47,548 INFO L226 Difference]: Without dead ends: 9584 [2019-09-08 12:35:47,554 INFO L628 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 [2019-09-08 12:35:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-09-08 12:35:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 9262. [2019-09-08 12:35:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9262 states. [2019-09-08 12:35:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 13239 transitions. [2019-09-08 12:35:55,039 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 13239 transitions. Word has length 143 [2019-09-08 12:35:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:55,040 INFO L475 AbstractCegarLoop]: Abstraction has 9262 states and 13239 transitions. [2019-09-08 12:35:55,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 13239 transitions. [2019-09-08 12:35:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:35:55,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:55,042 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:55,042 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:55,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1032243921, now seen corresponding path program 1 times [2019-09-08 12:35:55,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:55,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:55,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:55,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:55,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:55,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:55,125 INFO L87 Difference]: Start difference. First operand 9262 states and 13239 transitions. Second operand 3 states. [2019-09-08 12:36:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:09,748 INFO L93 Difference]: Finished difference Result 26930 states and 38369 transitions. [2019-09-08 12:36:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:36:09,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:36:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:09,765 INFO L225 Difference]: With dead ends: 26930 [2019-09-08 12:36:09,765 INFO L226 Difference]: Without dead ends: 17776 [2019-09-08 12:36:09,776 INFO L628 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 [2019-09-08 12:36:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17776 states. [2019-09-08 12:36:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17776 to 17134. [2019-09-08 12:36:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17134 states. [2019-09-08 12:36:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17134 states to 17134 states and 24283 transitions. [2019-09-08 12:36:23,932 INFO L78 Accepts]: Start accepts. Automaton has 17134 states and 24283 transitions. Word has length 144 [2019-09-08 12:36:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:23,932 INFO L475 AbstractCegarLoop]: Abstraction has 17134 states and 24283 transitions. [2019-09-08 12:36:23,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:36:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17134 states and 24283 transitions. [2019-09-08 12:36:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:36:23,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:23,934 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:23,934 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 897083338, now seen corresponding path program 1 times [2019-09-08 12:36:23,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:23,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:23,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:24,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:36:24,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:36:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:36:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:36:24,005 INFO L87 Difference]: Start difference. First operand 17134 states and 24283 transitions. Second operand 3 states. [2019-09-08 12:36:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:51,964 INFO L93 Difference]: Finished difference Result 49906 states and 70381 transitions. [2019-09-08 12:36:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:36:51,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 12:36:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:51,997 INFO L225 Difference]: With dead ends: 49906 [2019-09-08 12:36:51,997 INFO L226 Difference]: Without dead ends: 32880 [2019-09-08 12:36:52,011 INFO L628 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 [2019-09-08 12:36:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32880 states. [2019-09-08 12:37:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32880 to 31598. [2019-09-08 12:37:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31598 states. [2019-09-08 12:37:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31598 states to 31598 states and 44291 transitions. [2019-09-08 12:37:18,389 INFO L78 Accepts]: Start accepts. Automaton has 31598 states and 44291 transitions. Word has length 145 [2019-09-08 12:37:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:18,389 INFO L475 AbstractCegarLoop]: Abstraction has 31598 states and 44291 transitions. [2019-09-08 12:37:18,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 31598 states and 44291 transitions. [2019-09-08 12:37:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:37:18,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:18,391 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:18,391 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash 691630939, now seen corresponding path program 1 times [2019-09-08 12:37:18,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:18,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:18,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:18,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:18,463 INFO L87 Difference]: Start difference. First operand 31598 states and 44291 transitions. Second operand 3 states. [2019-09-08 12:38:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:08,965 INFO L93 Difference]: Finished difference Result 92018 states and 128165 transitions. [2019-09-08 12:38:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:38:08,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:38:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:09,050 INFO L225 Difference]: With dead ends: 92018 [2019-09-08 12:38:09,050 INFO L226 Difference]: Without dead ends: 60528 [2019-09-08 12:38:09,083 INFO L628 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 [2019-09-08 12:38:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60528 states. [2019-09-08 12:38:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60528 to 57966. [2019-09-08 12:38:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57966 states. [2019-09-08 12:38:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57966 states to 57966 states and 80147 transitions. [2019-09-08 12:38:56,386 INFO L78 Accepts]: Start accepts. Automaton has 57966 states and 80147 transitions. Word has length 146 [2019-09-08 12:38:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:56,386 INFO L475 AbstractCegarLoop]: Abstraction has 57966 states and 80147 transitions. [2019-09-08 12:38:56,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:38:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57966 states and 80147 transitions. [2019-09-08 12:38:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:38:56,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:56,388 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:56,388 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1419593903, now seen corresponding path program 1 times [2019-09-08 12:38:56,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:56,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:56,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:38:56,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:38:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:38:56,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:38:56,477 INFO L87 Difference]: Start difference. First operand 57966 states and 80147 transitions. Second operand 3 states. [2019-09-08 12:40:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:04,032 INFO L93 Difference]: Finished difference Result 123231 states and 170660 transitions. [2019-09-08 12:40:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:04,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 12:40:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:04,122 INFO L225 Difference]: With dead ends: 123231 [2019-09-08 12:40:04,123 INFO L226 Difference]: Without dead ends: 81981 [2019-09-08 12:40:04,161 INFO L628 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 [2019-09-08 12:40:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81981 states. [2019-09-08 12:41:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81981 to 78519. [2019-09-08 12:41:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78519 states. [2019-09-08 12:41:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78519 states to 78519 states and 108060 transitions. [2019-09-08 12:41:08,929 INFO L78 Accepts]: Start accepts. Automaton has 78519 states and 108060 transitions. Word has length 147 [2019-09-08 12:41:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:08,929 INFO L475 AbstractCegarLoop]: Abstraction has 78519 states and 108060 transitions. [2019-09-08 12:41:08,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 78519 states and 108060 transitions. [2019-09-08 12:41:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:41:08,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:08,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:08,937 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1036797970, now seen corresponding path program 1 times [2019-09-08 12:41:08,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:41:09,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:41:09,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 12:41:09,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:09,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 12:41:09,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:41:09,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:41:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:41:10,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-09-08 12:41:10,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:41:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:41:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:41:10,087 INFO L87 Difference]: Start difference. First operand 78519 states and 108060 transitions. Second operand 14 states.