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.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:37:04,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:37:04,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:37:04,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:37:04,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:37:04,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:37:04,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:37:04,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:37:04,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:37:04,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:37:04,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:37:04,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:37:04,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:37:04,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:37:04,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:37:04,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:37:04,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:37:04,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:37:04,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:37:04,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:37:04,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:37:04,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:37:04,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:37:04,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:37:04,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:37:04,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:37:04,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:37:04,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:37:04,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:37:04,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:37:04,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:37:04,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:37:04,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:37:04,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:37:04,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:37:04,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:37:04,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:37:04,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:37:04,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:37:04,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:37:04,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:37:04,498 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:37:04,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:37:04,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:37:04,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:37:04,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:37:04,522 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:37:04,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:37:04,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:37:04,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:37:04,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:37:04,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:37:04,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:37:04,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:37:04,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:37:04,525 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:37:04,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:37:04,525 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:37:04,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:37:04,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:37:04,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:37:04,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:37:04,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:37:04,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:37:04,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:37:04,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:37:04,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:37:04,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:37:04,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:37:04,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:37:04,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:37:04,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:37:04,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:37:04,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:37:04,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:37:04,582 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:37:04,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:37:04,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8fe5c79/be9dc8bdadc045ce8eea50ea0a94d9bc/FLAG244d2bf5f [2019-09-08 12:37:05,212 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:37:05,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:37:05,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8fe5c79/be9dc8bdadc045ce8eea50ea0a94d9bc/FLAG244d2bf5f [2019-09-08 12:37:05,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8fe5c79/be9dc8bdadc045ce8eea50ea0a94d9bc [2019-09-08 12:37:05,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:37:05,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:37:05,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:05,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:37:05,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:37:05,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:05" (1/1) ... [2019-09-08 12:37:05,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa3d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:05, skipping insertion in model container [2019-09-08 12:37:05,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:05" (1/1) ... [2019-09-08 12:37:05,531 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:37:05,591 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:37:06,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:06,314 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:37:06,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:06,472 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:37:06,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06 WrapperNode [2019-09-08 12:37:06,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:06,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:37:06,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:37:06,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:37:06,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (1/1) ... [2019-09-08 12:37:06,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:37:06,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:37:06,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:37:06,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:37:06,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (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:37:06,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:37:06,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:37:06,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:37:06,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:37:06,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:37:06,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:37:06,618 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:37:06,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:37:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:37:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:37:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:37:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:37:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:37:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:37:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:37:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:37:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:37:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:37:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:37:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:37:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:37:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:37:07,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:37:07,629 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:37:07,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:07 BoogieIcfgContainer [2019-09-08 12:37:07,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:37:07,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:37:07,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:37:07,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:37:07,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:37:05" (1/3) ... [2019-09-08 12:37:07,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15065a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:07, skipping insertion in model container [2019-09-08 12:37:07,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06" (2/3) ... [2019-09-08 12:37:07,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15065a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:07, skipping insertion in model container [2019-09-08 12:37:07,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:07" (3/3) ... [2019-09-08 12:37:07,638 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:37:07,648 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:37:07,671 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:37:07,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:37:07,717 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:37:07,717 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:37:07,717 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:37:07,718 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:37:07,718 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:37:07,718 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:37:07,718 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:37:07,718 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:37:07,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:37:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-09-08 12:37:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:37:07,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:07,756 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1051248920, now seen corresponding path program 1 times [2019-09-08 12:37:07,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:08,337 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:37:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:08,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:08,366 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-09-08 12:37:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:08,550 INFO L93 Difference]: Finished difference Result 399 states and 662 transitions. [2019-09-08 12:37:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:08,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:37:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:08,570 INFO L225 Difference]: With dead ends: 399 [2019-09-08 12:37:08,571 INFO L226 Difference]: Without dead ends: 306 [2019-09-08 12:37:08,575 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:37:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-08 12:37:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-08 12:37:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:37:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2019-09-08 12:37:08,652 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 112 [2019-09-08 12:37:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:08,653 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2019-09-08 12:37:08,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2019-09-08 12:37:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:37:08,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:08,657 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, 1, 1] [2019-09-08 12:37:08,657 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash -458569337, now seen corresponding path program 1 times [2019-09-08 12:37:08,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:08,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:08,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:08,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:08,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:08,903 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:37:08,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:08,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:08,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:08,907 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand 5 states. [2019-09-08 12:37:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:09,375 INFO L93 Difference]: Finished difference Result 750 states and 1126 transitions. [2019-09-08 12:37:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:09,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-08 12:37:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:09,384 INFO L225 Difference]: With dead ends: 750 [2019-09-08 12:37:09,385 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 12:37:09,392 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:37:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 12:37:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2019-09-08 12:37:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 750 transitions. [2019-09-08 12:37:09,467 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 750 transitions. Word has length 114 [2019-09-08 12:37:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:09,467 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 750 transitions. [2019-09-08 12:37:09,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 750 transitions. [2019-09-08 12:37:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:37:09,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:09,478 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, 1, 1, 1] [2019-09-08 12:37:09,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 140292373, now seen corresponding path program 1 times [2019-09-08 12:37:09,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:09,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:09,662 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:37:09,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:09,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:09,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:09,667 INFO L87 Difference]: Start difference. First operand 505 states and 750 transitions. Second operand 5 states. [2019-09-08 12:37:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:09,903 INFO L93 Difference]: Finished difference Result 945 states and 1434 transitions. [2019-09-08 12:37:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:09,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-08 12:37:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:09,907 INFO L225 Difference]: With dead ends: 945 [2019-09-08 12:37:09,907 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:09,910 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:37:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 745 transitions. [2019-09-08 12:37:09,943 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 745 transitions. Word has length 115 [2019-09-08 12:37:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:09,944 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 745 transitions. [2019-09-08 12:37:09,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 745 transitions. [2019-09-08 12:37:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:37:09,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:09,965 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, 1, 1, 1, 1] [2019-09-08 12:37:09,965 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1606063222, now seen corresponding path program 1 times [2019-09-08 12:37:09,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:09,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:10,088 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:37:10,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:10,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:10,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:10,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:10,090 INFO L87 Difference]: Start difference. First operand 505 states and 745 transitions. Second operand 5 states. [2019-09-08 12:37:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:10,293 INFO L93 Difference]: Finished difference Result 925 states and 1400 transitions. [2019-09-08 12:37:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:10,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:37:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:10,298 INFO L225 Difference]: With dead ends: 925 [2019-09-08 12:37:10,299 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:10,301 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:37:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 740 transitions. [2019-09-08 12:37:10,335 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 740 transitions. Word has length 116 [2019-09-08 12:37:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:10,336 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 740 transitions. [2019-09-08 12:37:10,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 740 transitions. [2019-09-08 12:37:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:37:10,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:10,338 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, 1, 1, 1, 1, 1] [2019-09-08 12:37:10,339 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1122053542, now seen corresponding path program 1 times [2019-09-08 12:37:10,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:10,454 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:37:10,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:10,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:10,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:10,456 INFO L87 Difference]: Start difference. First operand 505 states and 740 transitions. Second operand 5 states. [2019-09-08 12:37:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:10,706 INFO L93 Difference]: Finished difference Result 937 states and 1405 transitions. [2019-09-08 12:37:10,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:10,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-08 12:37:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:10,710 INFO L225 Difference]: With dead ends: 937 [2019-09-08 12:37:10,710 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:10,712 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:37:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 735 transitions. [2019-09-08 12:37:10,742 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 735 transitions. Word has length 117 [2019-09-08 12:37:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:10,742 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 735 transitions. [2019-09-08 12:37:10,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 735 transitions. [2019-09-08 12:37:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:37:10,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:10,744 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:10,745 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1734849881, now seen corresponding path program 1 times [2019-09-08 12:37:10,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:10,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:10,852 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:37:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:10,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:10,854 INFO L87 Difference]: Start difference. First operand 505 states and 735 transitions. Second operand 5 states. [2019-09-08 12:37:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:11,071 INFO L93 Difference]: Finished difference Result 933 states and 1391 transitions. [2019-09-08 12:37:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:11,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-08 12:37:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:11,076 INFO L225 Difference]: With dead ends: 933 [2019-09-08 12:37:11,076 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:11,078 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:37:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 730 transitions. [2019-09-08 12:37:11,108 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 730 transitions. Word has length 118 [2019-09-08 12:37:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:11,110 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 730 transitions. [2019-09-08 12:37:11,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 730 transitions. [2019-09-08 12:37:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:37:11,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:11,112 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:11,113 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1494263947, now seen corresponding path program 1 times [2019-09-08 12:37:11,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:11,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:11,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:11,273 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:37:11,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:11,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:11,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:11,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:11,277 INFO L87 Difference]: Start difference. First operand 505 states and 730 transitions. Second operand 5 states. [2019-09-08 12:37:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:11,518 INFO L93 Difference]: Finished difference Result 941 states and 1390 transitions. [2019-09-08 12:37:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:11,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 12:37:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:11,522 INFO L225 Difference]: With dead ends: 941 [2019-09-08 12:37:11,523 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:11,524 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:37:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 725 transitions. [2019-09-08 12:37:11,560 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 725 transitions. Word has length 119 [2019-09-08 12:37:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:11,560 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 725 transitions. [2019-09-08 12:37:11,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 725 transitions. [2019-09-08 12:37:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:11,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:11,562 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:11,563 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 776973317, now seen corresponding path program 1 times [2019-09-08 12:37:11,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:11,676 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:37:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:11,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:11,679 INFO L87 Difference]: Start difference. First operand 505 states and 725 transitions. Second operand 5 states. [2019-09-08 12:37:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:11,936 INFO L93 Difference]: Finished difference Result 929 states and 1368 transitions. [2019-09-08 12:37:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:11,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:37:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:11,941 INFO L225 Difference]: With dead ends: 929 [2019-09-08 12:37:11,941 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:37:11,943 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:37:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:37:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:37:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:37:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 720 transitions. [2019-09-08 12:37:11,990 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 720 transitions. Word has length 120 [2019-09-08 12:37:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:11,990 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 720 transitions. [2019-09-08 12:37:11,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 720 transitions. [2019-09-08 12:37:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:11,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:11,994 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash -510022136, now seen corresponding path program 1 times [2019-09-08 12:37:11,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:11,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:12,370 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:37:12,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:12,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:12,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:12,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:12,372 INFO L87 Difference]: Start difference. First operand 505 states and 720 transitions. Second operand 9 states. [2019-09-08 12:37:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:12,939 INFO L93 Difference]: Finished difference Result 2882 states and 4287 transitions. [2019-09-08 12:37:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:12,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:37:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:12,955 INFO L225 Difference]: With dead ends: 2882 [2019-09-08 12:37:12,955 INFO L226 Difference]: Without dead ends: 2572 [2019-09-08 12:37:12,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:37:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-08 12:37:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 658. [2019-09-08 12:37:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 12:37:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 951 transitions. [2019-09-08 12:37:13,055 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 951 transitions. Word has length 121 [2019-09-08 12:37:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:13,056 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 951 transitions. [2019-09-08 12:37:13,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 951 transitions. [2019-09-08 12:37:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:13,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:13,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:13,058 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 780943061, now seen corresponding path program 1 times [2019-09-08 12:37:13,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:13,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:13,324 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:37:13,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:13,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:13,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:13,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:13,326 INFO L87 Difference]: Start difference. First operand 658 states and 951 transitions. Second operand 9 states. [2019-09-08 12:37:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:13,892 INFO L93 Difference]: Finished difference Result 3052 states and 4546 transitions. [2019-09-08 12:37:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:13,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:37:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:13,914 INFO L225 Difference]: With dead ends: 3052 [2019-09-08 12:37:13,914 INFO L226 Difference]: Without dead ends: 2742 [2019-09-08 12:37:13,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:37:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-08 12:37:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1048. [2019-09-08 12:37:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-08 12:37:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1545 transitions. [2019-09-08 12:37:14,077 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1545 transitions. Word has length 121 [2019-09-08 12:37:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:14,077 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1545 transitions. [2019-09-08 12:37:14,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1545 transitions. [2019-09-08 12:37:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:14,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:14,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:14,081 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash -909475221, now seen corresponding path program 1 times [2019-09-08 12:37:14,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:14,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:14,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:14,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:14,404 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:37:14,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:14,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:14,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:14,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:14,406 INFO L87 Difference]: Start difference. First operand 1048 states and 1545 transitions. Second operand 9 states. [2019-09-08 12:37:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:14,993 INFO L93 Difference]: Finished difference Result 3192 states and 4759 transitions. [2019-09-08 12:37:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:14,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:37:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:15,008 INFO L225 Difference]: With dead ends: 3192 [2019-09-08 12:37:15,008 INFO L226 Difference]: Without dead ends: 2882 [2019-09-08 12:37:15,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:37:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2019-09-08 12:37:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1218. [2019-09-08 12:37:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-08 12:37:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1802 transitions. [2019-09-08 12:37:15,172 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1802 transitions. Word has length 121 [2019-09-08 12:37:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:15,172 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1802 transitions. [2019-09-08 12:37:15,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1802 transitions. [2019-09-08 12:37:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:15,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:15,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:15,175 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:15,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1121640156, now seen corresponding path program 1 times [2019-09-08 12:37:15,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:15,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:15,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:15,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:15,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:15,387 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:37:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:15,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:15,389 INFO L87 Difference]: Start difference. First operand 1218 states and 1802 transitions. Second operand 9 states. [2019-09-08 12:37:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:16,080 INFO L93 Difference]: Finished difference Result 3332 states and 4970 transitions. [2019-09-08 12:37:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:16,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:37:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:16,095 INFO L225 Difference]: With dead ends: 3332 [2019-09-08 12:37:16,095 INFO L226 Difference]: Without dead ends: 3022 [2019-09-08 12:37:16,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:37:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-08 12:37:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1378. [2019-09-08 12:37:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-09-08 12:37:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2043 transitions. [2019-09-08 12:37:16,292 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2043 transitions. Word has length 121 [2019-09-08 12:37:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:16,292 INFO L475 AbstractCegarLoop]: Abstraction has 1378 states and 2043 transitions. [2019-09-08 12:37:16,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2043 transitions. [2019-09-08 12:37:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:16,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:16,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:16,295 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2117519461, now seen corresponding path program 1 times [2019-09-08 12:37:16,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:16,388 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:37:16,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:16,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:16,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:16,390 INFO L87 Difference]: Start difference. First operand 1378 states and 2043 transitions. Second operand 3 states. [2019-09-08 12:37:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:16,788 INFO L93 Difference]: Finished difference Result 3270 states and 4899 transitions. [2019-09-08 12:37:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:16,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:37:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:16,798 INFO L225 Difference]: With dead ends: 3270 [2019-09-08 12:37:16,799 INFO L226 Difference]: Without dead ends: 2170 [2019-09-08 12:37:16,802 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:37:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-09-08 12:37:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2168. [2019-09-08 12:37:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-09-08 12:37:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3214 transitions. [2019-09-08 12:37:17,081 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3214 transitions. Word has length 121 [2019-09-08 12:37:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:17,081 INFO L475 AbstractCegarLoop]: Abstraction has 2168 states and 3214 transitions. [2019-09-08 12:37:17,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3214 transitions. [2019-09-08 12:37:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:17,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:17,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:17,084 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1936230108, now seen corresponding path program 1 times [2019-09-08 12:37:17,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:17,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:17,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:17,169 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:37:17,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:17,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:17,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:17,171 INFO L87 Difference]: Start difference. First operand 2168 states and 3214 transitions. Second operand 3 states. [2019-09-08 12:37:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:17,740 INFO L93 Difference]: Finished difference Result 5798 states and 8624 transitions. [2019-09-08 12:37:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:17,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:37:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:17,764 INFO L225 Difference]: With dead ends: 5798 [2019-09-08 12:37:17,764 INFO L226 Difference]: Without dead ends: 3908 [2019-09-08 12:37:17,769 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:37:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-09-08 12:37:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3906. [2019-09-08 12:37:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-09-08 12:37:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5748 transitions. [2019-09-08 12:37:18,352 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5748 transitions. Word has length 121 [2019-09-08 12:37:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:18,353 INFO L475 AbstractCegarLoop]: Abstraction has 3906 states and 5748 transitions. [2019-09-08 12:37:18,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5748 transitions. [2019-09-08 12:37:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:18,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:18,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:18,356 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1496063070, now seen corresponding path program 1 times [2019-09-08 12:37:18,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:18,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:18,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:18,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:18,465 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:37:18,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:18,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:18,467 INFO L87 Difference]: Start difference. First operand 3906 states and 5748 transitions. Second operand 5 states. [2019-09-08 12:37:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:19,091 INFO L93 Difference]: Finished difference Result 5428 states and 7995 transitions. [2019-09-08 12:37:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:19,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:37:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:19,111 INFO L225 Difference]: With dead ends: 5428 [2019-09-08 12:37:19,111 INFO L226 Difference]: Without dead ends: 4528 [2019-09-08 12:37:19,115 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:37:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2019-09-08 12:37:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4208. [2019-09-08 12:37:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2019-09-08 12:37:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 6196 transitions. [2019-09-08 12:37:19,656 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 6196 transitions. Word has length 121 [2019-09-08 12:37:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:19,657 INFO L475 AbstractCegarLoop]: Abstraction has 4208 states and 6196 transitions. [2019-09-08 12:37:19,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 6196 transitions. [2019-09-08 12:37:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:19,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:19,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:19,660 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -222165262, now seen corresponding path program 1 times [2019-09-08 12:37:19,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:19,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:19,773 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:37:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:19,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:19,775 INFO L87 Difference]: Start difference. First operand 4208 states and 6196 transitions. Second operand 5 states. [2019-09-08 12:37:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,652 INFO L93 Difference]: Finished difference Result 6178 states and 9109 transitions. [2019-09-08 12:37:20,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:20,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:37:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,666 INFO L225 Difference]: With dead ends: 6178 [2019-09-08 12:37:20,666 INFO L226 Difference]: Without dead ends: 4976 [2019-09-08 12:37:20,670 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:37:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-09-08 12:37:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4532. [2019-09-08 12:37:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-09-08 12:37:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6678 transitions. [2019-09-08 12:37:21,133 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6678 transitions. Word has length 121 [2019-09-08 12:37:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:21,133 INFO L475 AbstractCegarLoop]: Abstraction has 4532 states and 6678 transitions. [2019-09-08 12:37:21,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6678 transitions. [2019-09-08 12:37:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:37:21,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:21,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:21,194 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -684921793, now seen corresponding path program 1 times [2019-09-08 12:37:21,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:21,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:21,408 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:37:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:21,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:21,410 INFO L87 Difference]: Start difference. First operand 4532 states and 6678 transitions. Second operand 9 states. [2019-09-08 12:37:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:22,908 INFO L93 Difference]: Finished difference Result 13461 states and 19908 transitions. [2019-09-08 12:37:22,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:22,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:37:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:22,934 INFO L225 Difference]: With dead ends: 13461 [2019-09-08 12:37:22,935 INFO L226 Difference]: Without dead ends: 11957 [2019-09-08 12:37:22,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:37:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11957 states. [2019-09-08 12:37:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11957 to 5159. [2019-09-08 12:37:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-08 12:37:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 7607 transitions. [2019-09-08 12:37:23,642 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 7607 transitions. Word has length 121 [2019-09-08 12:37:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:23,642 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 7607 transitions. [2019-09-08 12:37:23,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 7607 transitions. [2019-09-08 12:37:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:37:23,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:23,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:23,645 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1220503032, now seen corresponding path program 1 times [2019-09-08 12:37:23,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:23,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:23,761 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:37:23,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:23,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:23,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:23,762 INFO L87 Difference]: Start difference. First operand 5159 states and 7607 transitions. Second operand 5 states. [2019-09-08 12:37:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:24,955 INFO L93 Difference]: Finished difference Result 8773 states and 12936 transitions. [2019-09-08 12:37:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:37:24,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 12:37:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:24,972 INFO L225 Difference]: With dead ends: 8773 [2019-09-08 12:37:24,973 INFO L226 Difference]: Without dead ends: 8771 [2019-09-08 12:37:24,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:37:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2019-09-08 12:37:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 5191. [2019-09-08 12:37:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5191 states. [2019-09-08 12:37:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7625 transitions. [2019-09-08 12:37:25,616 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7625 transitions. Word has length 122 [2019-09-08 12:37:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:25,616 INFO L475 AbstractCegarLoop]: Abstraction has 5191 states and 7625 transitions. [2019-09-08 12:37:25,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7625 transitions. [2019-09-08 12:37:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:37:25,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:25,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:25,620 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 124379524, now seen corresponding path program 1 times [2019-09-08 12:37:25,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:25,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:25,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,750 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:37:25,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:37:25,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:37:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:37:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:37:25,753 INFO L87 Difference]: Start difference. First operand 5191 states and 7625 transitions. Second operand 4 states. [2019-09-08 12:37:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:26,646 INFO L93 Difference]: Finished difference Result 12262 states and 18049 transitions. [2019-09-08 12:37:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:37:26,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-08 12:37:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:26,660 INFO L225 Difference]: With dead ends: 12262 [2019-09-08 12:37:26,660 INFO L226 Difference]: Without dead ends: 7392 [2019-09-08 12:37:26,673 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:37:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-09-08 12:37:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7390. [2019-09-08 12:37:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-09-08 12:37:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10832 transitions. [2019-09-08 12:37:27,667 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10832 transitions. Word has length 122 [2019-09-08 12:37:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:27,667 INFO L475 AbstractCegarLoop]: Abstraction has 7390 states and 10832 transitions. [2019-09-08 12:37:27,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:37:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10832 transitions. [2019-09-08 12:37:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:37:27,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:27,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:27,670 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -605502652, now seen corresponding path program 1 times [2019-09-08 12:37:27,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:27,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:27,927 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:37:27,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:27,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:27,929 INFO L87 Difference]: Start difference. First operand 7390 states and 10832 transitions. Second operand 9 states. [2019-09-08 12:37:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:30,784 INFO L93 Difference]: Finished difference Result 20452 states and 30030 transitions. [2019-09-08 12:37:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:37:30,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:37:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:30,804 INFO L225 Difference]: With dead ends: 20452 [2019-09-08 12:37:30,805 INFO L226 Difference]: Without dead ends: 14459 [2019-09-08 12:37:30,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:37:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14459 states. [2019-09-08 12:37:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14459 to 7390. [2019-09-08 12:37:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-09-08 12:37:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10831 transitions. [2019-09-08 12:37:32,076 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10831 transitions. Word has length 123 [2019-09-08 12:37:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:32,076 INFO L475 AbstractCegarLoop]: Abstraction has 7390 states and 10831 transitions. [2019-09-08 12:37:32,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10831 transitions. [2019-09-08 12:37:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:37:32,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:32,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:32,078 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1823653614, now seen corresponding path program 1 times [2019-09-08 12:37:32,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:32,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:32,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:32,373 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:37:32,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:32,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:37:32,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:37:32,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:37:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:37:32,375 INFO L87 Difference]: Start difference. First operand 7390 states and 10831 transitions. Second operand 10 states. [2019-09-08 12:37:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:36,949 INFO L93 Difference]: Finished difference Result 34775 states and 50612 transitions. [2019-09-08 12:37:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:37:36,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:37:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:36,984 INFO L225 Difference]: With dead ends: 34775 [2019-09-08 12:37:36,984 INFO L226 Difference]: Without dead ends: 27706 [2019-09-08 12:37:37,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:37:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27706 states. [2019-09-08 12:37:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27706 to 7435. [2019-09-08 12:37:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-09-08 12:37:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10891 transitions. [2019-09-08 12:37:38,705 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10891 transitions. Word has length 123 [2019-09-08 12:37:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:38,705 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 10891 transitions. [2019-09-08 12:37:38,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:37:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10891 transitions. [2019-09-08 12:37:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:37:38,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:38,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:38,707 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 837612680, now seen corresponding path program 1 times [2019-09-08 12:37:38,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:38,941 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:37:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:38,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:37:38,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:37:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:37:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:37:38,942 INFO L87 Difference]: Start difference. First operand 7435 states and 10891 transitions. Second operand 10 states. [2019-09-08 12:37:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:41,994 INFO L93 Difference]: Finished difference Result 19815 states and 29006 transitions. [2019-09-08 12:37:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:37:41,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:37:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:42,013 INFO L225 Difference]: With dead ends: 19815 [2019-09-08 12:37:42,013 INFO L226 Difference]: Without dead ends: 12549 [2019-09-08 12:37:42,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:37:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12549 states. [2019-09-08 12:37:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12549 to 7435. [2019-09-08 12:37:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-09-08 12:37:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10888 transitions. [2019-09-08 12:37:43,466 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10888 transitions. Word has length 123 [2019-09-08 12:37:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:43,466 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 10888 transitions. [2019-09-08 12:37:43,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:37:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10888 transitions. [2019-09-08 12:37:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:37:43,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:43,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:43,469 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash 641176039, now seen corresponding path program 1 times [2019-09-08 12:37:43,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:43,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:43,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:43,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:43,542 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:37:43,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:43,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:43,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:43,544 INFO L87 Difference]: Start difference. First operand 7435 states and 10888 transitions. Second operand 3 states. [2019-09-08 12:37:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:45,553 INFO L93 Difference]: Finished difference Result 21197 states and 31182 transitions. [2019-09-08 12:37:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:45,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:37:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:45,568 INFO L225 Difference]: With dead ends: 21197 [2019-09-08 12:37:45,568 INFO L226 Difference]: Without dead ends: 14128 [2019-09-08 12:37:45,578 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:37:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14128 states. [2019-09-08 12:37:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14128 to 13750. [2019-09-08 12:37:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-08 12:37:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20032 transitions. [2019-09-08 12:37:47,602 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20032 transitions. Word has length 124 [2019-09-08 12:37:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:47,603 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20032 transitions. [2019-09-08 12:37:47,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20032 transitions. [2019-09-08 12:37:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:37:47,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:47,605 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1077053863, now seen corresponding path program 1 times [2019-09-08 12:37:47,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:47,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:47,832 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:37:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:37:47,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:37:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:37:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:37:47,834 INFO L87 Difference]: Start difference. First operand 13750 states and 20032 transitions. Second operand 10 states. [2019-09-08 12:37:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:52,844 INFO L93 Difference]: Finished difference Result 41273 states and 60034 transitions. [2019-09-08 12:37:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:37:52,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-08 12:37:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:52,871 INFO L225 Difference]: With dead ends: 41273 [2019-09-08 12:37:52,871 INFO L226 Difference]: Without dead ends: 27707 [2019-09-08 12:37:52,886 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:37:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27707 states. [2019-09-08 12:37:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27707 to 13750. [2019-09-08 12:37:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-08 12:37:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20026 transitions. [2019-09-08 12:37:54,990 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20026 transitions. Word has length 124 [2019-09-08 12:37:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:54,990 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20026 transitions. [2019-09-08 12:37:54,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:37:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20026 transitions. [2019-09-08 12:37:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:37:54,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:54,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:54,992 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -442373075, now seen corresponding path program 1 times [2019-09-08 12:37:54,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:54,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:55,258 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:37:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:37:55,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:37:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:37:55,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:37:55,260 INFO L87 Difference]: Start difference. First operand 13750 states and 20026 transitions. Second operand 10 states. [2019-09-08 12:38:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:00,847 INFO L93 Difference]: Finished difference Result 41228 states and 59956 transitions. [2019-09-08 12:38:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:38:00,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-08 12:38:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:00,880 INFO L225 Difference]: With dead ends: 41228 [2019-09-08 12:38:00,881 INFO L226 Difference]: Without dead ends: 27692 [2019-09-08 12:38:00,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27692 states. [2019-09-08 12:38:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27692 to 13750. [2019-09-08 12:38:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-08 12:38:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20017 transitions. [2019-09-08 12:38:03,290 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20017 transitions. Word has length 125 [2019-09-08 12:38:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:03,291 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20017 transitions. [2019-09-08 12:38:03,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:38:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20017 transitions. [2019-09-08 12:38:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:38:03,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:03,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:03,293 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1061976015, now seen corresponding path program 1 times [2019-09-08 12:38:03,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:03,528 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:38:03,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:03,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:38:03,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:38:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:38:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:38:03,530 INFO L87 Difference]: Start difference. First operand 13750 states and 20017 transitions. Second operand 10 states. [2019-09-08 12:38:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:09,129 INFO L93 Difference]: Finished difference Result 41153 states and 59827 transitions. [2019-09-08 12:38:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:38:09,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-08 12:38:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:09,155 INFO L225 Difference]: With dead ends: 41153 [2019-09-08 12:38:09,156 INFO L226 Difference]: Without dead ends: 27662 [2019-09-08 12:38:09,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27662 states. [2019-09-08 12:38:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27662 to 13750. [2019-09-08 12:38:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-08 12:38:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20006 transitions. [2019-09-08 12:38:11,590 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20006 transitions. Word has length 126 [2019-09-08 12:38:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:11,590 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20006 transitions. [2019-09-08 12:38:11,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:38:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20006 transitions. [2019-09-08 12:38:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:38:11,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:11,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, 1, 1, 1, 1, 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:11,592 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1763158621, now seen corresponding path program 1 times [2019-09-08 12:38:11,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:11,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:11,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:11,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:11,804 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:38:11,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:11,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:38:11,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:38:11,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:38:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:38:11,805 INFO L87 Difference]: Start difference. First operand 13750 states and 20006 transitions. Second operand 10 states. [2019-09-08 12:38:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:18,264 INFO L93 Difference]: Finished difference Result 41053 states and 59656 transitions. [2019-09-08 12:38:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:38:18,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-08 12:38:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:18,292 INFO L225 Difference]: With dead ends: 41053 [2019-09-08 12:38:18,292 INFO L226 Difference]: Without dead ends: 27617 [2019-09-08 12:38:18,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27617 states. [2019-09-08 12:38:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27617 to 13750. [2019-09-08 12:38:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-08 12:38:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 19993 transitions. [2019-09-08 12:38:20,924 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 19993 transitions. Word has length 127 [2019-09-08 12:38:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:20,925 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 19993 transitions. [2019-09-08 12:38:20,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:38:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 19993 transitions. [2019-09-08 12:38:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:38:20,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:20,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:20,927 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1669775685, now seen corresponding path program 1 times [2019-09-08 12:38:20,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:22,192 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 12:38:22,474 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:38:22,694 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:38:22,870 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:38:23,094 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:38:23,316 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 12:38:23,547 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 12:38:23,746 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-08 12:38:23,973 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-08 12:38:24,174 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-08 12:38:24,406 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-08 12:38:24,803 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:38:27,233 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:38:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:27,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-08 12:38:27,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 12:38:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 12:38:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 12:38:27,235 INFO L87 Difference]: Start difference. First operand 13750 states and 19993 transitions. Second operand 46 states. [2019-09-08 12:38:27,460 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-08 12:38:28,872 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 12:38:29,081 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 12:38:29,318 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:38:29,637 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:38:30,667 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-08 12:38:31,131 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-08 12:38:31,734 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 139 [2019-09-08 12:38:32,474 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2019-09-08 12:38:33,192 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 138 [2019-09-08 12:38:34,029 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2019-09-08 12:38:34,882 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-09-08 12:38:35,904 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 175 [2019-09-08 12:38:36,965 WARN L188 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 182 [2019-09-08 12:38:38,172 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 237 DAG size of output: 193 [2019-09-08 12:38:39,419 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 247 DAG size of output: 200 [2019-09-08 12:38:41,406 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 272 DAG size of output: 223 [2019-09-08 12:38:43,535 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 286 DAG size of output: 233 [2019-09-08 12:38:44,096 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-08 12:38:44,540 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-08 12:38:45,086 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-08 12:38:45,589 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2019-09-08 12:38:46,007 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-09-08 12:38:46,418 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-09-08 12:38:47,048 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-08 12:38:47,709 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-08 12:38:48,302 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-08 12:38:48,893 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-08 12:38:49,164 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-08 12:38:50,165 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-08 12:38:50,895 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-08 12:38:52,077 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:38:52,910 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:38:54,048 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 12:38:54,944 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 12:38:55,450 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 12:38:56,246 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 12:39:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:13,982 INFO L93 Difference]: Finished difference Result 40875 states and 59548 transitions. [2019-09-08 12:39:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 12:39:13,982 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-08 12:39:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:14,016 INFO L225 Difference]: With dead ends: 40875 [2019-09-08 12:39:14,016 INFO L226 Difference]: Without dead ends: 34917 [2019-09-08 12:39:14,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=1630, Invalid=8270, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 12:39:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34917 states. [2019-09-08 12:39:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34917 to 13825. [2019-09-08 12:39:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-09-08 12:39:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 20086 transitions. [2019-09-08 12:39:17,180 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 20086 transitions. Word has length 128 [2019-09-08 12:39:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:17,180 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 20086 transitions. [2019-09-08 12:39:17,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 12:39:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 20086 transitions. [2019-09-08 12:39:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:39:17,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:17,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:17,183 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1390990270, now seen corresponding path program 1 times [2019-09-08 12:39:17,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:17,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:18,139 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:39:18,859 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:39:18,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:18,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:39:18,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:39:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:39:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:39:18,860 INFO L87 Difference]: Start difference. First operand 13825 states and 20086 transitions. Second operand 25 states. [2019-09-08 12:39:19,933 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:39:20,209 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:39:20,564 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-08 12:39:20,952 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-08 12:39:21,649 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-09-08 12:39:22,384 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-09-08 12:39:22,611 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 12:39:22,776 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 12:39:23,139 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:39:23,570 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:39:23,827 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:39:24,194 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:39:24,764 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:39:25,233 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 12:39:25,511 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:39:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:42,460 INFO L93 Difference]: Finished difference Result 64547 states and 94114 transitions. [2019-09-08 12:39:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:39:42,461 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-08 12:39:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:42,525 INFO L225 Difference]: With dead ends: 64547 [2019-09-08 12:39:42,525 INFO L226 Difference]: Without dead ends: 58589 [2019-09-08 12:39:42,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:39:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58589 states. [2019-09-08 12:39:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58589 to 13843. [2019-09-08 12:39:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13843 states. [2019-09-08 12:39:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13843 states to 13843 states and 20104 transitions. [2019-09-08 12:39:46,468 INFO L78 Accepts]: Start accepts. Automaton has 13843 states and 20104 transitions. Word has length 128 [2019-09-08 12:39:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:46,468 INFO L475 AbstractCegarLoop]: Abstraction has 13843 states and 20104 transitions. [2019-09-08 12:39:46,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:39:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13843 states and 20104 transitions. [2019-09-08 12:39:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:39:46,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:46,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:46,471 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash 970646882, now seen corresponding path program 1 times [2019-09-08 12:39:46,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:46,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:46,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:47,359 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 12:39:47,526 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:39:47,728 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:39:47,925 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:39:48,135 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-08 12:39:48,330 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 12:39:48,572 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 12:39:48,774 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 12:39:48,999 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-08 12:39:49,182 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:39:49,409 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:39:49,775 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 12:39:51,299 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:39:51,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:51,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-08 12:39:51,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 12:39:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 12:39:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:39:51,301 INFO L87 Difference]: Start difference. First operand 13843 states and 20104 transitions. Second operand 41 states. [2019-09-08 12:39:51,553 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-08 12:39:52,850 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-08 12:39:53,049 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-08 12:39:53,270 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-09-08 12:39:53,531 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-08 12:39:53,997 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-08 12:39:54,780 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-08 12:39:55,161 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2019-09-08 12:39:55,682 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 103 [2019-09-08 12:39:56,266 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 111 [2019-09-08 12:39:56,984 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 129 [2019-09-08 12:39:57,863 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 138 [2019-09-08 12:39:58,836 WARN L188 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 157 [2019-09-08 12:39:59,863 WARN L188 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 166 [2019-09-08 12:40:01,068 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 240 DAG size of output: 185 [2019-09-08 12:40:02,347 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 252 DAG size of output: 193 [2019-09-08 12:40:03,789 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 273 DAG size of output: 208 [2019-09-08 12:40:04,201 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-09-08 12:40:04,608 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-08 12:40:05,012 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-09-08 12:40:05,240 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 12:40:05,792 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-08 12:40:06,252 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-08 12:40:06,867 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-08 12:40:07,295 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-08 12:40:08,278 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-08 12:40:08,818 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-08 12:40:09,720 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:40:10,359 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:40:11,210 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-08 12:40:11,739 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-08 12:40:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:31,764 INFO L93 Difference]: Finished difference Result 45299 states and 66008 transitions. [2019-09-08 12:40:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:40:31,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2019-09-08 12:40:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:31,801 INFO L225 Difference]: With dead ends: 45299 [2019-09-08 12:40:31,801 INFO L226 Difference]: Without dead ends: 40293 [2019-09-08 12:40:31,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1320, Invalid=5160, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 12:40:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40293 states. [2019-09-08 12:40:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40293 to 13878. [2019-09-08 12:40:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13878 states. [2019-09-08 12:40:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 20149 transitions. [2019-09-08 12:40:36,206 INFO L78 Accepts]: Start accepts. Automaton has 13878 states and 20149 transitions. Word has length 128 [2019-09-08 12:40:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:36,206 INFO L475 AbstractCegarLoop]: Abstraction has 13878 states and 20149 transitions. [2019-09-08 12:40:36,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 12:40:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13878 states and 20149 transitions. [2019-09-08 12:40:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:40:36,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:36,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:36,208 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1768753698, now seen corresponding path program 1 times [2019-09-08 12:40:36,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:36,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:36,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:37,754 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:40:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:37,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:40:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:40:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:40:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:40:37,755 INFO L87 Difference]: Start difference. First operand 13878 states and 20149 transitions. Second operand 24 states. [2019-09-08 12:40:38,999 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:40:39,263 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:40:39,686 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:40:40,211 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-08 12:40:40,873 WARN L188 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-09-08 12:40:41,130 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:40:41,364 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:40:41,601 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:40:41,955 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-08 12:40:42,097 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 12:40:42,453 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 12:40:42,833 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:40:43,148 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:40:43,537 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:41:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:03,741 INFO L93 Difference]: Finished difference Result 61122 states and 89080 transitions. [2019-09-08 12:41:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:41:03,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-08 12:41:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:03,798 INFO L225 Difference]: With dead ends: 61122 [2019-09-08 12:41:03,799 INFO L226 Difference]: Without dead ends: 56130 [2019-09-08 12:41:03,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=490, Invalid=1960, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 12:41:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56130 states. [2019-09-08 12:41:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56130 to 13875. [2019-09-08 12:41:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13875 states. [2019-09-08 12:41:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13875 states to 13875 states and 20144 transitions. [2019-09-08 12:41:08,766 INFO L78 Accepts]: Start accepts. Automaton has 13875 states and 20144 transitions. Word has length 128 [2019-09-08 12:41:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:08,766 INFO L475 AbstractCegarLoop]: Abstraction has 13875 states and 20144 transitions. [2019-09-08 12:41:08,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:41:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13875 states and 20144 transitions. [2019-09-08 12:41:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:41:08,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:08,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:08,768 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 859171391, now seen corresponding path program 1 times [2019-09-08 12:41:08,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:08,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:09,678 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:41:09,957 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:41:10,558 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:41:10,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:10,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:41:10,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:41:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:41:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:41:10,560 INFO L87 Difference]: Start difference. First operand 13875 states and 20144 transitions. Second operand 25 states. [2019-09-08 12:41:11,620 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 12:41:11,887 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:41:12,250 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 12:41:12,650 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-08 12:41:13,160 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-09-08 12:41:13,709 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-08 12:41:13,955 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-08 12:41:14,467 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-08 12:41:14,943 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:41:15,193 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:41:15,597 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:41:16,101 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:41:16,531 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:41:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:38,203 INFO L93 Difference]: Finished difference Result 58183 states and 84806 transitions. [2019-09-08 12:41:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:41:38,204 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-08 12:41:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:38,261 INFO L225 Difference]: With dead ends: 58183 [2019-09-08 12:41:38,261 INFO L226 Difference]: Without dead ends: 53909 [2019-09-08 12:41:38,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:41:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53909 states. [2019-09-08 12:41:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53909 to 13890. [2019-09-08 12:41:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13890 states. [2019-09-08 12:41:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 20156 transitions. [2019-09-08 12:41:43,933 INFO L78 Accepts]: Start accepts. Automaton has 13890 states and 20156 transitions. Word has length 128 [2019-09-08 12:41:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:43,934 INFO L475 AbstractCegarLoop]: Abstraction has 13890 states and 20156 transitions. [2019-09-08 12:41:43,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:41:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13890 states and 20156 transitions. [2019-09-08 12:41:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:41:43,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:43,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:43,936 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 759484704, now seen corresponding path program 1 times [2019-09-08 12:41:43,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:45,614 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:41:45,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:45,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:41:45,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:41:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:41:45,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:41:45,616 INFO L87 Difference]: Start difference. First operand 13890 states and 20156 transitions. Second operand 24 states. [2019-09-08 12:41:46,813 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:41:47,037 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 12:41:47,357 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-08 12:41:47,736 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-08 12:41:48,234 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2019-09-08 12:41:48,465 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:41:48,691 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:41:49,146 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:41:49,484 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:41:49,875 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:41:50,986 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:41:51,553 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:42:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:15,515 INFO L93 Difference]: Finished difference Result 58026 states and 84411 transitions. [2019-09-08 12:42:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 12:42:15,516 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-08 12:42:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:15,590 INFO L225 Difference]: With dead ends: 58026 [2019-09-08 12:42:15,590 INFO L226 Difference]: Without dead ends: 54468 [2019-09-08 12:42:15,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=516, Invalid=2240, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:42:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54468 states. [2019-09-08 12:42:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54468 to 14024. [2019-09-08 12:42:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14024 states. [2019-09-08 12:42:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14024 states to 14024 states and 20332 transitions. [2019-09-08 12:42:22,653 INFO L78 Accepts]: Start accepts. Automaton has 14024 states and 20332 transitions. Word has length 128 [2019-09-08 12:42:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:22,653 INFO L475 AbstractCegarLoop]: Abstraction has 14024 states and 20332 transitions. [2019-09-08 12:42:22,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:42:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 14024 states and 20332 transitions. [2019-09-08 12:42:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:42:22,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:22,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:22,656 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 568996734, now seen corresponding path program 1 times [2019-09-08 12:42:22,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:22,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:22,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:22,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:23,666 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:42:23,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:23,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:42:23,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:42:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:42:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:42:23,668 INFO L87 Difference]: Start difference. First operand 14024 states and 20332 transitions. Second operand 19 states. [2019-09-08 12:42:24,425 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 12:42:24,637 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:42:24,947 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-08 12:42:25,263 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-08 12:42:25,448 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:42:25,960 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:42:26,238 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:42:26,483 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:42:26,834 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:42:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:45,591 INFO L93 Difference]: Finished difference Result 48693 states and 70904 transitions. [2019-09-08 12:42:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:42:45,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-08 12:42:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:45,633 INFO L225 Difference]: With dead ends: 48693 [2019-09-08 12:42:45,634 INFO L226 Difference]: Without dead ends: 43701 [2019-09-08 12:42:45,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:42:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43701 states. [2019-09-08 12:42:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43701 to 14021. [2019-09-08 12:42:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-09-08 12:42:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 20327 transitions. [2019-09-08 12:42:51,877 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 20327 transitions. Word has length 129 [2019-09-08 12:42:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:51,877 INFO L475 AbstractCegarLoop]: Abstraction has 14021 states and 20327 transitions. [2019-09-08 12:42:51,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:42:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 20327 transitions. [2019-09-08 12:42:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:42:51,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:51,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:51,879 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1197732160, now seen corresponding path program 1 times [2019-09-08 12:42:51,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:51,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:51,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:53,180 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 12:42:53,492 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:42:53,799 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:42:54,760 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:42:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:42:54,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:42:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:42:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:42:54,761 INFO L87 Difference]: Start difference. First operand 14021 states and 20327 transitions. Second operand 31 states. [2019-09-08 12:42:54,925 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-08 12:42:56,040 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-08 12:42:56,569 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-08 12:42:56,888 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-08 12:42:57,337 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-09-08 12:42:57,852 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-09-08 12:42:58,513 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-08 12:42:59,280 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 136 [2019-09-08 12:43:00,225 WARN L188 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 163 [2019-09-08 12:43:01,273 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 178 [2019-09-08 12:43:01,584 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-08 12:43:01,819 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-08 12:43:02,260 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-09-08 12:43:02,811 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-08 12:43:03,213 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-08 12:43:03,641 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-08 12:43:04,311 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-08 12:43:04,807 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-08 12:43:05,572 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-08 12:43:06,102 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-08 12:43:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:35,289 INFO L93 Difference]: Finished difference Result 61926 states and 90193 transitions. [2019-09-08 12:43:35,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:43:35,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2019-09-08 12:43:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:35,347 INFO L225 Difference]: With dead ends: 61926 [2019-09-08 12:43:35,348 INFO L226 Difference]: Without dead ends: 55938 [2019-09-08 12:43:35,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:43:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55938 states. [2019-09-08 12:43:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55938 to 14039. [2019-09-08 12:43:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14039 states. [2019-09-08 12:43:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14039 states to 14039 states and 20348 transitions. [2019-09-08 12:43:42,211 INFO L78 Accepts]: Start accepts. Automaton has 14039 states and 20348 transitions. Word has length 129 [2019-09-08 12:43:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:42,211 INFO L475 AbstractCegarLoop]: Abstraction has 14039 states and 20348 transitions. [2019-09-08 12:43:42,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:43:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14039 states and 20348 transitions. [2019-09-08 12:43:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:43:42,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:42,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:42,213 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2046136579, now seen corresponding path program 1 times [2019-09-08 12:43:42,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:42,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:43,976 WARN L188 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:43:44,756 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:43:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:43:44,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:43:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:43:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:43:44,758 INFO L87 Difference]: Start difference. First operand 14039 states and 20348 transitions. Second operand 25 states. [2019-09-08 12:43:45,867 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:43:46,142 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:43:46,492 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:43:46,881 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 12:43:47,400 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2019-09-08 12:43:47,933 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2019-09-08 12:43:48,171 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 12:43:48,339 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 12:43:48,686 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:43:49,032 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:43:49,364 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:43:49,702 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:43:50,217 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:43:50,589 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:44:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:13,127 INFO L93 Difference]: Finished difference Result 48960 states and 71271 transitions. [2019-09-08 12:44:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:44:13,128 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-09-08 12:44:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:13,173 INFO L225 Difference]: With dead ends: 48960 [2019-09-08 12:44:13,173 INFO L226 Difference]: Without dead ends: 42894 [2019-09-08 12:44:13,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:44:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42894 states. [2019-09-08 12:44:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42894 to 14019. [2019-09-08 12:44:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14019 states. [2019-09-08 12:44:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14019 states to 14019 states and 20320 transitions. [2019-09-08 12:44:20,323 INFO L78 Accepts]: Start accepts. Automaton has 14019 states and 20320 transitions. Word has length 129 [2019-09-08 12:44:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:20,323 INFO L475 AbstractCegarLoop]: Abstraction has 14019 states and 20320 transitions. [2019-09-08 12:44:20,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:44:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 14019 states and 20320 transitions. [2019-09-08 12:44:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:44:20,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:20,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:20,325 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash 167813244, now seen corresponding path program 1 times [2019-09-08 12:44:20,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:20,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:20,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:20,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:21,289 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:44:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:44:21,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:44:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:44:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:44:21,291 INFO L87 Difference]: Start difference. First operand 14019 states and 20320 transitions. Second operand 19 states. [2019-09-08 12:44:21,931 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 12:44:22,132 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:44:22,441 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 12:44:22,773 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 12:44:22,968 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:44:23,366 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:44:23,631 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:44:23,872 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:44:24,122 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:44:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:47,116 INFO L93 Difference]: Finished difference Result 50441 states and 73470 transitions. [2019-09-08 12:44:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:44:47,117 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-08 12:44:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:47,159 INFO L225 Difference]: With dead ends: 50441 [2019-09-08 12:44:47,159 INFO L226 Difference]: Without dead ends: 44384 [2019-09-08 12:44:47,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:44:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44384 states. [2019-09-08 12:44:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44384 to 13994. [2019-09-08 12:44:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13994 states. [2019-09-08 12:44:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 20287 transitions. [2019-09-08 12:44:54,332 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 20287 transitions. Word has length 129 [2019-09-08 12:44:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:54,333 INFO L475 AbstractCegarLoop]: Abstraction has 13994 states and 20287 transitions. [2019-09-08 12:44:54,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:44:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 20287 transitions. [2019-09-08 12:44:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:44:54,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:54,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:54,335 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash -675788165, now seen corresponding path program 1 times [2019-09-08 12:44:54,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:54,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:54,931 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:44:54,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:54,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:44:54,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:44:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:44:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:44:54,932 INFO L87 Difference]: Start difference. First operand 13994 states and 20287 transitions. Second operand 13 states. [2019-09-08 12:44:55,308 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:44:55,484 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:44:55,670 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:44:56,013 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:44:56,242 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:45:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:13,450 INFO L93 Difference]: Finished difference Result 39004 states and 56745 transitions. [2019-09-08 12:45:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:13,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:45:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:13,482 INFO L225 Difference]: With dead ends: 39004 [2019-09-08 12:45:13,482 INFO L226 Difference]: Without dead ends: 32922 [2019-09-08 12:45:13,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:45:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32922 states. [2019-09-08 12:45:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32922 to 13935. [2019-09-08 12:45:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13935 states. [2019-09-08 12:45:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 20211 transitions. [2019-09-08 12:45:20,625 INFO L78 Accepts]: Start accepts. Automaton has 13935 states and 20211 transitions. Word has length 129 [2019-09-08 12:45:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:20,625 INFO L475 AbstractCegarLoop]: Abstraction has 13935 states and 20211 transitions. [2019-09-08 12:45:20,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:45:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 13935 states and 20211 transitions. [2019-09-08 12:45:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:45:20,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:20,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:20,627 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash -59208219, now seen corresponding path program 1 times [2019-09-08 12:45:20,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:20,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:20,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:21,246 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:45:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:21,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:45:21,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:45:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:45:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:45:21,247 INFO L87 Difference]: Start difference. First operand 13935 states and 20211 transitions. Second operand 16 states. [2019-09-08 12:45:21,898 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:45:22,095 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 12:45:22,314 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:45:22,520 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:45:23,118 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:45:23,324 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:45:24,190 WARN L188 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:45:24,340 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 12:45:24,551 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:45:30,661 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 12:46:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:03,999 INFO L93 Difference]: Finished difference Result 74387 states and 108336 transitions. [2019-09-08 12:46:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:46:04,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-08 12:46:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:04,078 INFO L225 Difference]: With dead ends: 74387 [2019-09-08 12:46:04,079 INFO L226 Difference]: Without dead ends: 70141 [2019-09-08 12:46:04,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:46:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70141 states. [2019-09-08 12:46:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70141 to 13809. [2019-09-08 12:46:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-09-08 12:46:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 20052 transitions. [2019-09-08 12:46:12,043 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 20052 transitions. Word has length 129 [2019-09-08 12:46:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:12,043 INFO L475 AbstractCegarLoop]: Abstraction has 13809 states and 20052 transitions. [2019-09-08 12:46:12,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:46:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 20052 transitions. [2019-09-08 12:46:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:12,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:12,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:12,045 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:12,046 INFO L82 PathProgramCache]: Analyzing trace with hash -829357733, now seen corresponding path program 1 times [2019-09-08 12:46:12,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:12,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:12,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:12,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:12,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:12,785 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:46:13,061 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:46:13,365 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-08 12:46:13,526 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:46:13,712 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:46:14,832 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:46:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:14,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-08 12:46:14,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 12:46:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 12:46:14,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:46:14,834 INFO L87 Difference]: Start difference. First operand 13809 states and 20052 transitions. Second operand 29 states. [2019-09-08 12:46:14,988 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-08 12:46:16,107 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-09-08 12:46:16,636 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-08 12:46:16,874 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2019-09-08 12:46:17,202 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-09-08 12:46:17,545 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 72 [2019-09-08 12:46:17,994 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 94 [2019-09-08 12:46:18,498 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 102 [2019-09-08 12:46:19,157 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 117 [2019-09-08 12:46:19,497 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-08 12:46:19,820 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-08 12:46:20,113 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-09-08 12:46:20,671 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 12:46:20,993 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 12:46:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:44,197 INFO L93 Difference]: Finished difference Result 40277 states and 58647 transitions. [2019-09-08 12:46:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:46:44,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-09-08 12:46:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:44,234 INFO L225 Difference]: With dead ends: 40277 [2019-09-08 12:46:44,234 INFO L226 Difference]: Without dead ends: 35238 [2019-09-08 12:46:44,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:46:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35238 states. [2019-09-08 12:46:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35238 to 13806. [2019-09-08 12:46:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2019-09-08 12:46:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 20047 transitions. [2019-09-08 12:46:52,254 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 20047 transitions. Word has length 129 [2019-09-08 12:46:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:52,254 INFO L475 AbstractCegarLoop]: Abstraction has 13806 states and 20047 transitions. [2019-09-08 12:46:52,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 12:46:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 20047 transitions. [2019-09-08 12:46:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:52,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:52,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:52,256 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1635491301, now seen corresponding path program 1 times [2019-09-08 12:46:52,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:53,158 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:46:53,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:53,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:53,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:53,159 INFO L87 Difference]: Start difference. First operand 13806 states and 20047 transitions. Second operand 17 states. [2019-09-08 12:46:53,865 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-09-08 12:46:54,064 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-09-08 12:46:54,229 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 12:46:54,387 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:46:54,533 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:47:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:18,446 INFO L93 Difference]: Finished difference Result 43710 states and 63760 transitions. [2019-09-08 12:47:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:47:18,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-08 12:47:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:18,487 INFO L225 Difference]: With dead ends: 43710 [2019-09-08 12:47:18,487 INFO L226 Difference]: Without dead ends: 38647 [2019-09-08 12:47:18,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:47:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38647 states. [2019-09-08 12:47:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38647 to 13791. [2019-09-08 12:47:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13791 states. [2019-09-08 12:47:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13791 states to 13791 states and 20029 transitions. [2019-09-08 12:47:27,600 INFO L78 Accepts]: Start accepts. Automaton has 13791 states and 20029 transitions. Word has length 129 [2019-09-08 12:47:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:27,600 INFO L475 AbstractCegarLoop]: Abstraction has 13791 states and 20029 transitions. [2019-09-08 12:47:27,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:47:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13791 states and 20029 transitions. [2019-09-08 12:47:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:47:27,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:27,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:27,601 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 899729637, now seen corresponding path program 1 times [2019-09-08 12:47:27,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:27,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:27,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:27,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:27,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:28,195 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:47:28,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:28,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:47:28,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:47:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:47:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:47:28,197 INFO L87 Difference]: Start difference. First operand 13791 states and 20029 transitions. Second operand 13 states. [2019-09-08 12:47:28,620 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:47:28,771 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:47:28,931 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:47:29,278 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:47:29,507 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:48:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:01,482 INFO L93 Difference]: Finished difference Result 60223 states and 87758 transitions. [2019-09-08 12:48:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:01,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:48:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:01,538 INFO L225 Difference]: With dead ends: 60223 [2019-09-08 12:48:01,538 INFO L226 Difference]: Without dead ends: 54191 [2019-09-08 12:48:01,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:48:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54191 states. [2019-09-08 12:48:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54191 to 13748. [2019-09-08 12:48:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13748 states. [2019-09-08 12:48:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13748 states to 13748 states and 19966 transitions. [2019-09-08 12:48:10,221 INFO L78 Accepts]: Start accepts. Automaton has 13748 states and 19966 transitions. Word has length 129 [2019-09-08 12:48:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:10,222 INFO L475 AbstractCegarLoop]: Abstraction has 13748 states and 19966 transitions. [2019-09-08 12:48:10,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:48:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13748 states and 19966 transitions. [2019-09-08 12:48:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:48:10,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:10,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:10,223 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1705847363, now seen corresponding path program 1 times [2019-09-08 12:48:10,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:11,114 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:48:11,423 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:48:11,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:11,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:48:11,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:48:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:48:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:48:11,425 INFO L87 Difference]: Start difference. First operand 13748 states and 19966 transitions. Second operand 16 states. [2019-09-08 12:48:11,587 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-09-08 12:48:12,084 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 12:48:12,316 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 12:48:12,491 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:48:12,822 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-09-08 12:48:13,053 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-08 12:48:13,309 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-08 12:48:13,481 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:48:13,642 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:48:13,861 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-08 12:48:14,081 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:48:14,268 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-08 12:48:14,482 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-08 12:48:17,504 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:49:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:06,750 INFO L93 Difference]: Finished difference Result 87033 states and 126877 transitions. [2019-09-08 12:49:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:49:06,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-08 12:49:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:06,829 INFO L225 Difference]: With dead ends: 87033 [2019-09-08 12:49:06,829 INFO L226 Difference]: Without dead ends: 80954 [2019-09-08 12:49:06,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:49:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80954 states. [2019-09-08 12:49:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80954 to 13659. [2019-09-08 12:49:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13659 states. [2019-09-08 12:49:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13659 states to 13659 states and 19853 transitions. [2019-09-08 12:49:16,437 INFO L78 Accepts]: Start accepts. Automaton has 13659 states and 19853 transitions. Word has length 129 [2019-09-08 12:49:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:16,438 INFO L475 AbstractCegarLoop]: Abstraction has 13659 states and 19853 transitions. [2019-09-08 12:49:16,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:49:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 13659 states and 19853 transitions. [2019-09-08 12:49:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:49:16,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:16,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:16,439 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1312996549, now seen corresponding path program 1 times [2019-09-08 12:49:16,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:16,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:17,383 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:49:17,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:17,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:49:17,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:49:17,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:49:17,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:49:17,384 INFO L87 Difference]: Start difference. First operand 13659 states and 19853 transitions. Second operand 17 states. [2019-09-08 12:49:18,136 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:49:18,288 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 12:49:18,637 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 12:49:18,812 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:49:18,987 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:49:19,157 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:49:19,611 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 12:49:19,784 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:49:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:38,259 INFO L93 Difference]: Finished difference Result 31485 states and 45908 transitions. [2019-09-08 12:49:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:49:38,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2019-09-08 12:49:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:38,283 INFO L225 Difference]: With dead ends: 31485 [2019-09-08 12:49:38,283 INFO L226 Difference]: Without dead ends: 26436 [2019-09-08 12:49:38,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:49:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26436 states. [2019-09-08 12:49:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26436 to 13330. [2019-09-08 12:49:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13330 states. [2019-09-08 12:49:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13330 states to 13330 states and 19390 transitions. [2019-09-08 12:49:47,429 INFO L78 Accepts]: Start accepts. Automaton has 13330 states and 19390 transitions. Word has length 130 [2019-09-08 12:49:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:47,430 INFO L475 AbstractCegarLoop]: Abstraction has 13330 states and 19390 transitions. [2019-09-08 12:49:47,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:49:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13330 states and 19390 transitions. [2019-09-08 12:49:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:49:47,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:47,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:47,431 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -695556671, now seen corresponding path program 1 times [2019-09-08 12:49:47,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:47,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:48,379 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:49:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:48,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:49:48,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:49:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:49:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:49:48,380 INFO L87 Difference]: Start difference. First operand 13330 states and 19390 transitions. Second operand 19 states. [2019-09-08 12:49:49,492 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:49:49,737 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:49:50,035 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-08 12:49:50,360 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:49:50,615 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:49:50,776 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-08 12:49:51,106 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:49:51,453 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-08 12:49:51,746 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:49:52,103 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:49:52,377 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:50:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:29,259 INFO L93 Difference]: Finished difference Result 58674 states and 85614 transitions. [2019-09-08 12:50:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:50:29,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-09-08 12:50:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:29,319 INFO L225 Difference]: With dead ends: 58674 [2019-09-08 12:50:29,320 INFO L226 Difference]: Without dead ends: 52682 [2019-09-08 12:50:29,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=325, Invalid=1235, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 12:50:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52682 states. [2019-09-08 12:50:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52682 to 13304. [2019-09-08 12:50:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-09-08 12:50:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 19360 transitions. [2019-09-08 12:50:39,040 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 19360 transitions. Word has length 130 [2019-09-08 12:50:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:39,040 INFO L475 AbstractCegarLoop]: Abstraction has 13304 states and 19360 transitions. [2019-09-08 12:50:39,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:50:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 19360 transitions. [2019-09-08 12:50:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:50:39,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:39,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:39,041 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash 554914331, now seen corresponding path program 1 times [2019-09-08 12:50:39,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:39,574 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:50:39,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:50:39,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:50:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:50:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:50:39,575 INFO L87 Difference]: Start difference. First operand 13304 states and 19360 transitions. Second operand 13 states. [2019-09-08 12:50:40,160 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-08 12:50:40,403 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:50:40,665 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:50:41,063 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-08 12:50:41,291 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:50:41,510 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:50:43,071 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48