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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:44:34,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:44:34,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:44:34,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:44:34,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:44:34,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:44:34,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:44:34,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:44:34,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:44:34,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:44:34,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:44:34,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:44:34,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:44:34,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:44:34,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:44:34,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:44:34,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:44:34,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:44:34,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:44:34,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:44:34,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:44:34,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:44:34,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:44:34,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:44:34,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:44:34,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:44:34,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:44:34,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:44:34,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:44:34,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:44:34,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:44:34,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:44:34,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:44:34,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:44:34,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:44:34,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:44:34,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:44:34,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:44:34,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:44:34,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:44:34,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:44:34,502 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:44:34,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:44:34,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:44:34,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:44:34,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:44:34,527 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:44:34,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:44:34,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:44:34,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:44:34,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:44:34,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:44:34,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:44:34,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:44:34,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:44:34,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:44:34,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:44:34,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:44:34,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:44:34,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:44:34,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:44:34,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:44:34,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:44:34,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:44:34,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:44:34,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:44:34,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:44:34,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:44:34,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:44:34,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:44:34,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:44:34,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:44:34,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:44:34,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:44:34,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:44:34,589 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:44:34,590 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:44:34,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb833b25/6cad46bb372543f3b2170d9ff816d382/FLAGf0b945e65 [2019-09-08 12:44:35,186 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:44:35,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:44:35,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb833b25/6cad46bb372543f3b2170d9ff816d382/FLAGf0b945e65 [2019-09-08 12:44:35,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb833b25/6cad46bb372543f3b2170d9ff816d382 [2019-09-08 12:44:35,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:44:35,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:44:35,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:44:35,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:44:35,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:44:35,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:44:35" (1/1) ... [2019-09-08 12:44:35,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349f85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:35, skipping insertion in model container [2019-09-08 12:44:35,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:44:35" (1/1) ... [2019-09-08 12:44:35,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:44:35,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:44:36,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:44:36,073 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:44:36,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:44:36,215 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:44:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36 WrapperNode [2019-09-08 12:44:36,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:44:36,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:44:36,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:44:36,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:44:36,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (1/1) ... [2019-09-08 12:44:36,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:44:36,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:44:36,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:44:36,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:44:36,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (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:44:36,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:44:36,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:44:36,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:44:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:44:36,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:44:36,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:44:36,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:44:36,403 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:44:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:44:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:44:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:44:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:44:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:44:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:44:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:44:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:44:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:44:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:44:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:44:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:44:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:44:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:44:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:44:37,547 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:44:37,547 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:44:37,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:44:37 BoogieIcfgContainer [2019-09-08 12:44:37,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:44:37,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:44:37,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:44:37,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:44:37,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:44:35" (1/3) ... [2019-09-08 12:44:37,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5051caa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:44:37, skipping insertion in model container [2019-09-08 12:44:37,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:36" (2/3) ... [2019-09-08 12:44:37,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5051caa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:44:37, skipping insertion in model container [2019-09-08 12:44:37,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:44:37" (3/3) ... [2019-09-08 12:44:37,557 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:44:37,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:44:37,575 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:44:37,604 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:44:37,633 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:44:37,633 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:44:37,634 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:44:37,634 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:44:37,634 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:44:37,634 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:44:37,634 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:44:37,634 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:44:37,635 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:44:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-09-08 12:44:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:44:37,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:37,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:37,671 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1579256941, now seen corresponding path program 1 times [2019-09-08 12:44:37,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:38,256 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:38,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:38,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:38,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:38,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:38,283 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2019-09-08 12:44:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:38,465 INFO L93 Difference]: Finished difference Result 398 states and 660 transitions. [2019-09-08 12:44:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:38,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 12:44:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:38,488 INFO L225 Difference]: With dead ends: 398 [2019-09-08 12:44:38,489 INFO L226 Difference]: Without dead ends: 305 [2019-09-08 12:44:38,497 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:44:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-08 12:44:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-09-08 12:44:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2019-09-08 12:44:38,593 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 111 [2019-09-08 12:44:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:38,594 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2019-09-08 12:44:38,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2019-09-08 12:44:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:44:38,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:38,598 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] [2019-09-08 12:44:38,598 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash -529337958, now seen corresponding path program 1 times [2019-09-08 12:44:38,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:38,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:38,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:38,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:38,800 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:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:38,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:38,804 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand 5 states. [2019-09-08 12:44:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:39,134 INFO L93 Difference]: Finished difference Result 546 states and 809 transitions. [2019-09-08 12:44:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:39,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:44:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:39,140 INFO L225 Difference]: With dead ends: 546 [2019-09-08 12:44:39,140 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:39,143 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:44:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions. [2019-09-08 12:44:39,190 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 113 [2019-09-08 12:44:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:39,192 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 432 transitions. [2019-09-08 12:44:39,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions. [2019-09-08 12:44:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:44:39,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:39,196 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:44:39,199 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1399262783, now seen corresponding path program 1 times [2019-09-08 12:44:39,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:39,456 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:39,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:39,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:39,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:39,460 INFO L87 Difference]: Start difference. First operand 303 states and 432 transitions. Second operand 5 states. [2019-09-08 12:44:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:39,705 INFO L93 Difference]: Finished difference Result 542 states and 799 transitions. [2019-09-08 12:44:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:39,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-08 12:44:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:39,710 INFO L225 Difference]: With dead ends: 542 [2019-09-08 12:44:39,711 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:39,713 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:44:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 429 transitions. [2019-09-08 12:44:39,750 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 429 transitions. Word has length 114 [2019-09-08 12:44:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:39,753 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 429 transitions. [2019-09-08 12:44:39,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 429 transitions. [2019-09-08 12:44:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:44:39,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:39,762 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:44:39,762 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash -360394647, now seen corresponding path program 1 times [2019-09-08 12:44:39,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:39,920 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:39,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:39,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:39,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:39,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:39,923 INFO L87 Difference]: Start difference. First operand 303 states and 429 transitions. Second operand 5 states. [2019-09-08 12:44:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:40,166 INFO L93 Difference]: Finished difference Result 522 states and 769 transitions. [2019-09-08 12:44:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:40,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-08 12:44:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:40,168 INFO L225 Difference]: With dead ends: 522 [2019-09-08 12:44:40,168 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:40,170 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:44:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2019-09-08 12:44:40,192 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 115 [2019-09-08 12:44:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,192 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2019-09-08 12:44:40,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2019-09-08 12:44:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:40,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,194 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:44:40,195 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash -72559888, now seen corresponding path program 1 times [2019-09-08 12:44:40,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:40,315 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:40,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:40,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:40,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:40,317 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand 5 states. [2019-09-08 12:44:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:40,537 INFO L93 Difference]: Finished difference Result 534 states and 778 transitions. [2019-09-08 12:44:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:40,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:44:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:40,540 INFO L225 Difference]: With dead ends: 534 [2019-09-08 12:44:40,540 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:40,541 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:44:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 423 transitions. [2019-09-08 12:44:40,560 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 423 transitions. Word has length 116 [2019-09-08 12:44:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,561 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 423 transitions. [2019-09-08 12:44:40,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 423 transitions. [2019-09-08 12:44:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:44:40,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,563 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:44:40,563 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1918050182, now seen corresponding path program 1 times [2019-09-08 12:44:40,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:40,682 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:40,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:40,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:40,684 INFO L87 Difference]: Start difference. First operand 303 states and 423 transitions. Second operand 5 states. [2019-09-08 12:44:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:40,882 INFO L93 Difference]: Finished difference Result 530 states and 768 transitions. [2019-09-08 12:44:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:40,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-08 12:44:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:40,884 INFO L225 Difference]: With dead ends: 530 [2019-09-08 12:44:40,885 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:40,886 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:44:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 420 transitions. [2019-09-08 12:44:40,905 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 420 transitions. Word has length 117 [2019-09-08 12:44:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,906 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 420 transitions. [2019-09-08 12:44:40,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 420 transitions. [2019-09-08 12:44:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:40,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,907 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:44:40,908 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash -694845729, now seen corresponding path program 1 times [2019-09-08 12:44:40,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:41,005 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:41,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:41,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:41,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:41,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:41,007 INFO L87 Difference]: Start difference. First operand 303 states and 420 transitions. Second operand 5 states. [2019-09-08 12:44:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:41,204 INFO L93 Difference]: Finished difference Result 538 states and 771 transitions. [2019-09-08 12:44:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:41,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-08 12:44:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:41,206 INFO L225 Difference]: With dead ends: 538 [2019-09-08 12:44:41,207 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:41,208 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:44:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2019-09-08 12:44:41,228 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 118 [2019-09-08 12:44:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:41,228 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2019-09-08 12:44:41,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2019-09-08 12:44:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:41,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:41,230 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:44:41,230 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1872587080, now seen corresponding path program 1 times [2019-09-08 12:44:41,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:41,362 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:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:41,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:41,364 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand 5 states. [2019-09-08 12:44:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:41,592 INFO L93 Difference]: Finished difference Result 526 states and 753 transitions. [2019-09-08 12:44:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:41,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 12:44:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:41,595 INFO L225 Difference]: With dead ends: 526 [2019-09-08 12:44:41,595 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 12:44:41,596 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:44:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 12:44:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 12:44:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:44:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2019-09-08 12:44:41,616 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 119 [2019-09-08 12:44:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:41,617 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2019-09-08 12:44:41,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2019-09-08 12:44:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:41,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:41,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] [2019-09-08 12:44:41,619 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1611484050, now seen corresponding path program 1 times [2019-09-08 12:44:41,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:41,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:41,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:41,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:41,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:41,767 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:41,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:41,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:41,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:41,770 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand 5 states. [2019-09-08 12:44:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:41,975 INFO L93 Difference]: Finished difference Result 872 states and 1269 transitions. [2019-09-08 12:44:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:41,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:44:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:41,980 INFO L225 Difference]: With dead ends: 872 [2019-09-08 12:44:41,980 INFO L226 Difference]: Without dead ends: 716 [2019-09-08 12:44:41,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:44:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-08 12:44:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 657. [2019-09-08 12:44:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 12:44:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 952 transitions. [2019-09-08 12:44:42,036 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 952 transitions. Word has length 120 [2019-09-08 12:44:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:42,037 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 952 transitions. [2019-09-08 12:44:42,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 952 transitions. [2019-09-08 12:44:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:42,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:42,039 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:44:42,039 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:42,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1110184227, now seen corresponding path program 1 times [2019-09-08 12:44:42,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:42,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:42,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:42,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:42,168 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:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:42,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:42,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:42,170 INFO L87 Difference]: Start difference. First operand 657 states and 952 transitions. Second operand 5 states. [2019-09-08 12:44:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:42,381 INFO L93 Difference]: Finished difference Result 1626 states and 2412 transitions. [2019-09-08 12:44:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:42,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:44:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:42,387 INFO L225 Difference]: With dead ends: 1626 [2019-09-08 12:44:42,388 INFO L226 Difference]: Without dead ends: 1158 [2019-09-08 12:44:42,389 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:44:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-08 12:44:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 910. [2019-09-08 12:44:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 12:44:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1337 transitions. [2019-09-08 12:44:42,468 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1337 transitions. Word has length 120 [2019-09-08 12:44:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:42,469 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1337 transitions. [2019-09-08 12:44:42,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1337 transitions. [2019-09-08 12:44:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:42,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:42,471 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:44:42,471 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1346892231, now seen corresponding path program 1 times [2019-09-08 12:44:42,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:42,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:42,590 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:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:42,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:42,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:42,592 INFO L87 Difference]: Start difference. First operand 910 states and 1337 transitions. Second operand 5 states. [2019-09-08 12:44:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:42,810 INFO L93 Difference]: Finished difference Result 2066 states and 3081 transitions. [2019-09-08 12:44:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:42,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:44:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:42,818 INFO L225 Difference]: With dead ends: 2066 [2019-09-08 12:44:42,818 INFO L226 Difference]: Without dead ends: 1361 [2019-09-08 12:44:42,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:44:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-08 12:44:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1153. [2019-09-08 12:44:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-09-08 12:44:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1706 transitions. [2019-09-08 12:44:42,928 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1706 transitions. Word has length 120 [2019-09-08 12:44:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:42,929 INFO L475 AbstractCegarLoop]: Abstraction has 1153 states and 1706 transitions. [2019-09-08 12:44:42,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1706 transitions. [2019-09-08 12:44:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:42,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:42,931 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:44:42,931 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 628970857, now seen corresponding path program 1 times [2019-09-08 12:44:42,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:42,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:43,064 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:43,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:43,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:43,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:43,066 INFO L87 Difference]: Start difference. First operand 1153 states and 1706 transitions. Second operand 3 states. [2019-09-08 12:44:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:43,250 INFO L93 Difference]: Finished difference Result 2097 states and 3133 transitions. [2019-09-08 12:44:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:43,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:44:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:43,257 INFO L225 Difference]: With dead ends: 2097 [2019-09-08 12:44:43,257 INFO L226 Difference]: Without dead ends: 1155 [2019-09-08 12:44:43,259 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:44:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-09-08 12:44:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2019-09-08 12:44:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-09-08 12:44:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1701 transitions. [2019-09-08 12:44:43,356 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1701 transitions. Word has length 120 [2019-09-08 12:44:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:43,356 INFO L475 AbstractCegarLoop]: Abstraction has 1153 states and 1701 transitions. [2019-09-08 12:44:43,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1701 transitions. [2019-09-08 12:44:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:43,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:43,358 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:44:43,359 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash 385846506, now seen corresponding path program 1 times [2019-09-08 12:44:43,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:43,424 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:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:43,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:43,425 INFO L87 Difference]: Start difference. First operand 1153 states and 1701 transitions. Second operand 3 states. [2019-09-08 12:44:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:43,706 INFO L93 Difference]: Finished difference Result 2962 states and 4411 transitions. [2019-09-08 12:44:43,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:43,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:44:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:43,717 INFO L225 Difference]: With dead ends: 2962 [2019-09-08 12:44:43,717 INFO L226 Difference]: Without dead ends: 2020 [2019-09-08 12:44:43,720 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:44:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-08 12:44:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1994. [2019-09-08 12:44:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-09-08 12:44:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2933 transitions. [2019-09-08 12:44:43,998 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2933 transitions. Word has length 120 [2019-09-08 12:44:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:43,999 INFO L475 AbstractCegarLoop]: Abstraction has 1994 states and 2933 transitions. [2019-09-08 12:44:43,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2933 transitions. [2019-09-08 12:44:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:44,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:44,003 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:44:44,003 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1534182572, now seen corresponding path program 1 times [2019-09-08 12:44:44,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:44,283 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:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:44,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:44,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:44,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:44,285 INFO L87 Difference]: Start difference. First operand 1994 states and 2933 transitions. Second operand 9 states. [2019-09-08 12:44:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:45,232 INFO L93 Difference]: Finished difference Result 7694 states and 11404 transitions. [2019-09-08 12:44:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:44:45,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:44:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:45,262 INFO L225 Difference]: With dead ends: 7694 [2019-09-08 12:44:45,262 INFO L226 Difference]: Without dead ends: 5911 [2019-09-08 12:44:45,267 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:44:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2019-09-08 12:44:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 2293. [2019-09-08 12:44:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-08 12:44:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3377 transitions. [2019-09-08 12:44:45,547 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3377 transitions. Word has length 120 [2019-09-08 12:44:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:45,548 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3377 transitions. [2019-09-08 12:44:45,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3377 transitions. [2019-09-08 12:44:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:45,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:45,550 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:44:45,550 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2082666138, now seen corresponding path program 1 times [2019-09-08 12:44:45,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:45,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:45,665 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:45,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:45,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:45,667 INFO L87 Difference]: Start difference. First operand 2293 states and 3377 transitions. Second operand 5 states. [2019-09-08 12:44:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:46,120 INFO L93 Difference]: Finished difference Result 4731 states and 6997 transitions. [2019-09-08 12:44:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:46,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:44:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:46,140 INFO L225 Difference]: With dead ends: 4731 [2019-09-08 12:44:46,140 INFO L226 Difference]: Without dead ends: 2948 [2019-09-08 12:44:46,148 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:44:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2019-09-08 12:44:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2592. [2019-09-08 12:44:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2592 states. [2019-09-08 12:44:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3822 transitions. [2019-09-08 12:44:46,427 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3822 transitions. Word has length 120 [2019-09-08 12:44:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:46,428 INFO L475 AbstractCegarLoop]: Abstraction has 2592 states and 3822 transitions. [2019-09-08 12:44:46,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3822 transitions. [2019-09-08 12:44:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:46,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:46,430 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:44:46,430 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1273267460, now seen corresponding path program 1 times [2019-09-08 12:44:46,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:46,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:46,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:46,547 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:46,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:46,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:46,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:46,549 INFO L87 Difference]: Start difference. First operand 2592 states and 3822 transitions. Second operand 5 states. [2019-09-08 12:44:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:47,046 INFO L93 Difference]: Finished difference Result 5418 states and 8022 transitions. [2019-09-08 12:44:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:47,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:44:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:47,062 INFO L225 Difference]: With dead ends: 5418 [2019-09-08 12:44:47,062 INFO L226 Difference]: Without dead ends: 3337 [2019-09-08 12:44:47,066 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:44:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2019-09-08 12:44:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2901. [2019-09-08 12:44:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-09-08 12:44:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4283 transitions. [2019-09-08 12:44:47,356 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 4283 transitions. Word has length 120 [2019-09-08 12:44:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:47,356 INFO L475 AbstractCegarLoop]: Abstraction has 2901 states and 4283 transitions. [2019-09-08 12:44:47,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4283 transitions. [2019-09-08 12:44:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:44:47,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:47,358 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:44:47,359 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -229628659, now seen corresponding path program 1 times [2019-09-08 12:44:47,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:47,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:47,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:47,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:47,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:47,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:47,584 INFO L87 Difference]: Start difference. First operand 2901 states and 4283 transitions. Second operand 9 states. [2019-09-08 12:44:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:48,492 INFO L93 Difference]: Finished difference Result 8506 states and 12615 transitions. [2019-09-08 12:44:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:44:48,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:44:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:48,530 INFO L225 Difference]: With dead ends: 8506 [2019-09-08 12:44:48,530 INFO L226 Difference]: Without dead ends: 6127 [2019-09-08 12:44:48,537 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:44:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-09-08 12:44:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 3366. [2019-09-08 12:44:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-09-08 12:44:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4974 transitions. [2019-09-08 12:44:48,886 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4974 transitions. Word has length 120 [2019-09-08 12:44:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:48,886 INFO L475 AbstractCegarLoop]: Abstraction has 3366 states and 4974 transitions. [2019-09-08 12:44:48,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4974 transitions. [2019-09-08 12:44:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:44:48,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:48,889 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:44:48,890 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1978649096, now seen corresponding path program 1 times [2019-09-08 12:44:48,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:48,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:49,052 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:49,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:49,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:49,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:49,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:49,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:49,054 INFO L87 Difference]: Start difference. First operand 3366 states and 4974 transitions. Second operand 5 states. [2019-09-08 12:44:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:49,535 INFO L93 Difference]: Finished difference Result 5929 states and 8771 transitions. [2019-09-08 12:44:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:44:49,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:44:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:49,551 INFO L225 Difference]: With dead ends: 5929 [2019-09-08 12:44:49,551 INFO L226 Difference]: Without dead ends: 5927 [2019-09-08 12:44:49,554 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:44:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-09-08 12:44:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 3392. [2019-09-08 12:44:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-08 12:44:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4994 transitions. [2019-09-08 12:44:49,917 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4994 transitions. Word has length 121 [2019-09-08 12:44:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:49,917 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4994 transitions. [2019-09-08 12:44:49,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4994 transitions. [2019-09-08 12:44:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:44:49,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:49,920 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:44:49,920 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash -690965260, now seen corresponding path program 1 times [2019-09-08 12:44:49,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:50,224 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:50,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:50,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:50,227 INFO L87 Difference]: Start difference. First operand 3392 states and 4994 transitions. Second operand 9 states. [2019-09-08 12:44:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:51,490 INFO L93 Difference]: Finished difference Result 9806 states and 14504 transitions. [2019-09-08 12:44:51,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:44:51,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:44:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:51,505 INFO L225 Difference]: With dead ends: 9806 [2019-09-08 12:44:51,505 INFO L226 Difference]: Without dead ends: 6545 [2019-09-08 12:44:51,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:44:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2019-09-08 12:44:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 3392. [2019-09-08 12:44:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-08 12:44:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4993 transitions. [2019-09-08 12:44:51,928 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4993 transitions. Word has length 121 [2019-09-08 12:44:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:51,928 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4993 transitions. [2019-09-08 12:44:51,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4993 transitions. [2019-09-08 12:44:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:51,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:51,930 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:44:51,931 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash -66846392, now seen corresponding path program 1 times [2019-09-08 12:44:51,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:51,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:52,168 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:52,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:52,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:44:52,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:44:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:44:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:44:52,170 INFO L87 Difference]: Start difference. First operand 3392 states and 4993 transitions. Second operand 10 states. [2019-09-08 12:44:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:53,800 INFO L93 Difference]: Finished difference Result 9982 states and 14730 transitions. [2019-09-08 12:44:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:44:53,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-08 12:44:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:53,814 INFO L225 Difference]: With dead ends: 9982 [2019-09-08 12:44:53,814 INFO L226 Difference]: Without dead ends: 6737 [2019-09-08 12:44:53,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6737 states. [2019-09-08 12:44:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6737 to 3392. [2019-09-08 12:44:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-08 12:44:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4991 transitions. [2019-09-08 12:44:54,242 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4991 transitions. Word has length 122 [2019-09-08 12:44:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:54,242 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4991 transitions. [2019-09-08 12:44:54,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:44:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4991 transitions. [2019-09-08 12:44:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:54,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:54,244 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:44:54,244 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 593355322, now seen corresponding path program 1 times [2019-09-08 12:44:54,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:54,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:54,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:54,488 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,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:54,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:44:54,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:44:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:44:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:44:54,490 INFO L87 Difference]: Start difference. First operand 3392 states and 4991 transitions. Second operand 10 states. [2019-09-08 12:44:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:56,148 INFO L93 Difference]: Finished difference Result 9948 states and 14673 transitions. [2019-09-08 12:44:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:44:56,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-08 12:44:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:56,163 INFO L225 Difference]: With dead ends: 9948 [2019-09-08 12:44:56,163 INFO L226 Difference]: Without dead ends: 6722 [2019-09-08 12:44:56,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-09-08 12:44:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 3392. [2019-09-08 12:44:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-08 12:44:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4985 transitions. [2019-09-08 12:44:56,723 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4985 transitions. Word has length 122 [2019-09-08 12:44:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:56,723 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4985 transitions. [2019-09-08 12:44:56,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:44:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4985 transitions. [2019-09-08 12:44:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:56,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:56,725 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:44:56,725 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash -340793067, now seen corresponding path program 1 times [2019-09-08 12:44:56,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:56,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:56,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:56,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:56,962 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:56,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:56,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:44:56,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:44:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:44:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:44:56,963 INFO L87 Difference]: Start difference. First operand 3392 states and 4985 transitions. Second operand 10 states. [2019-09-08 12:44:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:59,510 INFO L93 Difference]: Finished difference Result 15644 states and 22940 transitions. [2019-09-08 12:44:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:44:59,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:44:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:59,531 INFO L225 Difference]: With dead ends: 15644 [2019-09-08 12:44:59,531 INFO L226 Difference]: Without dead ends: 12491 [2019-09-08 12:44:59,540 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:44:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2019-09-08 12:45:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 3419. [2019-09-08 12:45:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-08 12:45:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5021 transitions. [2019-09-08 12:45:00,526 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5021 transitions. Word has length 123 [2019-09-08 12:45:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:00,526 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5021 transitions. [2019-09-08 12:45:00,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:45:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5021 transitions. [2019-09-08 12:45:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:00,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:00,528 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:45:00,528 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:00,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1421082261, now seen corresponding path program 1 times [2019-09-08 12:45:00,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:00,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:00,768 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:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:45:00,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:45:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:45:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:45:00,770 INFO L87 Difference]: Start difference. First operand 3419 states and 5021 transitions. Second operand 10 states. [2019-09-08 12:45:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:02,476 INFO L93 Difference]: Finished difference Result 10039 states and 14786 transitions. [2019-09-08 12:45:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:45:02,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-08 12:45:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:02,482 INFO L225 Difference]: With dead ends: 10039 [2019-09-08 12:45:02,482 INFO L226 Difference]: Without dead ends: 6769 [2019-09-08 12:45:02,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2019-09-08 12:45:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 3419. [2019-09-08 12:45:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-08 12:45:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5017 transitions. [2019-09-08 12:45:02,979 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5017 transitions. Word has length 124 [2019-09-08 12:45:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:02,979 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5017 transitions. [2019-09-08 12:45:02,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:45:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5017 transitions. [2019-09-08 12:45:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:45:02,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:02,981 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:45:02,981 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:02,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash 534763643, now seen corresponding path program 1 times [2019-09-08 12:45:02,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:02,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:02,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:03,235 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:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:03,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:45:03,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:45:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:45:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:45:03,237 INFO L87 Difference]: Start difference. First operand 3419 states and 5017 transitions. Second operand 10 states. [2019-09-08 12:45:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:04,920 INFO L93 Difference]: Finished difference Result 9908 states and 14579 transitions. [2019-09-08 12:45:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:45:04,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-08 12:45:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:04,927 INFO L225 Difference]: With dead ends: 9908 [2019-09-08 12:45:04,928 INFO L226 Difference]: Without dead ends: 6723 [2019-09-08 12:45:04,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2019-09-08 12:45:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 3419. [2019-09-08 12:45:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-08 12:45:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5009 transitions. [2019-09-08 12:45:05,420 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5009 transitions. Word has length 125 [2019-09-08 12:45:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:05,420 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5009 transitions. [2019-09-08 12:45:05,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:45:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5009 transitions. [2019-09-08 12:45:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:45:05,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:05,422 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:45:05,422 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1461446239, now seen corresponding path program 1 times [2019-09-08 12:45:05,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:05,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:05,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:05,650 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:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:45:05,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:45:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:45:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:45:05,651 INFO L87 Difference]: Start difference. First operand 3419 states and 5009 transitions. Second operand 10 states. [2019-09-08 12:45:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:07,914 INFO L93 Difference]: Finished difference Result 9973 states and 14661 transitions. [2019-09-08 12:45:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:45:07,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-08 12:45:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:07,921 INFO L225 Difference]: With dead ends: 9973 [2019-09-08 12:45:07,921 INFO L226 Difference]: Without dead ends: 6753 [2019-09-08 12:45:07,925 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:45:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-09-08 12:45:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 3419. [2019-09-08 12:45:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-08 12:45:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5002 transitions. [2019-09-08 12:45:08,430 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5002 transitions. Word has length 126 [2019-09-08 12:45:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:08,430 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5002 transitions. [2019-09-08 12:45:08,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:45:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5002 transitions. [2019-09-08 12:45:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:45:08,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:08,432 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:45:08,432 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:08,433 INFO L82 PathProgramCache]: Analyzing trace with hash 195353613, now seen corresponding path program 1 times [2019-09-08 12:45:08,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:08,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:08,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:09,674 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:09,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:09,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:45:09,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:45:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:45:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:45:09,676 INFO L87 Difference]: Start difference. First operand 3419 states and 5002 transitions. Second operand 19 states. [2019-09-08 12:45:10,383 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-08 12:45:10,594 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:45:10,894 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:45:11,242 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:45:11,428 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:45:11,565 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:45:11,836 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:45:12,147 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:45:12,572 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:45:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:16,333 INFO L93 Difference]: Finished difference Result 19541 states and 28867 transitions. [2019-09-08 12:45:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:45:16,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-08 12:45:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:16,355 INFO L225 Difference]: With dead ends: 19541 [2019-09-08 12:45:16,355 INFO L226 Difference]: Without dead ends: 17128 [2019-09-08 12:45:16,364 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:45:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-09-08 12:45:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 3429. [2019-09-08 12:45:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2019-09-08 12:45:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 5010 transitions. [2019-09-08 12:45:17,117 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 5010 transitions. Word has length 127 [2019-09-08 12:45:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:17,117 INFO L475 AbstractCegarLoop]: Abstraction has 3429 states and 5010 transitions. [2019-09-08 12:45:17,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:45:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 5010 transitions. [2019-09-08 12:45:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:45:17,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:17,119 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:45:17,119 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:17,119 INFO L82 PathProgramCache]: Analyzing trace with hash -944880079, now seen corresponding path program 1 times [2019-09-08 12:45:17,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:17,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:17,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:17,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:17,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:18,126 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:18,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:18,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:45:18,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:45:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:45:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:45:18,128 INFO L87 Difference]: Start difference. First operand 3429 states and 5010 transitions. Second operand 18 states. [2019-09-08 12:45:18,913 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 12:45:19,118 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 12:45:19,451 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-08 12:45:19,639 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:45:19,840 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:45:20,021 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:45:20,206 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:45:20,367 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:45:20,723 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:45:21,146 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:45:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:26,389 INFO L93 Difference]: Finished difference Result 25058 states and 36837 transitions. [2019-09-08 12:45:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:45:26,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2019-09-08 12:45:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:26,407 INFO L225 Difference]: With dead ends: 25058 [2019-09-08 12:45:26,408 INFO L226 Difference]: Without dead ends: 22356 [2019-09-08 12:45:26,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:45:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22356 states. [2019-09-08 12:45:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22356 to 3589. [2019-09-08 12:45:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2019-09-08 12:45:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5225 transitions. [2019-09-08 12:45:27,328 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5225 transitions. Word has length 127 [2019-09-08 12:45:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:27,329 INFO L475 AbstractCegarLoop]: Abstraction has 3589 states and 5225 transitions. [2019-09-08 12:45:27,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:45:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5225 transitions. [2019-09-08 12:45:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:45:27,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:27,330 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:45:27,331 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2019210254, now seen corresponding path program 1 times [2019-09-08 12:45:27,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:27,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:27,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:27,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:28,977 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:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:45:28,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:45:28,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:45:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:45:28,979 INFO L87 Difference]: Start difference. First operand 3589 states and 5225 transitions. Second operand 24 states. [2019-09-08 12:45:30,307 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:45:30,584 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:45:31,032 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:45:31,784 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-08 12:45:32,453 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-09-08 12:45:32,700 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:45:32,949 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:45:33,181 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 12:45:33,560 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-08 12:45:33,880 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:45:34,237 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-08 12:45:34,567 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:45:34,956 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:45:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:42,921 INFO L93 Difference]: Finished difference Result 27161 states and 39864 transitions. [2019-09-08 12:45:42,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:45:42,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-08 12:45:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:42,947 INFO L225 Difference]: With dead ends: 27161 [2019-09-08 12:45:42,947 INFO L226 Difference]: Without dead ends: 24760 [2019-09-08 12:45:42,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:45:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24760 states. [2019-09-08 12:45:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24760 to 3599. [2019-09-08 12:45:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-08 12:45:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5236 transitions. [2019-09-08 12:45:44,224 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5236 transitions. Word has length 127 [2019-09-08 12:45:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:44,224 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5236 transitions. [2019-09-08 12:45:44,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:45:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5236 transitions. [2019-09-08 12:45:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:45:44,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:44,225 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:45:44,225 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1008657458, now seen corresponding path program 1 times [2019-09-08 12:45:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:44,316 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:44,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:44,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:44,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:44,317 INFO L87 Difference]: Start difference. First operand 3599 states and 5236 transitions. Second operand 3 states. [2019-09-08 12:45:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:46,168 INFO L93 Difference]: Finished difference Result 9737 states and 14368 transitions. [2019-09-08 12:45:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:46,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 12:45:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:46,175 INFO L225 Difference]: With dead ends: 9737 [2019-09-08 12:45:46,175 INFO L226 Difference]: Without dead ends: 6584 [2019-09-08 12:45:46,180 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:45:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2019-09-08 12:45:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6414. [2019-09-08 12:45:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6414 states. [2019-09-08 12:45:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 9341 transitions. [2019-09-08 12:45:47,990 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 9341 transitions. Word has length 127 [2019-09-08 12:45:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:47,990 INFO L475 AbstractCegarLoop]: Abstraction has 6414 states and 9341 transitions. [2019-09-08 12:45:47,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 9341 transitions. [2019-09-08 12:45:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:45:47,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:47,991 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:45:47,991 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 125385868, now seen corresponding path program 1 times [2019-09-08 12:45:47,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:47,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:49,001 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:49,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:49,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:45:49,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:45:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:45:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:45:49,003 INFO L87 Difference]: Start difference. First operand 6414 states and 9341 transitions. Second operand 19 states. [2019-09-08 12:45:49,703 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:45:49,897 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:45:50,186 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:45:50,520 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:45:50,712 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:45:51,099 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:45:51,396 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:45:51,576 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:45:51,839 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:46:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:00,443 INFO L93 Difference]: Finished difference Result 28950 states and 42477 transitions. [2019-09-08 12:46:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:46:00,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-08 12:46:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:00,466 INFO L225 Difference]: With dead ends: 28950 [2019-09-08 12:46:00,466 INFO L226 Difference]: Without dead ends: 26297 [2019-09-08 12:46:00,474 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:46:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26297 states. [2019-09-08 12:46:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26297 to 6409. [2019-09-08 12:46:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6409 states. [2019-09-08 12:46:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 9328 transitions. [2019-09-08 12:46:02,702 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 9328 transitions. Word has length 127 [2019-09-08 12:46:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:02,702 INFO L475 AbstractCegarLoop]: Abstraction has 6409 states and 9328 transitions. [2019-09-08 12:46:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:46:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 9328 transitions. [2019-09-08 12:46:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:46:02,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:02,704 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:46:02,704 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1410801195, now seen corresponding path program 1 times [2019-09-08 12:46:02,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:03,659 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:46:03,907 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-08 12:46:04,504 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:04,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:46:04,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:46:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:46:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:46:04,506 INFO L87 Difference]: Start difference. First operand 6409 states and 9328 transitions. Second operand 25 states. [2019-09-08 12:46:05,698 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 12:46:06,000 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:46:06,369 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 12:46:06,778 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-08 12:46:07,288 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-08 12:46:07,853 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2019-09-08 12:46:08,113 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-08 12:46:08,622 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-08 12:46:09,099 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:46:09,338 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:46:09,740 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:46:10,237 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:46:10,702 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:46:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:23,216 INFO L93 Difference]: Finished difference Result 37052 states and 54364 transitions. [2019-09-08 12:46:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:46:23,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 127 [2019-09-08 12:46:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:23,246 INFO L225 Difference]: With dead ends: 37052 [2019-09-08 12:46:23,246 INFO L226 Difference]: Without dead ends: 32468 [2019-09-08 12:46:23,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:46:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32468 states. [2019-09-08 12:46:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32468 to 6427. [2019-09-08 12:46:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6427 states. [2019-09-08 12:46:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 9348 transitions. [2019-09-08 12:46:25,791 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 9348 transitions. Word has length 127 [2019-09-08 12:46:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:25,791 INFO L475 AbstractCegarLoop]: Abstraction has 6427 states and 9348 transitions. [2019-09-08 12:46:25,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:46:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 9348 transitions. [2019-09-08 12:46:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:46:25,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:25,793 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:46:25,793 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2022749332, now seen corresponding path program 1 times [2019-09-08 12:46:25,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:26,275 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-08 12:46:26,766 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:26,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:26,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:26,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:26,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:26,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:26,767 INFO L87 Difference]: Start difference. First operand 6427 states and 9348 transitions. Second operand 17 states. [2019-09-08 12:46:27,582 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:46:27,841 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-08 12:46:28,005 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 12:46:28,175 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 12:46:28,414 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-08 12:46:28,553 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:46:28,713 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:46:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:43,391 INFO L93 Difference]: Finished difference Result 38932 states and 57242 transitions. [2019-09-08 12:46:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:46:43,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-08 12:46:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:43,421 INFO L225 Difference]: With dead ends: 38932 [2019-09-08 12:46:43,421 INFO L226 Difference]: Without dead ends: 33717 [2019-09-08 12:46:43,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:46:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33717 states. [2019-09-08 12:46:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33717 to 6413. [2019-09-08 12:46:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-09-08 12:46:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 9329 transitions. [2019-09-08 12:46:46,180 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 9329 transitions. Word has length 127 [2019-09-08 12:46:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:46,181 INFO L475 AbstractCegarLoop]: Abstraction has 6413 states and 9329 transitions. [2019-09-08 12:46:46,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:46:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 9329 transitions. [2019-09-08 12:46:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:46:46,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:46,182 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:46:46,183 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1115215921, now seen corresponding path program 1 times [2019-09-08 12:46:46,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:46,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:46,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:46,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:46:46,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:46:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:46:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:46:46,354 INFO L87 Difference]: Start difference. First operand 6413 states and 9329 transitions. Second operand 4 states. [2019-09-08 12:46:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:50,305 INFO L93 Difference]: Finished difference Result 15285 states and 22418 transitions. [2019-09-08 12:46:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:46:50,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 12:46:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:50,315 INFO L225 Difference]: With dead ends: 15285 [2019-09-08 12:46:50,315 INFO L226 Difference]: Without dead ends: 9317 [2019-09-08 12:46:50,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2019-09-08 12:46:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9273. [2019-09-08 12:46:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9273 states. [2019-09-08 12:46:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9273 states to 9273 states and 13488 transitions. [2019-09-08 12:46:54,080 INFO L78 Accepts]: Start accepts. Automaton has 9273 states and 13488 transitions. Word has length 128 [2019-09-08 12:46:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:54,081 INFO L475 AbstractCegarLoop]: Abstraction has 9273 states and 13488 transitions. [2019-09-08 12:46:54,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:46:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9273 states and 13488 transitions. [2019-09-08 12:46:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:46:54,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:54,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:54,083 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1141789032, now seen corresponding path program 1 times [2019-09-08 12:46:54,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:54,977 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:54,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:54,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:46:54,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:46:54,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:46:54,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:46:54,978 INFO L87 Difference]: Start difference. First operand 9273 states and 13488 transitions. Second operand 16 states. [2019-09-08 12:46:55,171 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:46:55,413 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:46:55,593 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:46:55,864 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:46:56,116 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:46:56,379 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:46:56,707 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-08 12:46:57,040 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:46:57,401 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:46:57,576 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:46:57,739 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:46:58,067 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-08 12:46:58,288 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:46:58,510 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:46:58,807 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-08 12:47:01,393 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:47:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:22,619 INFO L93 Difference]: Finished difference Result 60582 states and 88664 transitions. [2019-09-08 12:47:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:47:22,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2019-09-08 12:47:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:22,672 INFO L225 Difference]: With dead ends: 60582 [2019-09-08 12:47:22,672 INFO L226 Difference]: Without dead ends: 53734 [2019-09-08 12:47:22,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:47:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53734 states. [2019-09-08 12:47:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53734 to 9199. [2019-09-08 12:47:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-09-08 12:47:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 13384 transitions. [2019-09-08 12:47:27,251 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 13384 transitions. Word has length 128 [2019-09-08 12:47:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:27,252 INFO L475 AbstractCegarLoop]: Abstraction has 9199 states and 13384 transitions. [2019-09-08 12:47:27,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:47:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 13384 transitions. [2019-09-08 12:47:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:47:27,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:27,253 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:47:27,253 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1623352999, now seen corresponding path program 1 times [2019-09-08 12:47:27,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:27,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:27,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:28,402 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,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:47:28,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:47:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:47:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:47:28,404 INFO L87 Difference]: Start difference. First operand 9199 states and 13384 transitions. Second operand 19 states. [2019-09-08 12:47:28,994 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 12:47:29,191 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:47:29,473 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 12:47:29,888 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-08 12:47:30,060 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:47:30,391 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:47:30,625 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:47:30,857 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:47:31,083 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:47:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:54,042 INFO L93 Difference]: Finished difference Result 54060 states and 79179 transitions. [2019-09-08 12:47:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:47:54,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2019-09-08 12:47:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:54,084 INFO L225 Difference]: With dead ends: 54060 [2019-09-08 12:47:54,084 INFO L226 Difference]: Without dead ends: 47277 [2019-09-08 12:47:54,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:47:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47277 states. [2019-09-08 12:47:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47277 to 9199. [2019-09-08 12:47:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-09-08 12:47:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 13381 transitions. [2019-09-08 12:47:58,812 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 13381 transitions. Word has length 128 [2019-09-08 12:47:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:58,812 INFO L475 AbstractCegarLoop]: Abstraction has 9199 states and 13381 transitions. [2019-09-08 12:47:58,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:47:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 13381 transitions. [2019-09-08 12:47:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:47:58,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:58,813 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:47:58,813 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133977, now seen corresponding path program 1 times [2019-09-08 12:47:58,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:58,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:59,444 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:59,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:59,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:47:59,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:47:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:47:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:47:59,445 INFO L87 Difference]: Start difference. First operand 9199 states and 13381 transitions. Second operand 13 states. [2019-09-08 12:47:59,875 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:48:00,056 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:48:00,237 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:48:00,614 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:48:00,872 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:48:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:19,092 INFO L93 Difference]: Finished difference Result 42577 states and 62323 transitions. [2019-09-08 12:48:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:19,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-08 12:48:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:19,124 INFO L225 Difference]: With dead ends: 42577 [2019-09-08 12:48:19,124 INFO L226 Difference]: Without dead ends: 35829 [2019-09-08 12:48:19,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:48:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35829 states. [2019-09-08 12:48:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35829 to 9178. [2019-09-08 12:48:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9178 states. [2019-09-08 12:48:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 13352 transitions. [2019-09-08 12:48:23,926 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 13352 transitions. Word has length 128 [2019-09-08 12:48:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:23,926 INFO L475 AbstractCegarLoop]: Abstraction has 9178 states and 13352 transitions. [2019-09-08 12:48:23,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:48:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 13352 transitions. [2019-09-08 12:48:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:48:23,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:23,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, 1] [2019-09-08 12:48:23,927 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1025878600, now seen corresponding path program 1 times [2019-09-08 12:48:23,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:23,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:24,538 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-08 12:48:24,815 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:24,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:24,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:48:24,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:48:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:48:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:48:24,816 INFO L87 Difference]: Start difference. First operand 9178 states and 13352 transitions. Second operand 16 states. [2019-09-08 12:48:25,603 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-08 12:48:25,809 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:48:26,022 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:48:26,404 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-08 12:48:26,683 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:48:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:45,723 INFO L93 Difference]: Finished difference Result 38763 states and 56744 transitions. [2019-09-08 12:48:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:48:45,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-08 12:48:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:45,753 INFO L225 Difference]: With dead ends: 38763 [2019-09-08 12:48:45,753 INFO L226 Difference]: Without dead ends: 34911 [2019-09-08 12:48:45,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:48:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34911 states. [2019-09-08 12:48:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34911 to 9108. [2019-09-08 12:48:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9108 states. [2019-09-08 12:48:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9108 states to 9108 states and 13270 transitions. [2019-09-08 12:48:50,833 INFO L78 Accepts]: Start accepts. Automaton has 9108 states and 13270 transitions. Word has length 129 [2019-09-08 12:48:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:50,833 INFO L475 AbstractCegarLoop]: Abstraction has 9108 states and 13270 transitions. [2019-09-08 12:48:50,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:48:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9108 states and 13270 transitions. [2019-09-08 12:48:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:48:50,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:50,835 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:50,835 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1300257325, now seen corresponding path program 1 times [2019-09-08 12:48:50,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:51,421 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-08 12:48:51,706 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:51,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:51,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:48:51,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:48:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:48:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:48:51,707 INFO L87 Difference]: Start difference. First operand 9108 states and 13270 transitions. Second operand 14 states. [2019-09-08 12:48:52,347 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:48:52,505 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:48:52,660 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:48:52,884 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:48:53,092 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 12:49:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:13,202 INFO L93 Difference]: Finished difference Result 42456 states and 62178 transitions. [2019-09-08 12:49:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:49:13,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-09-08 12:49:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:13,233 INFO L225 Difference]: With dead ends: 42456 [2019-09-08 12:49:13,233 INFO L226 Difference]: Without dead ends: 35698 [2019-09-08 12:49:13,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:49:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35698 states. [2019-09-08 12:49:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35698 to 9075. [2019-09-08 12:49:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-09-08 12:49:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 13230 transitions. [2019-09-08 12:49:18,544 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 13230 transitions. Word has length 129 [2019-09-08 12:49:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:18,544 INFO L475 AbstractCegarLoop]: Abstraction has 9075 states and 13230 transitions. [2019-09-08 12:49:18,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:49:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 13230 transitions. [2019-09-08 12:49:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:49:18,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:18,545 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:49:18,545 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:18,546 INFO L82 PathProgramCache]: Analyzing trace with hash 29788909, now seen corresponding path program 1 times [2019-09-08 12:49:18,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:18,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:19,053 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:19,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:19,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:49:19,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:49:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:49:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:49:19,054 INFO L87 Difference]: Start difference. First operand 9075 states and 13230 transitions. Second operand 13 states. [2019-09-08 12:49:19,786 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-08 12:49:20,003 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:49:20,182 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:49:20,379 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:49:20,730 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-08 12:49:20,973 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:49:21,143 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-08 12:49:22,245 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:49:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:47,923 INFO L93 Difference]: Finished difference Result 51256 states and 75099 transitions. [2019-09-08 12:49:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:49:47,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:49:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:47,958 INFO L225 Difference]: With dead ends: 51256 [2019-09-08 12:49:47,959 INFO L226 Difference]: Without dead ends: 44477 [2019-09-08 12:49:47,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:49:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44477 states. [2019-09-08 12:49:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44477 to 9014. [2019-09-08 12:49:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9014 states. [2019-09-08 12:49:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 13158 transitions. [2019-09-08 12:49:53,719 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 13158 transitions. Word has length 129 [2019-09-08 12:49:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:53,719 INFO L475 AbstractCegarLoop]: Abstraction has 9014 states and 13158 transitions. [2019-09-08 12:49:53,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:49:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 13158 transitions. [2019-09-08 12:49:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:49:53,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:53,721 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:49:53,721 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -355232424, now seen corresponding path program 1 times [2019-09-08 12:49:53,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:54,296 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:54,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:54,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:49:54,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:49:54,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:49:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:49:54,297 INFO L87 Difference]: Start difference. First operand 9014 states and 13158 transitions. Second operand 13 states. [2019-09-08 12:49:54,786 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 12:49:54,967 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 12:49:55,146 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 12:49:55,509 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 12:49:55,751 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 12:50:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:13,491 INFO L93 Difference]: Finished difference Result 35204 states and 51507 transitions. [2019-09-08 12:50:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:50:13,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:50:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:13,515 INFO L225 Difference]: With dead ends: 35204 [2019-09-08 12:50:13,516 INFO L226 Difference]: Without dead ends: 27642 [2019-09-08 12:50:13,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:50:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27642 states. [2019-09-08 12:50:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27642 to 8985. [2019-09-08 12:50:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8985 states. [2019-09-08 12:50:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 13124 transitions. [2019-09-08 12:50:19,351 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 13124 transitions. Word has length 129 [2019-09-08 12:50:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:19,352 INFO L475 AbstractCegarLoop]: Abstraction has 8985 states and 13124 transitions. [2019-09-08 12:50:19,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:50:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 13124 transitions. [2019-09-08 12:50:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:50:19,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:19,352 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:50:19,353 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1828191149, now seen corresponding path program 1 times [2019-09-08 12:50:19,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:20,248 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:20,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:20,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:20,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:20,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:20,250 INFO L87 Difference]: Start difference. First operand 8985 states and 13124 transitions. Second operand 17 states. [2019-09-08 12:50:21,031 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:50:21,187 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 12:50:21,539 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 12:50:21,711 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:50:21,888 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:50:22,158 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:50:22,421 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 12:50:22,595 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:50:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:46,259 INFO L93 Difference]: Finished difference Result 41992 states and 61577 transitions. [2019-09-08 12:50:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:50:46,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-08 12:50:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:46,289 INFO L225 Difference]: With dead ends: 41992 [2019-09-08 12:50:46,289 INFO L226 Difference]: Without dead ends: 34399 [2019-09-08 12:50:46,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:50:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34399 states. [2019-09-08 12:50:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34399 to 8680. [2019-09-08 12:50:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8680 states. [2019-09-08 12:50:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8680 states to 8680 states and 12691 transitions. [2019-09-08 12:50:52,200 INFO L78 Accepts]: Start accepts. Automaton has 8680 states and 12691 transitions. Word has length 129 [2019-09-08 12:50:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:52,200 INFO L475 AbstractCegarLoop]: Abstraction has 8680 states and 12691 transitions. [2019-09-08 12:50:52,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8680 states and 12691 transitions. [2019-09-08 12:50:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:50:52,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:52,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,202 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2075775711, now seen corresponding path program 1 times [2019-09-08 12:50:52,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:52,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:52,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:50:52,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:50:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:50:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:50:52,329 INFO L87 Difference]: Start difference. First operand 8680 states and 12691 transitions. Second operand 7 states. [2019-09-08 12:51:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:22,656 INFO L93 Difference]: Finished difference Result 52412 states and 76709 transitions. [2019-09-08 12:51:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:51:22,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-08 12:51:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:22,696 INFO L225 Difference]: With dead ends: 52412 [2019-09-08 12:51:22,697 INFO L226 Difference]: Without dead ends: 43858 [2019-09-08 12:51:22,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:51:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43858 states. [2019-09-08 12:51:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43858 to 18452. [2019-09-08 12:51:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2019-09-08 12:51:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 26956 transitions. [2019-09-08 12:51:34,824 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 26956 transitions. Word has length 164 [2019-09-08 12:51:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:34,825 INFO L475 AbstractCegarLoop]: Abstraction has 18452 states and 26956 transitions. [2019-09-08 12:51:34,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:51:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 26956 transitions. [2019-09-08 12:51:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:51:34,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:34,827 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:34,828 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1984049311, now seen corresponding path program 1 times [2019-09-08 12:51:34,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:34,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:34,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:34,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:51:34,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:51:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:51:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:34,950 INFO L87 Difference]: Start difference. First operand 18452 states and 26956 transitions. Second operand 7 states. [2019-09-08 12:52:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:31,135 INFO L93 Difference]: Finished difference Result 101028 states and 147180 transitions. [2019-09-08 12:52:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:52:31,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-08 12:52:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:31,215 INFO L225 Difference]: With dead ends: 101028 [2019-09-08 12:52:31,215 INFO L226 Difference]: Without dead ends: 82702 [2019-09-08 12:52:31,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:52:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82702 states. [2019-09-08 12:52:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82702 to 39216. [2019-09-08 12:52:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39216 states. [2019-09-08 12:52:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39216 states to 39216 states and 57194 transitions. [2019-09-08 12:52:56,757 INFO L78 Accepts]: Start accepts. Automaton has 39216 states and 57194 transitions. Word has length 164 [2019-09-08 12:52:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:56,757 INFO L475 AbstractCegarLoop]: Abstraction has 39216 states and 57194 transitions. [2019-09-08 12:52:56,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:52:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 39216 states and 57194 transitions. [2019-09-08 12:52:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:52:56,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:56,761 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:56,761 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1474728358, now seen corresponding path program 1 times [2019-09-08 12:52:56,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:56,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:56,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:57,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:52:57,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:52:57,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:58,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:52:58,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:52:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:58,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:52:58,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 12:52:58,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:52:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:52:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:52:58,288 INFO L87 Difference]: Start difference. First operand 39216 states and 57194 transitions. Second operand 11 states. [2019-09-08 12:54:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:21,147 INFO L93 Difference]: Finished difference Result 160880 states and 233990 transitions. [2019-09-08 12:54:21,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:54:21,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2019-09-08 12:54:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:21,588 INFO L225 Difference]: With dead ends: 160880 [2019-09-08 12:54:21,589 INFO L226 Difference]: Without dead ends: 121790 [2019-09-08 12:54:21,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:54:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121790 states. [2019-09-08 12:55:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121790 to 81719. [2019-09-08 12:55:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81719 states. [2019-09-08 12:55:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81719 states to 81719 states and 118645 transitions. [2019-09-08 12:55:19,487 INFO L78 Accepts]: Start accepts. Automaton has 81719 states and 118645 transitions. Word has length 164 [2019-09-08 12:55:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:19,488 INFO L475 AbstractCegarLoop]: Abstraction has 81719 states and 118645 transitions. [2019-09-08 12:55:19,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:55:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 81719 states and 118645 transitions. [2019-09-08 12:55:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:55:19,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:19,498 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:19,498 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -465450009, now seen corresponding path program 1 times [2019-09-08 12:55:19,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:19,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:19,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:55:19,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:55:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:55:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:55:19,668 INFO L87 Difference]: Start difference. First operand 81719 states and 118645 transitions. Second operand 7 states.