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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.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-10 08:30:55,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:30:55,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:30:55,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:30:55,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:30:55,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:30:55,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:30:55,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:30:55,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:30:55,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:30:55,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:30:55,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:30:55,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:30:55,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:30:55,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:30:55,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:30:55,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:30:55,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:30:55,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:30:55,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:30:55,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:30:55,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:30:55,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:30:55,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:30:55,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:30:55,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:30:55,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:30:55,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:30:55,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:30:55,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:30:55,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:30:55,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:30:55,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:30:55,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:30:55,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:30:55,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:30:55,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:30:55,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:30:55,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:30:55,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:30:55,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:30:55,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:30:55,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:30:55,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:30:55,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:30:55,457 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:30:55,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:30:55,458 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:30:55,458 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:30:55,458 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:30:55,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:30:55,459 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:30:55,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:30:55,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:30:55,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:30:55,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:30:55,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:30:55,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:30:55,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:30:55,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:30:55,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:30:55,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:30:55,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:30:55,462 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:30:55,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:30:55,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:30:55,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:30:55,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:30:55,463 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:30:55,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:30:55,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:30:55,463 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:30:55,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:30:55,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:30:55,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:30:55,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:30:55,509 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:30:55,510 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-10 08:30:55,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36c4d2cd/92ed7afb3e744f71aa95279b2ce19191/FLAGfb70caab0 [2019-09-10 08:30:56,179 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:30:56,180 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-10 08:30:56,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36c4d2cd/92ed7afb3e744f71aa95279b2ce19191/FLAGfb70caab0 [2019-09-10 08:30:56,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36c4d2cd/92ed7afb3e744f71aa95279b2ce19191 [2019-09-10 08:30:56,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:30:56,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:30:56,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:30:56,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:30:56,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:30:56,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:30:56" (1/1) ... [2019-09-10 08:30:56,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:56, skipping insertion in model container [2019-09-10 08:30:56,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:30:56" (1/1) ... [2019-09-10 08:30:56,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:30:56,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:30:56,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:30:56,921 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:30:57,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:30:57,114 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:30:57,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57 WrapperNode [2019-09-10 08:30:57,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:30:57,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:30:57,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:30:57,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:30:57,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (1/1) ... [2019-09-10 08:30:57,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:30:57,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:30:57,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:30:57,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:30:57,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (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-10 08:30:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:30:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:30:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:30:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:30:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:30:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:30:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:30:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:30:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:30:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:30:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:30:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:30:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:30:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:30:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:30:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:30:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:30:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:30:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:30:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:30:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:30:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:30:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:30:58,387 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:30:58,388 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:30:58,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:30:58 BoogieIcfgContainer [2019-09-10 08:30:58,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:30:58,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:30:58,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:30:58,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:30:58,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:30:56" (1/3) ... [2019-09-10 08:30:58,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149dcc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:30:58, skipping insertion in model container [2019-09-10 08:30:58,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:57" (2/3) ... [2019-09-10 08:30:58,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149dcc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:30:58, skipping insertion in model container [2019-09-10 08:30:58,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:30:58" (3/3) ... [2019-09-10 08:30:58,398 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:30:58,408 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:30:58,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:30:58,447 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:30:58,472 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:30:58,472 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:30:58,472 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:30:58,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:30:58,473 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:30:58,473 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:30:58,473 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:30:58,473 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:30:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-09-10 08:30:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:30:58,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:58,523 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-10 08:30:58,528 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1579256941, now seen corresponding path program 1 times [2019-09-10 08:30:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:58,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:58,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:58,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:58,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:59,078 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-10 08:30:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:59,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:59,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:59,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:59,105 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2019-09-10 08:30:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:59,278 INFO L93 Difference]: Finished difference Result 313 states and 524 transitions. [2019-09-10 08:30:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:59,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:30:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:59,296 INFO L225 Difference]: With dead ends: 313 [2019-09-10 08:30:59,297 INFO L226 Difference]: Without dead ends: 305 [2019-09-10 08:30:59,299 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-10 08:30:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-10 08:30:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-09-10 08:30:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:30:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2019-09-10 08:30:59,367 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 111 [2019-09-10 08:30:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:59,369 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2019-09-10 08:30:59,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2019-09-10 08:30:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:30:59,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:59,373 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-10 08:30:59,374 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash -529337958, now seen corresponding path program 1 times [2019-09-10 08:30:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:59,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:59,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:59,673 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-10 08:30:59,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:59,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:59,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:59,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:59,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:59,678 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand 5 states. [2019-09-10 08:30:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:59,988 INFO L93 Difference]: Finished difference Result 303 states and 432 transitions. [2019-09-10 08:30:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:59,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:30:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:59,992 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:30:59,992 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:30:59,993 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-10 08:30:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions. [2019-09-10 08:31:00,026 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 113 [2019-09-10 08:31:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:00,026 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 432 transitions. [2019-09-10 08:31:00,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions. [2019-09-10 08:31:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:31:00,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:00,033 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-10 08:31:00,033 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1399262783, now seen corresponding path program 1 times [2019-09-10 08:31:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:00,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:00,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:00,197 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-10 08:31:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:00,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:00,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:00,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:00,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:00,199 INFO L87 Difference]: Start difference. First operand 303 states and 432 transitions. Second operand 5 states. [2019-09-10 08:31:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:00,450 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2019-09-10 08:31:00,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:00,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 08:31:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:00,454 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:00,454 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:00,455 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-10 08:31:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 429 transitions. [2019-09-10 08:31:00,469 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 429 transitions. Word has length 114 [2019-09-10 08:31:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:00,470 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 429 transitions. [2019-09-10 08:31:00,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 429 transitions. [2019-09-10 08:31:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:31:00,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:00,473 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-10 08:31:00,474 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash -360394647, now seen corresponding path program 1 times [2019-09-10 08:31:00,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:00,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:00,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:00,677 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-10 08:31:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:00,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:00,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:00,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:00,680 INFO L87 Difference]: Start difference. First operand 303 states and 429 transitions. Second operand 5 states. [2019-09-10 08:31:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:01,049 INFO L93 Difference]: Finished difference Result 303 states and 426 transitions. [2019-09-10 08:31:01,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:01,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 08:31:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:01,053 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:01,053 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:01,054 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-10 08:31:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2019-09-10 08:31:01,065 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 115 [2019-09-10 08:31:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:01,067 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2019-09-10 08:31:01,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2019-09-10 08:31:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:31:01,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:01,070 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-10 08:31:01,071 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -72559888, now seen corresponding path program 1 times [2019-09-10 08:31:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:01,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:01,227 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-10 08:31:01,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:01,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:01,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:01,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:01,230 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand 5 states. [2019-09-10 08:31:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:01,435 INFO L93 Difference]: Finished difference Result 303 states and 423 transitions. [2019-09-10 08:31:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:01,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:31:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:01,438 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:01,439 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:01,440 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-10 08:31:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 423 transitions. [2019-09-10 08:31:01,448 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 423 transitions. Word has length 116 [2019-09-10 08:31:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:01,449 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 423 transitions. [2019-09-10 08:31:01,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 423 transitions. [2019-09-10 08:31:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:31:01,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:01,451 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-10 08:31:01,451 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:01,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1918050182, now seen corresponding path program 1 times [2019-09-10 08:31:01,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:01,605 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-10 08:31:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:01,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:01,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:01,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:01,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:01,609 INFO L87 Difference]: Start difference. First operand 303 states and 423 transitions. Second operand 5 states. [2019-09-10 08:31:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:01,836 INFO L93 Difference]: Finished difference Result 303 states and 420 transitions. [2019-09-10 08:31:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:01,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-10 08:31:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:01,838 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:01,839 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:01,839 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-10 08:31:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 420 transitions. [2019-09-10 08:31:01,849 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 420 transitions. Word has length 117 [2019-09-10 08:31:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:01,849 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 420 transitions. [2019-09-10 08:31:01,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 420 transitions. [2019-09-10 08:31:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:01,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:01,851 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-10 08:31:01,852 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:01,852 INFO L82 PathProgramCache]: Analyzing trace with hash -694845729, now seen corresponding path program 1 times [2019-09-10 08:31:01,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:01,965 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-10 08:31:01,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:01,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:01,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:01,967 INFO L87 Difference]: Start difference. First operand 303 states and 420 transitions. Second operand 5 states. [2019-09-10 08:31:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:02,173 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2019-09-10 08:31:02,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:02,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-10 08:31:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:02,176 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:02,176 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:02,176 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-10 08:31:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2019-09-10 08:31:02,186 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 118 [2019-09-10 08:31:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:02,186 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2019-09-10 08:31:02,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2019-09-10 08:31:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:02,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:02,188 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-10 08:31:02,189 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1872587080, now seen corresponding path program 1 times [2019-09-10 08:31:02,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:02,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:02,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:02,318 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-10 08:31:02,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:02,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:02,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:02,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:02,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:02,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:02,320 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand 5 states. [2019-09-10 08:31:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:02,506 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2019-09-10 08:31:02,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:02,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-10 08:31:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:02,509 INFO L225 Difference]: With dead ends: 303 [2019-09-10 08:31:02,509 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 08:31:02,510 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-10 08:31:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 08:31:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 08:31:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:31:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2019-09-10 08:31:02,519 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 119 [2019-09-10 08:31:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:02,519 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2019-09-10 08:31:02,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2019-09-10 08:31:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:02,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:02,522 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-10 08:31:02,522 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1611484050, now seen corresponding path program 1 times [2019-09-10 08:31:02,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:02,753 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-10 08:31:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:02,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:02,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:02,755 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand 5 states. [2019-09-10 08:31:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:02,896 INFO L93 Difference]: Finished difference Result 716 states and 1033 transitions. [2019-09-10 08:31:02,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:02,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:31:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:02,902 INFO L225 Difference]: With dead ends: 716 [2019-09-10 08:31:02,903 INFO L226 Difference]: Without dead ends: 716 [2019-09-10 08:31:02,903 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-10 08:31:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-10 08:31:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 657. [2019-09-10 08:31:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 08:31:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 952 transitions. [2019-09-10 08:31:02,923 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 952 transitions. Word has length 120 [2019-09-10 08:31:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:02,923 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 952 transitions. [2019-09-10 08:31:02,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 952 transitions. [2019-09-10 08:31:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:02,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:02,925 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-10 08:31:02,926 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1110184227, now seen corresponding path program 1 times [2019-09-10 08:31:02,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:03,076 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-10 08:31:03,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:03,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:03,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:03,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:03,085 INFO L87 Difference]: Start difference. First operand 657 states and 952 transitions. Second operand 5 states. [2019-09-10 08:31:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:03,197 INFO L93 Difference]: Finished difference Result 1158 states and 1704 transitions. [2019-09-10 08:31:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:03,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:31:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:03,205 INFO L225 Difference]: With dead ends: 1158 [2019-09-10 08:31:03,206 INFO L226 Difference]: Without dead ends: 1158 [2019-09-10 08:31:03,206 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-10 08:31:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-10 08:31:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 910. [2019-09-10 08:31:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 08:31:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1337 transitions. [2019-09-10 08:31:03,233 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1337 transitions. Word has length 120 [2019-09-10 08:31:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:03,234 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1337 transitions. [2019-09-10 08:31:03,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1337 transitions. [2019-09-10 08:31:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:03,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:03,236 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-10 08:31:03,236 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1346892231, now seen corresponding path program 1 times [2019-09-10 08:31:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:03,393 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-10 08:31:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:03,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:03,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:03,395 INFO L87 Difference]: Start difference. First operand 910 states and 1337 transitions. Second operand 5 states. [2019-09-10 08:31:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:03,521 INFO L93 Difference]: Finished difference Result 1361 states and 2013 transitions. [2019-09-10 08:31:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:03,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:31:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:03,533 INFO L225 Difference]: With dead ends: 1361 [2019-09-10 08:31:03,534 INFO L226 Difference]: Without dead ends: 1361 [2019-09-10 08:31:03,537 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-10 08:31:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-10 08:31:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1153. [2019-09-10 08:31:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-09-10 08:31:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1706 transitions. [2019-09-10 08:31:03,581 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1706 transitions. Word has length 120 [2019-09-10 08:31:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:03,582 INFO L475 AbstractCegarLoop]: Abstraction has 1153 states and 1706 transitions. [2019-09-10 08:31:03,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1706 transitions. [2019-09-10 08:31:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:03,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:03,585 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-10 08:31:03,586 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash 628970857, now seen corresponding path program 1 times [2019-09-10 08:31:03,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:03,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-10 08:31:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:31:03,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:03,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:31:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:31:03,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:31:03,770 INFO L87 Difference]: Start difference. First operand 1153 states and 1706 transitions. Second operand 3 states. [2019-09-10 08:31:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:03,850 INFO L93 Difference]: Finished difference Result 1155 states and 1702 transitions. [2019-09-10 08:31:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:31:03,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:31:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:03,858 INFO L225 Difference]: With dead ends: 1155 [2019-09-10 08:31:03,858 INFO L226 Difference]: Without dead ends: 1155 [2019-09-10 08:31:03,859 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-10 08:31:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-09-10 08:31:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2019-09-10 08:31:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-09-10 08:31:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1701 transitions. [2019-09-10 08:31:03,915 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1701 transitions. Word has length 120 [2019-09-10 08:31:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:03,916 INFO L475 AbstractCegarLoop]: Abstraction has 1153 states and 1701 transitions. [2019-09-10 08:31:03,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:31:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1701 transitions. [2019-09-10 08:31:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:03,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:03,918 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-10 08:31:03,918 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash 385846506, now seen corresponding path program 1 times [2019-09-10 08:31:03,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:03,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:04,010 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-10 08:31:04,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:04,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:31:04,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:04,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:31:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:31:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:31:04,012 INFO L87 Difference]: Start difference. First operand 1153 states and 1701 transitions. Second operand 3 states. [2019-09-10 08:31:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:04,056 INFO L93 Difference]: Finished difference Result 2020 states and 2970 transitions. [2019-09-10 08:31:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:31:04,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:31:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:04,068 INFO L225 Difference]: With dead ends: 2020 [2019-09-10 08:31:04,068 INFO L226 Difference]: Without dead ends: 2020 [2019-09-10 08:31:04,068 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-10 08:31:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-10 08:31:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1994. [2019-09-10 08:31:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-09-10 08:31:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2933 transitions. [2019-09-10 08:31:04,134 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2933 transitions. Word has length 120 [2019-09-10 08:31:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:04,135 INFO L475 AbstractCegarLoop]: Abstraction has 1994 states and 2933 transitions. [2019-09-10 08:31:04,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:31:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2933 transitions. [2019-09-10 08:31:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:04,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:04,137 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-10 08:31:04,138 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1534182572, now seen corresponding path program 1 times [2019-09-10 08:31:04,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:04,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:04,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:04,394 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-10 08:31:04,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:04,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:04,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:04,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:04,396 INFO L87 Difference]: Start difference. First operand 1994 states and 2933 transitions. Second operand 9 states. [2019-09-10 08:31:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:04,718 INFO L93 Difference]: Finished difference Result 5911 states and 8749 transitions. [2019-09-10 08:31:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:04,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:31:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:04,752 INFO L225 Difference]: With dead ends: 5911 [2019-09-10 08:31:04,752 INFO L226 Difference]: Without dead ends: 5911 [2019-09-10 08:31:04,753 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-10 08:31:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2019-09-10 08:31:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 2293. [2019-09-10 08:31:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-10 08:31:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3377 transitions. [2019-09-10 08:31:05,018 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3377 transitions. Word has length 120 [2019-09-10 08:31:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,019 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3377 transitions. [2019-09-10 08:31:05,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3377 transitions. [2019-09-10 08:31:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:05,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,023 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-10 08:31:05,023 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2082666138, now seen corresponding path program 1 times [2019-09-10 08:31:05,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:05,210 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-10 08:31:05,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:05,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:05,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:05,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:05,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:05,213 INFO L87 Difference]: Start difference. First operand 2293 states and 3377 transitions. Second operand 5 states. [2019-09-10 08:31:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:05,374 INFO L93 Difference]: Finished difference Result 2948 states and 4340 transitions. [2019-09-10 08:31:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:05,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:31:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:05,392 INFO L225 Difference]: With dead ends: 2948 [2019-09-10 08:31:05,393 INFO L226 Difference]: Without dead ends: 2948 [2019-09-10 08:31:05,395 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-10 08:31:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2019-09-10 08:31:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2592. [2019-09-10 08:31:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2592 states. [2019-09-10 08:31:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3822 transitions. [2019-09-10 08:31:05,492 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3822 transitions. Word has length 120 [2019-09-10 08:31:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,493 INFO L475 AbstractCegarLoop]: Abstraction has 2592 states and 3822 transitions. [2019-09-10 08:31:05,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3822 transitions. [2019-09-10 08:31:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:05,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,495 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-10 08:31:05,496 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1273267460, now seen corresponding path program 1 times [2019-09-10 08:31:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:05,630 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-10 08:31:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:05,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:05,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:05,634 INFO L87 Difference]: Start difference. First operand 2592 states and 3822 transitions. Second operand 5 states. [2019-09-10 08:31:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:05,751 INFO L93 Difference]: Finished difference Result 3337 states and 4921 transitions. [2019-09-10 08:31:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:05,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:31:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:05,768 INFO L225 Difference]: With dead ends: 3337 [2019-09-10 08:31:05,768 INFO L226 Difference]: Without dead ends: 3337 [2019-09-10 08:31:05,768 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-10 08:31:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2019-09-10 08:31:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2901. [2019-09-10 08:31:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-09-10 08:31:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4283 transitions. [2019-09-10 08:31:05,866 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 4283 transitions. Word has length 120 [2019-09-10 08:31:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,867 INFO L475 AbstractCegarLoop]: Abstraction has 2901 states and 4283 transitions. [2019-09-10 08:31:05,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4283 transitions. [2019-09-10 08:31:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:31:05,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,869 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-10 08:31:05,869 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -229628659, now seen corresponding path program 1 times [2019-09-10 08:31:05,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:06,115 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-10 08:31:06,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:06,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:06,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:06,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:06,117 INFO L87 Difference]: Start difference. First operand 2901 states and 4283 transitions. Second operand 9 states. [2019-09-10 08:31:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:06,423 INFO L93 Difference]: Finished difference Result 6127 states and 9073 transitions. [2019-09-10 08:31:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:06,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:31:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:06,453 INFO L225 Difference]: With dead ends: 6127 [2019-09-10 08:31:06,453 INFO L226 Difference]: Without dead ends: 6127 [2019-09-10 08:31:06,453 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-10 08:31:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-09-10 08:31:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 3366. [2019-09-10 08:31:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-09-10 08:31:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4974 transitions. [2019-09-10 08:31:06,550 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4974 transitions. Word has length 120 [2019-09-10 08:31:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:06,550 INFO L475 AbstractCegarLoop]: Abstraction has 3366 states and 4974 transitions. [2019-09-10 08:31:06,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4974 transitions. [2019-09-10 08:31:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:31:06,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:06,553 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-10 08:31:06,553 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1978649096, now seen corresponding path program 1 times [2019-09-10 08:31:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:06,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:06,684 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-10 08:31:06,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:06,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:31:06,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:06,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:31:06,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:31:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:31:06,686 INFO L87 Difference]: Start difference. First operand 3366 states and 4974 transitions. Second operand 5 states. [2019-09-10 08:31:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:06,744 INFO L93 Difference]: Finished difference Result 5927 states and 8751 transitions. [2019-09-10 08:31:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:31:06,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:31:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:06,759 INFO L225 Difference]: With dead ends: 5927 [2019-09-10 08:31:06,759 INFO L226 Difference]: Without dead ends: 5927 [2019-09-10 08:31:06,760 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-10 08:31:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-09-10 08:31:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 3392. [2019-09-10 08:31:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-10 08:31:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4994 transitions. [2019-09-10 08:31:06,850 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4994 transitions. Word has length 121 [2019-09-10 08:31:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:06,851 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4994 transitions. [2019-09-10 08:31:06,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:31:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4994 transitions. [2019-09-10 08:31:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:31:06,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:06,854 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-10 08:31:06,854 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash -690965260, now seen corresponding path program 1 times [2019-09-10 08:31:06,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:06,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:07,175 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-10 08:31:07,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:07,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:07,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:07,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:07,178 INFO L87 Difference]: Start difference. First operand 3392 states and 4994 transitions. Second operand 9 states. [2019-09-10 08:31:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:07,948 INFO L93 Difference]: Finished difference Result 6545 states and 9664 transitions. [2019-09-10 08:31:07,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:31:07,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:31:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:07,966 INFO L225 Difference]: With dead ends: 6545 [2019-09-10 08:31:07,966 INFO L226 Difference]: Without dead ends: 6545 [2019-09-10 08:31:07,967 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-10 08:31:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2019-09-10 08:31:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 3392. [2019-09-10 08:31:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-10 08:31:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4993 transitions. [2019-09-10 08:31:08,057 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4993 transitions. Word has length 121 [2019-09-10 08:31:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:08,058 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4993 transitions. [2019-09-10 08:31:08,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4993 transitions. [2019-09-10 08:31:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:31:08,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:08,061 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-10 08:31:08,061 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -66846392, now seen corresponding path program 1 times [2019-09-10 08:31:08,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:08,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:08,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:08,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:08,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:08,331 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-10 08:31:08,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:08,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:08,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:08,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:08,333 INFO L87 Difference]: Start difference. First operand 3392 states and 4993 transitions. Second operand 10 states. [2019-09-10 08:31:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:09,306 INFO L93 Difference]: Finished difference Result 6737 states and 9913 transitions. [2019-09-10 08:31:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:31:09,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-10 08:31:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:09,322 INFO L225 Difference]: With dead ends: 6737 [2019-09-10 08:31:09,322 INFO L226 Difference]: Without dead ends: 6737 [2019-09-10 08:31:09,323 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-10 08:31:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6737 states. [2019-09-10 08:31:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6737 to 3392. [2019-09-10 08:31:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-10 08:31:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4991 transitions. [2019-09-10 08:31:09,416 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4991 transitions. Word has length 122 [2019-09-10 08:31:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:09,416 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4991 transitions. [2019-09-10 08:31:09,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4991 transitions. [2019-09-10 08:31:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:31:09,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:09,418 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-10 08:31:09,419 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 593355322, now seen corresponding path program 1 times [2019-09-10 08:31:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:09,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:09,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:09,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:09,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:09,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:09,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:09,756 INFO L87 Difference]: Start difference. First operand 3392 states and 4991 transitions. Second operand 10 states. [2019-09-10 08:31:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:10,719 INFO L93 Difference]: Finished difference Result 6722 states and 9880 transitions. [2019-09-10 08:31:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:31:10,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-10 08:31:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:10,732 INFO L225 Difference]: With dead ends: 6722 [2019-09-10 08:31:10,733 INFO L226 Difference]: Without dead ends: 6722 [2019-09-10 08:31:10,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-09-10 08:31:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 3392. [2019-09-10 08:31:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2019-09-10 08:31:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4985 transitions. [2019-09-10 08:31:10,817 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4985 transitions. Word has length 122 [2019-09-10 08:31:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:10,817 INFO L475 AbstractCegarLoop]: Abstraction has 3392 states and 4985 transitions. [2019-09-10 08:31:10,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4985 transitions. [2019-09-10 08:31:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:10,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:10,820 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-10 08:31:10,820 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash -340793067, now seen corresponding path program 1 times [2019-09-10 08:31:10,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:10,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:10,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:11,098 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-10 08:31:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:11,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:11,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:11,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:11,100 INFO L87 Difference]: Start difference. First operand 3392 states and 4985 transitions. Second operand 10 states. [2019-09-10 08:31:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:12,384 INFO L93 Difference]: Finished difference Result 12491 states and 18252 transitions. [2019-09-10 08:31:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:31:12,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:31:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:12,454 INFO L225 Difference]: With dead ends: 12491 [2019-09-10 08:31:12,454 INFO L226 Difference]: Without dead ends: 12491 [2019-09-10 08:31:12,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:31:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2019-09-10 08:31:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 3419. [2019-09-10 08:31:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-10 08:31:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5021 transitions. [2019-09-10 08:31:12,586 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5021 transitions. Word has length 123 [2019-09-10 08:31:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:12,587 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5021 transitions. [2019-09-10 08:31:12,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5021 transitions. [2019-09-10 08:31:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:31:12,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:12,589 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-10 08:31:12,589 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1421082261, now seen corresponding path program 1 times [2019-09-10 08:31:12,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:12,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:12,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:12,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:12,861 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-10 08:31:12,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:12,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:12,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:12,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:12,863 INFO L87 Difference]: Start difference. First operand 3419 states and 5021 transitions. Second operand 10 states. [2019-09-10 08:31:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:13,869 INFO L93 Difference]: Finished difference Result 6769 states and 9937 transitions. [2019-09-10 08:31:13,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:31:13,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-10 08:31:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:13,886 INFO L225 Difference]: With dead ends: 6769 [2019-09-10 08:31:13,887 INFO L226 Difference]: Without dead ends: 6769 [2019-09-10 08:31:13,887 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-10 08:31:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2019-09-10 08:31:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 3419. [2019-09-10 08:31:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-10 08:31:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5017 transitions. [2019-09-10 08:31:13,968 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5017 transitions. Word has length 124 [2019-09-10 08:31:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:13,968 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5017 transitions. [2019-09-10 08:31:13,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5017 transitions. [2019-09-10 08:31:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:31:13,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:13,971 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-10 08:31:13,971 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 534763643, now seen corresponding path program 1 times [2019-09-10 08:31:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:14,204 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-10 08:31:14,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:14,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:14,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:14,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:14,206 INFO L87 Difference]: Start difference. First operand 3419 states and 5017 transitions. Second operand 10 states. [2019-09-10 08:31:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:15,196 INFO L93 Difference]: Finished difference Result 6723 states and 9853 transitions. [2019-09-10 08:31:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:31:15,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-10 08:31:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:15,208 INFO L225 Difference]: With dead ends: 6723 [2019-09-10 08:31:15,208 INFO L226 Difference]: Without dead ends: 6723 [2019-09-10 08:31:15,208 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-10 08:31:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2019-09-10 08:31:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 3419. [2019-09-10 08:31:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-10 08:31:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5009 transitions. [2019-09-10 08:31:15,282 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5009 transitions. Word has length 125 [2019-09-10 08:31:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:15,283 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5009 transitions. [2019-09-10 08:31:15,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5009 transitions. [2019-09-10 08:31:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:31:15,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:15,285 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-10 08:31:15,285 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1461446239, now seen corresponding path program 1 times [2019-09-10 08:31:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:15,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:15,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:15,561 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-10 08:31:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:15,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:31:15,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:15,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:31:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:31:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:31:15,564 INFO L87 Difference]: Start difference. First operand 3419 states and 5009 transitions. Second operand 10 states. [2019-09-10 08:31:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:16,856 INFO L93 Difference]: Finished difference Result 6753 states and 9888 transitions. [2019-09-10 08:31:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:31:16,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-10 08:31:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:16,872 INFO L225 Difference]: With dead ends: 6753 [2019-09-10 08:31:16,872 INFO L226 Difference]: Without dead ends: 6753 [2019-09-10 08:31:16,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-09-10 08:31:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 3419. [2019-09-10 08:31:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2019-09-10 08:31:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5002 transitions. [2019-09-10 08:31:16,941 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5002 transitions. Word has length 126 [2019-09-10 08:31:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:16,942 INFO L475 AbstractCegarLoop]: Abstraction has 3419 states and 5002 transitions. [2019-09-10 08:31:16,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:31:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5002 transitions. [2019-09-10 08:31:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:16,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:16,946 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-10 08:31:16,946 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 195353613, now seen corresponding path program 1 times [2019-09-10 08:31:16,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:16,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:16,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:16,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:16,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:18,160 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-10 08:31:18,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:18,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:31:18,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:18,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:31:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:31:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:31:18,162 INFO L87 Difference]: Start difference. First operand 3419 states and 5002 transitions. Second operand 19 states. [2019-09-10 08:31:18,815 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-10 08:31:19,032 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:31:19,326 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 08:31:19,656 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 08:31:19,842 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:31:20,218 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:31:20,517 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:31:20,722 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:31:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:21,934 INFO L93 Difference]: Finished difference Result 17128 states and 25280 transitions. [2019-09-10 08:31:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:31:21,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-10 08:31:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:21,957 INFO L225 Difference]: With dead ends: 17128 [2019-09-10 08:31:21,957 INFO L226 Difference]: Without dead ends: 17128 [2019-09-10 08:31:21,958 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-10 08:31:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-09-10 08:31:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 3429. [2019-09-10 08:31:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2019-09-10 08:31:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 5010 transitions. [2019-09-10 08:31:22,114 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 5010 transitions. Word has length 127 [2019-09-10 08:31:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:22,115 INFO L475 AbstractCegarLoop]: Abstraction has 3429 states and 5010 transitions. [2019-09-10 08:31:22,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:31:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 5010 transitions. [2019-09-10 08:31:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:22,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:22,117 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-10 08:31:22,118 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash -944880079, now seen corresponding path program 1 times [2019-09-10 08:31:22,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:22,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:22,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:23,163 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-10 08:31:23,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:23,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:31:23,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:23,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:31:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:31:23,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:31:23,165 INFO L87 Difference]: Start difference. First operand 3429 states and 5010 transitions. Second operand 18 states. [2019-09-10 08:31:24,009 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:31:24,241 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 08:31:24,597 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:31:24,780 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:31:24,988 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:31:25,207 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:31:25,493 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:31:25,799 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:31:26,213 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:31:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:26,801 INFO L93 Difference]: Finished difference Result 22356 states and 32816 transitions. [2019-09-10 08:31:26,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:31:26,802 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2019-09-10 08:31:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:26,830 INFO L225 Difference]: With dead ends: 22356 [2019-09-10 08:31:26,830 INFO L226 Difference]: Without dead ends: 22356 [2019-09-10 08:31:26,831 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-10 08:31:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22356 states. [2019-09-10 08:31:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22356 to 3589. [2019-09-10 08:31:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2019-09-10 08:31:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5225 transitions. [2019-09-10 08:31:27,038 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5225 transitions. Word has length 127 [2019-09-10 08:31:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:27,039 INFO L475 AbstractCegarLoop]: Abstraction has 3589 states and 5225 transitions. [2019-09-10 08:31:27,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:31:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5225 transitions. [2019-09-10 08:31:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:27,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:27,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:27,041 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2019210254, now seen corresponding path program 1 times [2019-09-10 08:31:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:27,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:28,629 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-10 08:31:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:28,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:31:28,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:28,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:31:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:31:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:31:28,630 INFO L87 Difference]: Start difference. First operand 3589 states and 5225 transitions. Second operand 24 states. [2019-09-10 08:31:30,022 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:31:30,295 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:31:30,736 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:31:31,310 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 08:31:31,973 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-09-10 08:31:32,214 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:31:32,481 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:31:32,719 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:31:33,111 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 08:31:33,427 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:31:33,807 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:31:34,133 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:31:34,490 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:31:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:36,819 INFO L93 Difference]: Finished difference Result 24760 states and 36298 transitions. [2019-09-10 08:31:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:31:36,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-10 08:31:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:36,846 INFO L225 Difference]: With dead ends: 24760 [2019-09-10 08:31:36,846 INFO L226 Difference]: Without dead ends: 24760 [2019-09-10 08:31:36,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:31:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24760 states. [2019-09-10 08:31:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24760 to 3599. [2019-09-10 08:31:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-10 08:31:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5236 transitions. [2019-09-10 08:31:37,047 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5236 transitions. Word has length 127 [2019-09-10 08:31:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:37,047 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5236 transitions. [2019-09-10 08:31:37,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:31:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5236 transitions. [2019-09-10 08:31:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:37,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:37,050 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-10 08:31:37,050 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1008657458, now seen corresponding path program 1 times [2019-09-10 08:31:37,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:37,127 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-10 08:31:37,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:37,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:31:37,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:37,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:31:37,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:31:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:31:37,128 INFO L87 Difference]: Start difference. First operand 3599 states and 5236 transitions. Second operand 3 states. [2019-09-10 08:31:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:37,159 INFO L93 Difference]: Finished difference Result 6584 states and 9636 transitions. [2019-09-10 08:31:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:31:37,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 08:31:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:37,167 INFO L225 Difference]: With dead ends: 6584 [2019-09-10 08:31:37,167 INFO L226 Difference]: Without dead ends: 6584 [2019-09-10 08:31:37,169 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-10 08:31:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2019-09-10 08:31:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6414. [2019-09-10 08:31:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6414 states. [2019-09-10 08:31:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 9341 transitions. [2019-09-10 08:31:37,291 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 9341 transitions. Word has length 127 [2019-09-10 08:31:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:37,292 INFO L475 AbstractCegarLoop]: Abstraction has 6414 states and 9341 transitions. [2019-09-10 08:31:37,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:31:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 9341 transitions. [2019-09-10 08:31:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:37,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:37,294 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-10 08:31:37,294 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 125385868, now seen corresponding path program 1 times [2019-09-10 08:31:37,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:38,320 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-10 08:31:38,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:38,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:31:38,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:38,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:31:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:31:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:31:38,322 INFO L87 Difference]: Start difference. First operand 6414 states and 9341 transitions. Second operand 19 states. [2019-09-10 08:31:39,166 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 08:31:39,441 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:31:39,763 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 08:31:39,945 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:31:40,323 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:31:40,610 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:31:40,791 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:31:41,023 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:31:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:41,886 INFO L93 Difference]: Finished difference Result 26297 states and 38579 transitions. [2019-09-10 08:31:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:31:41,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-10 08:31:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:41,906 INFO L225 Difference]: With dead ends: 26297 [2019-09-10 08:31:41,906 INFO L226 Difference]: Without dead ends: 26297 [2019-09-10 08:31:41,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:31:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26297 states. [2019-09-10 08:31:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26297 to 6409. [2019-09-10 08:31:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6409 states. [2019-09-10 08:31:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 9328 transitions. [2019-09-10 08:31:42,075 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 9328 transitions. Word has length 127 [2019-09-10 08:31:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:42,076 INFO L475 AbstractCegarLoop]: Abstraction has 6409 states and 9328 transitions. [2019-09-10 08:31:42,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:31:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 9328 transitions. [2019-09-10 08:31:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:42,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:42,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:42,078 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1410801195, now seen corresponding path program 1 times [2019-09-10 08:31:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:42,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:42,997 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:31:43,254 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:31:43,865 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-10 08:31:43,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:43,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:31:43,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:43,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:31:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:31:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:31:43,867 INFO L87 Difference]: Start difference. First operand 6409 states and 9328 transitions. Second operand 25 states. [2019-09-10 08:31:45,062 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 08:31:45,356 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:31:45,759 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:31:46,163 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-10 08:31:46,665 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-10 08:31:47,204 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2019-09-10 08:31:47,445 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 08:31:47,938 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:31:48,406 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:31:48,643 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:31:49,026 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:31:49,507 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:31:49,934 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:31:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:52,046 INFO L93 Difference]: Finished difference Result 32468 states and 47606 transitions. [2019-09-10 08:31:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:31:52,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 127 [2019-09-10 08:31:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:52,072 INFO L225 Difference]: With dead ends: 32468 [2019-09-10 08:31:52,073 INFO L226 Difference]: Without dead ends: 32468 [2019-09-10 08:31:52,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:31:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32468 states. [2019-09-10 08:31:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32468 to 6427. [2019-09-10 08:31:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6427 states. [2019-09-10 08:31:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 9348 transitions. [2019-09-10 08:31:52,265 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 9348 transitions. Word has length 127 [2019-09-10 08:31:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:52,265 INFO L475 AbstractCegarLoop]: Abstraction has 6427 states and 9348 transitions. [2019-09-10 08:31:52,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:31:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 9348 transitions. [2019-09-10 08:31:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:31:52,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:52,267 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-10 08:31:52,267 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2022749332, now seen corresponding path program 1 times [2019-09-10 08:31:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:52,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:53,162 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-10 08:31:53,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:53,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:31:53,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:53,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:31:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:31:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:53,164 INFO L87 Difference]: Start difference. First operand 6427 states and 9348 transitions. Second operand 17 states. [2019-09-10 08:31:53,904 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:31:54,138 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 08:31:54,299 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:31:54,461 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:31:54,696 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:31:54,835 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:31:55,001 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:31:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:56,068 INFO L93 Difference]: Finished difference Result 33717 states and 49573 transitions. [2019-09-10 08:31:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:31:56,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-10 08:31:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:56,102 INFO L225 Difference]: With dead ends: 33717 [2019-09-10 08:31:56,102 INFO L226 Difference]: Without dead ends: 33717 [2019-09-10 08:31:56,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:31:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33717 states. [2019-09-10 08:31:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33717 to 6413. [2019-09-10 08:31:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-09-10 08:31:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 9329 transitions. [2019-09-10 08:31:56,316 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 9329 transitions. Word has length 127 [2019-09-10 08:31:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:56,317 INFO L475 AbstractCegarLoop]: Abstraction has 6413 states and 9329 transitions. [2019-09-10 08:31:56,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:31:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 9329 transitions. [2019-09-10 08:31:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:31:56,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:56,319 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-10 08:31:56,319 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1115215921, now seen corresponding path program 1 times [2019-09-10 08:31:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:56,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:56,463 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-10 08:31:56,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:56,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:31:56,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:56,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:31:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:31:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:31:56,465 INFO L87 Difference]: Start difference. First operand 6413 states and 9329 transitions. Second operand 4 states. [2019-09-10 08:31:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:56,529 INFO L93 Difference]: Finished difference Result 9317 states and 13531 transitions. [2019-09-10 08:31:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:31:56,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 08:31:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:56,540 INFO L225 Difference]: With dead ends: 9317 [2019-09-10 08:31:56,540 INFO L226 Difference]: Without dead ends: 9317 [2019-09-10 08:31:56,540 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-10 08:31:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2019-09-10 08:31:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9273. [2019-09-10 08:31:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9273 states. [2019-09-10 08:31:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9273 states to 9273 states and 13488 transitions. [2019-09-10 08:31:56,639 INFO L78 Accepts]: Start accepts. Automaton has 9273 states and 13488 transitions. Word has length 128 [2019-09-10 08:31:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:56,639 INFO L475 AbstractCegarLoop]: Abstraction has 9273 states and 13488 transitions. [2019-09-10 08:31:56,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:31:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 9273 states and 13488 transitions. [2019-09-10 08:31:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:31:56,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:56,641 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-10 08:31:56,641 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1141789032, now seen corresponding path program 1 times [2019-09-10 08:31:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:56,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:57,189 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-09-10 08:31:57,608 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-10 08:31:57,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:31:57,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:57,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:31:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:31:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:31:57,610 INFO L87 Difference]: Start difference. First operand 9273 states and 13488 transitions. Second operand 16 states. [2019-09-10 08:31:57,794 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:31:58,146 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:31:58,370 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:31:58,628 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:31:58,851 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:31:59,200 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-10 08:31:59,555 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-10 08:31:59,900 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-10 08:32:00,066 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:32:00,231 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:32:00,542 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 08:32:00,754 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:32:00,977 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:32:01,260 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-10 08:32:02,142 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:32:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:02,582 INFO L93 Difference]: Finished difference Result 53734 states and 78623 transitions. [2019-09-10 08:32:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:32:02,582 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2019-09-10 08:32:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:02,640 INFO L225 Difference]: With dead ends: 53734 [2019-09-10 08:32:02,640 INFO L226 Difference]: Without dead ends: 53734 [2019-09-10 08:32:02,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:32:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53734 states. [2019-09-10 08:32:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53734 to 9199. [2019-09-10 08:32:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-09-10 08:32:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 13384 transitions. [2019-09-10 08:32:02,942 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 13384 transitions. Word has length 128 [2019-09-10 08:32:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:02,942 INFO L475 AbstractCegarLoop]: Abstraction has 9199 states and 13384 transitions. [2019-09-10 08:32:02,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:32:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 13384 transitions. [2019-09-10 08:32:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:32:02,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:02,944 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-10 08:32:02,944 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1623352999, now seen corresponding path program 1 times [2019-09-10 08:32:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:02,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:02,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:03,970 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-10 08:32:03,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:03,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:32:03,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:03,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:32:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:32:03,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:32:03,972 INFO L87 Difference]: Start difference. First operand 9199 states and 13384 transitions. Second operand 19 states. [2019-09-10 08:32:04,603 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:32:04,797 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:32:05,087 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 08:32:05,496 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:32:05,674 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:32:06,012 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:32:06,260 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:32:06,498 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:32:06,727 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:32:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:07,839 INFO L93 Difference]: Finished difference Result 47277 states and 69222 transitions. [2019-09-10 08:32:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:32:07,839 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2019-09-10 08:32:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:07,879 INFO L225 Difference]: With dead ends: 47277 [2019-09-10 08:32:07,879 INFO L226 Difference]: Without dead ends: 47277 [2019-09-10 08:32:07,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:32:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47277 states. [2019-09-10 08:32:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47277 to 9199. [2019-09-10 08:32:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-09-10 08:32:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 13381 transitions. [2019-09-10 08:32:08,169 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 13381 transitions. Word has length 128 [2019-09-10 08:32:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:08,169 INFO L475 AbstractCegarLoop]: Abstraction has 9199 states and 13381 transitions. [2019-09-10 08:32:08,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:32:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 13381 transitions. [2019-09-10 08:32:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:32:08,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:08,171 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-10 08:32:08,171 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133977, now seen corresponding path program 1 times [2019-09-10 08:32:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:08,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:08,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:08,497 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-09-10 08:32:08,905 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-10 08:32:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:08,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:32:08,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:08,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:32:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:32:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:32:08,907 INFO L87 Difference]: Start difference. First operand 9199 states and 13381 transitions. Second operand 13 states. [2019-09-10 08:32:09,294 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:32:09,469 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:32:09,654 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:32:09,991 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:32:10,228 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:32:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:10,498 INFO L93 Difference]: Finished difference Result 35829 states and 52404 transitions. [2019-09-10 08:32:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:10,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-10 08:32:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:10,528 INFO L225 Difference]: With dead ends: 35829 [2019-09-10 08:32:10,529 INFO L226 Difference]: Without dead ends: 35829 [2019-09-10 08:32:10,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:32:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35829 states. [2019-09-10 08:32:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35829 to 9178. [2019-09-10 08:32:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9178 states. [2019-09-10 08:32:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 13352 transitions. [2019-09-10 08:32:10,753 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 13352 transitions. Word has length 128 [2019-09-10 08:32:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:10,753 INFO L475 AbstractCegarLoop]: Abstraction has 9178 states and 13352 transitions. [2019-09-10 08:32:10,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:32:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 13352 transitions. [2019-09-10 08:32:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:10,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:10,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:10,754 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1025878600, now seen corresponding path program 1 times [2019-09-10 08:32:10,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:10,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:10,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:11,405 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:32:11,689 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-10 08:32:11,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:11,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:32:11,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:11,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:32:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:32:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:32:11,690 INFO L87 Difference]: Start difference. First operand 9178 states and 13352 transitions. Second operand 16 states. [2019-09-10 08:32:12,494 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 08:32:12,696 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:32:12,898 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:32:13,285 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 08:32:13,559 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 08:32:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:14,327 INFO L93 Difference]: Finished difference Result 34911 states and 51108 transitions. [2019-09-10 08:32:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:32:14,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-10 08:32:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:14,356 INFO L225 Difference]: With dead ends: 34911 [2019-09-10 08:32:14,356 INFO L226 Difference]: Without dead ends: 34911 [2019-09-10 08:32:14,357 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-10 08:32:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34911 states. [2019-09-10 08:32:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34911 to 9108. [2019-09-10 08:32:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9108 states. [2019-09-10 08:32:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9108 states to 9108 states and 13270 transitions. [2019-09-10 08:32:14,570 INFO L78 Accepts]: Start accepts. Automaton has 9108 states and 13270 transitions. Word has length 129 [2019-09-10 08:32:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:14,571 INFO L475 AbstractCegarLoop]: Abstraction has 9108 states and 13270 transitions. [2019-09-10 08:32:14,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:32:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9108 states and 13270 transitions. [2019-09-10 08:32:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:14,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:14,572 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-10 08:32:14,572 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1300257325, now seen corresponding path program 1 times [2019-09-10 08:32:14,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:15,142 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 08:32:15,441 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-10 08:32:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:32:15,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:15,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:32:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:32:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:32:15,442 INFO L87 Difference]: Start difference. First operand 9108 states and 13270 transitions. Second operand 14 states. [2019-09-10 08:32:16,061 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:32:16,210 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:32:16,345 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:32:16,570 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 08:32:16,776 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 08:32:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:17,157 INFO L93 Difference]: Finished difference Result 35698 states and 52254 transitions. [2019-09-10 08:32:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:32:17,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-09-10 08:32:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:17,190 INFO L225 Difference]: With dead ends: 35698 [2019-09-10 08:32:17,190 INFO L226 Difference]: Without dead ends: 35698 [2019-09-10 08:32:17,190 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-10 08:32:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35698 states. [2019-09-10 08:32:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35698 to 9075. [2019-09-10 08:32:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-09-10 08:32:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 13230 transitions. [2019-09-10 08:32:17,497 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 13230 transitions. Word has length 129 [2019-09-10 08:32:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:17,497 INFO L475 AbstractCegarLoop]: Abstraction has 9075 states and 13230 transitions. [2019-09-10 08:32:17,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:32:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 13230 transitions. [2019-09-10 08:32:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:17,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:17,498 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-10 08:32:17,498 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash 29788909, now seen corresponding path program 1 times [2019-09-10 08:32:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:18,105 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-10 08:32:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:32:18,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:18,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:32:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:32:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:32:18,107 INFO L87 Difference]: Start difference. First operand 9075 states and 13230 transitions. Second operand 13 states. [2019-09-10 08:32:18,600 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:32:18,775 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:32:18,963 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:32:19,278 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:32:19,510 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:32:19,670 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:32:20,138 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:32:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:20,267 INFO L93 Difference]: Finished difference Result 44477 states and 65152 transitions. [2019-09-10 08:32:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:32:20,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:32:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:20,314 INFO L225 Difference]: With dead ends: 44477 [2019-09-10 08:32:20,314 INFO L226 Difference]: Without dead ends: 44477 [2019-09-10 08:32:20,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:32:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44477 states. [2019-09-10 08:32:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44477 to 9014. [2019-09-10 08:32:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9014 states. [2019-09-10 08:32:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 13158 transitions. [2019-09-10 08:32:20,611 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 13158 transitions. Word has length 129 [2019-09-10 08:32:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:20,611 INFO L475 AbstractCegarLoop]: Abstraction has 9014 states and 13158 transitions. [2019-09-10 08:32:20,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:32:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 13158 transitions. [2019-09-10 08:32:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:20,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:20,612 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-10 08:32:20,613 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash -355232424, now seen corresponding path program 1 times [2019-09-10 08:32:20,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:20,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:20,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:21,063 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 08:32:21,286 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-10 08:32:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:32:21,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:32:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:32:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:32:21,288 INFO L87 Difference]: Start difference. First operand 9014 states and 13158 transitions. Second operand 13 states. [2019-09-10 08:32:21,752 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 08:32:21,917 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 08:32:22,088 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 08:32:22,407 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:32:22,645 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 08:32:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:22,988 INFO L93 Difference]: Finished difference Result 27642 states and 40398 transitions. [2019-09-10 08:32:22,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:32:22,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:32:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:23,013 INFO L225 Difference]: With dead ends: 27642 [2019-09-10 08:32:23,013 INFO L226 Difference]: Without dead ends: 27642 [2019-09-10 08:32:23,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:32:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27642 states. [2019-09-10 08:32:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27642 to 8985. [2019-09-10 08:32:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8985 states. [2019-09-10 08:32:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 13124 transitions. [2019-09-10 08:32:23,158 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 13124 transitions. Word has length 129 [2019-09-10 08:32:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:23,158 INFO L475 AbstractCegarLoop]: Abstraction has 8985 states and 13124 transitions. [2019-09-10 08:32:23,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:32:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 13124 transitions. [2019-09-10 08:32:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:23,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:23,159 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-10 08:32:23,159 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1828191149, now seen corresponding path program 1 times [2019-09-10 08:32:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:23,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:23,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:24,108 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-10 08:32:24,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:24,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:32:24,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:24,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:32:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:32:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:24,110 INFO L87 Difference]: Start difference. First operand 8985 states and 13124 transitions. Second operand 17 states. [2019-09-10 08:32:24,857 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:32:25,008 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:32:25,343 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:32:25,512 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:32:25,683 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:32:25,956 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:32:26,207 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:32:26,380 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:32:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:27,349 INFO L93 Difference]: Finished difference Result 34403 states and 50437 transitions. [2019-09-10 08:32:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:32:27,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-10 08:32:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:27,380 INFO L225 Difference]: With dead ends: 34403 [2019-09-10 08:32:27,380 INFO L226 Difference]: Without dead ends: 34399 [2019-09-10 08:32:27,380 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-10 08:32:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34399 states. [2019-09-10 08:32:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34399 to 8680. [2019-09-10 08:32:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8680 states. [2019-09-10 08:32:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8680 states to 8680 states and 12691 transitions. [2019-09-10 08:32:27,583 INFO L78 Accepts]: Start accepts. Automaton has 8680 states and 12691 transitions. Word has length 129 [2019-09-10 08:32:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:27,584 INFO L475 AbstractCegarLoop]: Abstraction has 8680 states and 12691 transitions. [2019-09-10 08:32:27,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:32:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8680 states and 12691 transitions. [2019-09-10 08:32:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:27,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:27,586 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-10 08:32:27,586 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2075775711, now seen corresponding path program 1 times [2019-09-10 08:32:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:27,710 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-10 08:32:27,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:32:27,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:27,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:32:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:32:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:27,712 INFO L87 Difference]: Start difference. First operand 8680 states and 12691 transitions. Second operand 7 states. [2019-09-10 08:32:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:28,328 INFO L93 Difference]: Finished difference Result 43858 states and 63663 transitions. [2019-09-10 08:32:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:32:28,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:32:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:28,368 INFO L225 Difference]: With dead ends: 43858 [2019-09-10 08:32:28,368 INFO L226 Difference]: Without dead ends: 43858 [2019-09-10 08:32:28,369 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-10 08:32:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43858 states. [2019-09-10 08:32:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43858 to 18452. [2019-09-10 08:32:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2019-09-10 08:32:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 26956 transitions. [2019-09-10 08:32:28,640 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 26956 transitions. Word has length 164 [2019-09-10 08:32:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:28,640 INFO L475 AbstractCegarLoop]: Abstraction has 18452 states and 26956 transitions. [2019-09-10 08:32:28,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:32:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 26956 transitions. [2019-09-10 08:32:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:28,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:28,643 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-10 08:32:28,644 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1984049311, now seen corresponding path program 1 times [2019-09-10 08:32:28,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:28,788 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-10 08:32:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:32:28,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:28,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:32:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:32:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:28,790 INFO L87 Difference]: Start difference. First operand 18452 states and 26956 transitions. Second operand 7 states. [2019-09-10 08:32:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:29,459 INFO L93 Difference]: Finished difference Result 82702 states and 119381 transitions. [2019-09-10 08:32:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:32:29,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:32:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:30,367 INFO L225 Difference]: With dead ends: 82702 [2019-09-10 08:32:30,367 INFO L226 Difference]: Without dead ends: 82702 [2019-09-10 08:32:30,368 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-10 08:32:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82702 states. [2019-09-10 08:32:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82702 to 39216. [2019-09-10 08:32:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39216 states. [2019-09-10 08:32:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39216 states to 39216 states and 57194 transitions. [2019-09-10 08:32:30,887 INFO L78 Accepts]: Start accepts. Automaton has 39216 states and 57194 transitions. Word has length 164 [2019-09-10 08:32:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:30,887 INFO L475 AbstractCegarLoop]: Abstraction has 39216 states and 57194 transitions. [2019-09-10 08:32:30,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:32:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39216 states and 57194 transitions. [2019-09-10 08:32:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:30,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:30,892 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-10 08:32:30,892 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1474728358, now seen corresponding path program 1 times [2019-09-10 08:32:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:30,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:31,020 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-10 08:32:31,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:32:31,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:32:31,022 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2019-09-10 08:32:31,024 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [165], [169], [172], [175], [177], [181], [184], [187], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [240], [244], [247], [250], [254], [257], [261], [264], [267], [269], [272], [275], [278], [280], [283], [286], [289], [291], [294], [297], [300], [302], [305], [308], [311], [313], [316], [319], [322], [324], [326], [329], [332], [335], [337], [339], [342], [349], [351], [354], [355], [357], [375], [378], [386], [388], [391], [399], [401], [404], [412], [414], [417], [425], [427], [430], [438], [448], [473], [498], [523], [548], [577], [580], [583], [585], [600], [603], [605], [609], [612], [770], [771], [775], [776], [777] [2019-09-10 08:32:31,082 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:32:31,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:32:31,273 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:32:31,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:32:31,782 INFO L272 AbstractInterpreter]: Visited 156 different actions 285 times. Merged at 41 different actions 123 times. Never widened. Performed 1176 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 8 fixpoints after 5 different actions. Largest state had 194 variables. [2019-09-10 08:32:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:31,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:32:31,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:32:31,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 08:32:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:31,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:32:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:31,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:32:32,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:32:32,168 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-10 08:32:32,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:32:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:32:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:32:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 08:32:32,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:32:32,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:32:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:32:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:32:32,294 INFO L87 Difference]: Start difference. First operand 39216 states and 57194 transitions. Second operand 11 states. [2019-09-10 08:32:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:33,837 INFO L93 Difference]: Finished difference Result 121790 states and 175953 transitions. [2019-09-10 08:32:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:32:33,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2019-09-10 08:32:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:34,209 INFO L225 Difference]: With dead ends: 121790 [2019-09-10 08:32:34,209 INFO L226 Difference]: Without dead ends: 121790 [2019-09-10 08:32:34,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:32:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121790 states. [2019-09-10 08:32:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121790 to 81719. [2019-09-10 08:32:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81719 states. [2019-09-10 08:32:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81719 states to 81719 states and 118645 transitions. [2019-09-10 08:32:35,739 INFO L78 Accepts]: Start accepts. Automaton has 81719 states and 118645 transitions. Word has length 164 [2019-09-10 08:32:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:35,739 INFO L475 AbstractCegarLoop]: Abstraction has 81719 states and 118645 transitions. [2019-09-10 08:32:35,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:32:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81719 states and 118645 transitions. [2019-09-10 08:32:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:35,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:35,748 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-10 08:32:35,748 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -465450009, now seen corresponding path program 1 times [2019-09-10 08:32:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:35,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:35,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:36,000 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-10 08:32:36,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:36,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:32:36,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:36,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:32:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:32:36,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:36,003 INFO L87 Difference]: Start difference. First operand 81719 states and 118645 transitions. Second operand 7 states. [2019-09-10 08:32:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:38,521 INFO L93 Difference]: Finished difference Result 266869 states and 382024 transitions. [2019-09-10 08:32:38,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:32:38,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:32:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:38,941 INFO L225 Difference]: With dead ends: 266869 [2019-09-10 08:32:38,941 INFO L226 Difference]: Without dead ends: 266869 [2019-09-10 08:32:38,942 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-10 08:32:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266869 states. [2019-09-10 08:32:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266869 to 173071. [2019-09-10 08:32:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173071 states. [2019-09-10 08:32:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173071 states to 173071 states and 250821 transitions. [2019-09-10 08:32:41,455 INFO L78 Accepts]: Start accepts. Automaton has 173071 states and 250821 transitions. Word has length 164 [2019-09-10 08:32:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:41,455 INFO L475 AbstractCegarLoop]: Abstraction has 173071 states and 250821 transitions. [2019-09-10 08:32:41,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:32:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 173071 states and 250821 transitions. [2019-09-10 08:32:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:41,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:41,464 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-10 08:32:41,465 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash -406758821, now seen corresponding path program 1 times [2019-09-10 08:32:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:41,608 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-10 08:32:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:32:41,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:41,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:32:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:32:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:41,609 INFO L87 Difference]: Start difference. First operand 173071 states and 250821 transitions. Second operand 7 states. [2019-09-10 08:32:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,154 INFO L93 Difference]: Finished difference Result 621445 states and 890792 transitions. [2019-09-10 08:32:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:32:46,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:32:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,180 INFO L225 Difference]: With dead ends: 621445 [2019-09-10 08:32:47,180 INFO L226 Difference]: Without dead ends: 621445 [2019-09-10 08:32:47,181 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-10 08:32:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621445 states. [2019-09-10 08:32:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621445 to 365535. [2019-09-10 08:32:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365535 states. [2019-09-10 08:32:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365535 states to 365535 states and 528837 transitions. [2019-09-10 08:32:54,107 INFO L78 Accepts]: Start accepts. Automaton has 365535 states and 528837 transitions. Word has length 164 [2019-09-10 08:32:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:54,107 INFO L475 AbstractCegarLoop]: Abstraction has 365535 states and 528837 transitions. [2019-09-10 08:32:54,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:32:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 365535 states and 528837 transitions. [2019-09-10 08:32:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:32:54,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:54,116 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-10 08:32:54,116 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1387854129, now seen corresponding path program 1 times [2019-09-10 08:32:54,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:54,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:54,240 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-10 08:32:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:32:54,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:54,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:32:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:32:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:54,241 INFO L87 Difference]: Start difference. First operand 365535 states and 528837 transitions. Second operand 7 states. [2019-09-10 08:33:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:01,896 INFO L93 Difference]: Finished difference Result 921389 states and 1325356 transitions. [2019-09-10 08:33:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:33:01,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:33:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:04,571 INFO L225 Difference]: With dead ends: 921389 [2019-09-10 08:33:04,571 INFO L226 Difference]: Without dead ends: 921389 [2019-09-10 08:33:04,572 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-10 08:33:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921389 states. [2019-09-10 08:33:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921389 to 527507. [2019-09-10 08:33:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527507 states. [2019-09-10 08:33:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527507 states to 527507 states and 763741 transitions. [2019-09-10 08:33:22,913 INFO L78 Accepts]: Start accepts. Automaton has 527507 states and 763741 transitions. Word has length 164 [2019-09-10 08:33:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:22,913 INFO L475 AbstractCegarLoop]: Abstraction has 527507 states and 763741 transitions. [2019-09-10 08:33:22,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:33:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 527507 states and 763741 transitions. [2019-09-10 08:33:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:33:22,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:22,920 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-10 08:33:22,920 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 253554957, now seen corresponding path program 1 times [2019-09-10 08:33:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:22,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:22,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:23,007 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-10 08:33:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:23,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:23,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:23,009 INFO L87 Difference]: Start difference. First operand 527507 states and 763741 transitions. Second operand 3 states. [2019-09-10 08:33:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:30,797 INFO L93 Difference]: Finished difference Result 512724 states and 738332 transitions. [2019-09-10 08:33:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:30,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:33:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:31,478 INFO L225 Difference]: With dead ends: 512724 [2019-09-10 08:33:31,478 INFO L226 Difference]: Without dead ends: 512724 [2019-09-10 08:33:31,479 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-10 08:33:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512724 states. [2019-09-10 08:33:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512724 to 512722. [2019-09-10 08:33:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512722 states. [2019-09-10 08:33:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512722 states to 512722 states and 738331 transitions. [2019-09-10 08:33:41,889 INFO L78 Accepts]: Start accepts. Automaton has 512722 states and 738331 transitions. Word has length 164 [2019-09-10 08:33:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:41,890 INFO L475 AbstractCegarLoop]: Abstraction has 512722 states and 738331 transitions. [2019-09-10 08:33:41,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 512722 states and 738331 transitions. [2019-09-10 08:33:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:33:41,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:41,949 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:33:41,949 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1496772298, now seen corresponding path program 1 times [2019-09-10 08:33:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:41,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:33:42,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:42,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:42,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:42,042 INFO L87 Difference]: Start difference. First operand 512722 states and 738331 transitions. Second operand 3 states. [2019-09-10 08:33:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:44,642 INFO L93 Difference]: Finished difference Result 512724 states and 733084 transitions. [2019-09-10 08:33:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:44,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 08:33:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:45,333 INFO L225 Difference]: With dead ends: 512724 [2019-09-10 08:33:45,333 INFO L226 Difference]: Without dead ends: 512724 [2019-09-10 08:33:45,333 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-10 08:33:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512724 states. [2019-09-10 08:33:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512724 to 377362. [2019-09-10 08:33:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377362 states. [2019-09-10 08:33:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377362 states to 377362 states and 540667 transitions. [2019-09-10 08:33:59,036 INFO L78 Accepts]: Start accepts. Automaton has 377362 states and 540667 transitions. Word has length 199 [2019-09-10 08:33:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:59,036 INFO L475 AbstractCegarLoop]: Abstraction has 377362 states and 540667 transitions. [2019-09-10 08:33:59,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 377362 states and 540667 transitions. [2019-09-10 08:33:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 08:33:59,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:59,061 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:33:59,061 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash 131725975, now seen corresponding path program 1 times [2019-09-10 08:33:59,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:33:59,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:59,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:59,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:59,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:59,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:59,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:59,152 INFO L87 Difference]: Start difference. First operand 377362 states and 540667 transitions. Second operand 3 states. [2019-09-10 08:34:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:06,382 INFO L93 Difference]: Finished difference Result 482548 states and 685852 transitions. [2019-09-10 08:34:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:06,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 08:34:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:06,921 INFO L225 Difference]: With dead ends: 482548 [2019-09-10 08:34:06,921 INFO L226 Difference]: Without dead ends: 482548 [2019-09-10 08:34:06,921 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-10 08:34:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482548 states. [2019-09-10 08:34:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482548 to 358994. [2019-09-10 08:34:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358994 states. [2019-09-10 08:34:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358994 states to 358994 states and 510491 transitions. [2019-09-10 08:34:11,651 INFO L78 Accepts]: Start accepts. Automaton has 358994 states and 510491 transitions. Word has length 200 [2019-09-10 08:34:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:11,651 INFO L475 AbstractCegarLoop]: Abstraction has 358994 states and 510491 transitions. [2019-09-10 08:34:11,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 358994 states and 510491 transitions. [2019-09-10 08:34:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 08:34:11,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:11,664 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:34:11,664 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 27333483, now seen corresponding path program 1 times [2019-09-10 08:34:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:11,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:11,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:11,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:11,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:11,760 INFO L87 Difference]: Start difference. First operand 358994 states and 510491 transitions. Second operand 3 states. [2019-09-10 08:34:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:13,580 INFO L93 Difference]: Finished difference Result 335380 states and 471132 transitions. [2019-09-10 08:34:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:13,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 08:34:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:13,965 INFO L225 Difference]: With dead ends: 335380 [2019-09-10 08:34:13,965 INFO L226 Difference]: Without dead ends: 335380 [2019-09-10 08:34:13,965 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-10 08:34:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335380 states. [2019-09-10 08:34:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335380 to 254522. [2019-09-10 08:34:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254522 states. [2019-09-10 08:34:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254522 states to 254522 states and 357323 transitions. [2019-09-10 08:34:23,724 INFO L78 Accepts]: Start accepts. Automaton has 254522 states and 357323 transitions. Word has length 201 [2019-09-10 08:34:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:23,725 INFO L475 AbstractCegarLoop]: Abstraction has 254522 states and 357323 transitions. [2019-09-10 08:34:23,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 254522 states and 357323 transitions. [2019-09-10 08:34:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 08:34:23,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:23,733 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:34:23,733 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1598099717, now seen corresponding path program 1 times [2019-09-10 08:34:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:23,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:23,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:23,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:23,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:23,820 INFO L87 Difference]: Start difference. First operand 254522 states and 357323 transitions. Second operand 3 states. [2019-09-10 08:34:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:25,224 INFO L93 Difference]: Finished difference Result 312748 states and 434724 transitions. [2019-09-10 08:34:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:25,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 08:34:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:25,616 INFO L225 Difference]: With dead ends: 312748 [2019-09-10 08:34:25,616 INFO L226 Difference]: Without dead ends: 312748 [2019-09-10 08:34:25,616 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-10 08:34:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312748 states. [2019-09-10 08:34:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312748 to 232382. [2019-09-10 08:34:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232382 states. [2019-09-10 08:34:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232382 states to 232382 states and 323375 transitions. [2019-09-10 08:34:32,630 INFO L78 Accepts]: Start accepts. Automaton has 232382 states and 323375 transitions. Word has length 202 [2019-09-10 08:34:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:32,631 INFO L475 AbstractCegarLoop]: Abstraction has 232382 states and 323375 transitions. [2019-09-10 08:34:32,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 232382 states and 323375 transitions. [2019-09-10 08:34:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 08:34:32,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:32,637 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:34:32,637 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1403682155, now seen corresponding path program 1 times [2019-09-10 08:34:32,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:34:32,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:32,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:32,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:32,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:32,732 INFO L87 Difference]: Start difference. First operand 232382 states and 323375 transitions. Second operand 3 states. [2019-09-10 08:34:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:34,658 INFO L93 Difference]: Finished difference Result 289132 states and 398644 transitions. [2019-09-10 08:34:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:34,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 08:34:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:35,163 INFO L225 Difference]: With dead ends: 289132 [2019-09-10 08:34:35,164 INFO L226 Difference]: Without dead ends: 289132 [2019-09-10 08:34:35,164 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-10 08:34:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289132 states. [2019-09-10 08:34:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289132 to 279290. [2019-09-10 08:34:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279290 states. [2019-09-10 08:34:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279290 states to 279290 states and 386835 transitions. [2019-09-10 08:34:42,165 INFO L78 Accepts]: Start accepts. Automaton has 279290 states and 386835 transitions. Word has length 203 [2019-09-10 08:34:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:42,166 INFO L475 AbstractCegarLoop]: Abstraction has 279290 states and 386835 transitions. [2019-09-10 08:34:42,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 279290 states and 386835 transitions. [2019-09-10 08:34:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 08:34:42,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:42,171 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:34:42,171 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1733182833, now seen corresponding path program 1 times [2019-09-10 08:34:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:42,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:34:42,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:42,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:42,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:42,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:42,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:42,258 INFO L87 Difference]: Start difference. First operand 279290 states and 386835 transitions. Second operand 3 states. [2019-09-10 08:34:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:43,925 INFO L93 Difference]: Finished difference Result 344881 states and 472151 transitions. [2019-09-10 08:34:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:43,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 08:34:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:44,341 INFO L225 Difference]: With dead ends: 344881 [2019-09-10 08:34:44,341 INFO L226 Difference]: Without dead ends: 344881 [2019-09-10 08:34:44,341 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-10 08:34:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344881 states. [2019-09-10 08:34:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344881 to 331945. [2019-09-10 08:34:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331945 states. [2019-09-10 08:34:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331945 states to 331945 states and 456623 transitions. [2019-09-10 08:34:53,390 INFO L78 Accepts]: Start accepts. Automaton has 331945 states and 456623 transitions. Word has length 204 [2019-09-10 08:34:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:53,391 INFO L475 AbstractCegarLoop]: Abstraction has 331945 states and 456623 transitions. [2019-09-10 08:34:53,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 331945 states and 456623 transitions. [2019-09-10 08:34:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 08:34:53,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:53,398 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:34:53,398 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -906336478, now seen corresponding path program 1 times [2019-09-10 08:34:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:53,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:53,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:53,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:53,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:53,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:53,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:53,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:53,491 INFO L87 Difference]: Start difference. First operand 331945 states and 456623 transitions. Second operand 3 states. [2019-09-10 08:34:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:53,711 INFO L93 Difference]: Finished difference Result 121024 states and 164096 transitions. [2019-09-10 08:34:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:53,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 08:34:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:53,824 INFO L225 Difference]: With dead ends: 121024 [2019-09-10 08:34:53,824 INFO L226 Difference]: Without dead ends: 121024 [2019-09-10 08:34:53,824 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-10 08:34:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121024 states. [2019-09-10 08:34:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121024 to 119402. [2019-09-10 08:34:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119402 states. [2019-09-10 08:34:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119402 states to 119402 states and 161999 transitions. [2019-09-10 08:34:58,769 INFO L78 Accepts]: Start accepts. Automaton has 119402 states and 161999 transitions. Word has length 205 [2019-09-10 08:34:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:58,769 INFO L475 AbstractCegarLoop]: Abstraction has 119402 states and 161999 transitions. [2019-09-10 08:34:58,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119402 states and 161999 transitions. [2019-09-10 08:34:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 08:34:58,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:58,774 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:58,774 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1566410064, now seen corresponding path program 1 times [2019-09-10 08:34:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:59,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:59,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:34:59,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2019-09-10 08:34:59,122 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [165], [169], [172], [175], [177], [181], [184], [187], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [240], [244], [247], [250], [254], [257], [261], [264], [267], [269], [272], [275], [278], [280], [283], [286], [289], [291], [294], [297], [300], [302], [305], [308], [311], [313], [316], [319], [322], [324], [326], [329], [332], [335], [337], [339], [342], [345], [349], [351], [354], [355], [357], [360], [365], [373], [375], [378], [386], [388], [391], [399], [401], [404], [412], [414], [417], [425], [427], [430], [438], [448], [450], [453], [456], [458], [473], [475], [478], [481], [483], [498], [500], [503], [506], [508], [523], [525], [528], [531], [533], [548], [550], [553], [556], [558], [573], [575], [577], [580], [583], [585], [593], [598], [600], [603], [616], [618], [621], [624], [626], [770], [771], [775], [776], [777] [2019-09-10 08:34:59,129 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:34:59,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:34:59,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:35:00,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:35:00,496 INFO L272 AbstractInterpreter]: Visited 186 different actions 1518 times. Merged at 70 different actions 1140 times. Widened at 30 different actions 221 times. Performed 5175 root evaluator evaluations with a maximum evaluation depth of 9. Performed 5175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 202 fixpoints after 27 different actions. Largest state had 200 variables. [2019-09-10 08:35:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:00,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:35:00,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:00,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:35:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:00,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:35:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:00,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 08:35:00,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:35:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:01,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:35:02,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:02,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:02,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:35:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 08:35:07,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:35:07,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:35:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:35:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:35:07,702 INFO L87 Difference]: Start difference. First operand 119402 states and 161999 transitions. Second operand 20 states. [2019-09-10 08:35:10,007 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:35:11,128 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:35:11,352 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:35:11,719 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:35:12,342 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:35:12,574 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:35:12,848 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:35:13,042 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:35:13,199 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:35:13,372 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:35:13,871 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:35:14,150 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:35:17,087 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:35:17,270 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:35:17,433 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:35:17,600 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:35:17,749 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:35:18,131 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:18,370 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:35:18,572 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:18,781 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:35:18,958 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:35:19,221 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:19,560 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:35:19,766 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:35:20,039 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:20,474 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:20,997 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:35:21,323 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:35:21,680 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:35:21,975 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:35:23,289 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:23,563 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:23,743 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:35:24,105 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:24,321 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:24,944 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 08:35:25,316 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:35:25,601 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 08:35:27,996 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:35:28,240 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:35:28,418 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:35:28,633 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:35:28,787 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:35:28,990 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 08:35:29,187 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:35:29,404 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 08:35:31,531 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:35:33,429 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:35:33,852 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:35:34,112 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 08:35:34,319 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:34,619 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 08:35:34,843 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:35,082 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:35:35,294 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:35:35,463 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:35:35,674 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:35:35,896 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:35:36,261 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:35:36,441 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:35:37,187 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:35:37,428 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:35:38,148 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:38,491 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:38,956 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:35:39,129 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:39,350 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:35:39,532 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:39,860 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:40,147 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:35:40,342 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:40,547 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:40,702 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:35:40,872 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:35:41,065 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:35:41,243 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:35:41,484 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:41,710 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:41,982 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 08:35:42,425 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:35:42,700 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:35:42,954 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 08:35:43,390 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:35:43,636 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:44,288 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:35:44,486 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:35:44,814 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:35:45,174 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:35:45,363 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 08:35:45,590 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:35:45,811 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 08:35:46,125 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:35:46,569 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:46,859 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:35:47,222 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:35:47,476 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:35:47,660 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:35:47,861 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:35:48,072 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:35:48,956 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:49,214 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:50,219 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:35:50,408 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:35:58,743 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:35:59,045 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:35:59,290 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:35:59,510 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:35:59,681 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:35:59,887 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:36:00,231 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:36:00,434 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:36:00,633 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:36:02,847 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:36:03,040 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:36:04,610 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:36:04,834 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:36:05,067 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:05,285 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:36:05,948 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:36:06,226 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:06,552 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:36:06,718 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:36:06,919 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:36:07,086 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:36:07,397 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:36:07,602 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:36:08,005 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:36:08,523 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:36:09,228 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:36:09,703 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:36:10,076 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:36:10,259 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:36:10,449 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 08:36:10,666 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:36:10,923 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:36:11,140 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:36:11,502 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:36:14,226 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:36:14,495 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:36:14,724 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:36:14,941 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 08:36:15,119 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:36:15,305 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:36:15,640 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 08:36:15,895 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:16,070 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:36:16,260 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:16,510 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:36:17,626 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:36:17,941 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:36:18,279 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:18,564 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 08:36:18,864 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:36:19,438 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:36:19,675 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:36:19,897 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:36:20,123 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:36:22,368 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:36:22,609 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:36:22,805 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:36:23,077 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:36:23,312 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:23,545 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:36:23,744 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:36:25,886 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:36:26,107 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:36:27,050 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:36:27,285 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:36:28,010 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:36:28,190 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:36:28,375 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:36:28,647 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:36:28,935 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 08:36:29,156 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:36:29,374 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:36:29,582 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:36:30,648 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:36:31,063 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:36:31,629 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 08:36:31,841 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:36:32,026 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:36:32,277 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:36:32,436 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:36:32,656 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:36:32,945 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:33,116 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:36:33,428 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:36:33,718 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:36:39,177 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:36:39,490 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:39,741 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:36:40,086 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:36:40,285 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:36:40,495 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:36:40,707 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:36:41,238 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:36:42,593 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:36:42,877 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 08:36:43,152 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:36:43,477 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:43,801 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 08:36:46,142 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:36:48,450 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:36:48,870 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 08:36:49,218 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 08:36:49,622 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:36:56,386 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:36:56,703 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:36:56,869 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:36:57,187 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:36:57,397 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:36:57,806 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:36:58,061 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:36:58,430 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:36:58,610 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:36:58,818 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:36:59,018 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:36:59,351 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:36:59,793 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:37:01,031 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:37:01,364 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:37:01,698 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:37:01,941 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 08:37:02,139 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:37:02,374 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:37:02,892 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:37:03,110 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:37:03,533 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:03,825 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:37:04,046 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:37:04,436 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 08:37:04,959 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:37:05,219 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:37:05,793 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 08:37:06,131 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:37:06,393 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:37:06,641 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:37:07,005 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 08:37:07,356 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 08:37:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:10,282 INFO L93 Difference]: Finished difference Result 1945624 states and 2605408 transitions. [2019-09-10 08:37:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 302 states. [2019-09-10 08:37:10,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 205 [2019-09-10 08:37:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:14,987 INFO L225 Difference]: With dead ends: 1945624 [2019-09-10 08:37:14,987 INFO L226 Difference]: Without dead ends: 1945624 [2019-09-10 08:37:14,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 311 SyntacticMatches, 83 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45546 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=13776, Invalid=94136, Unknown=0, NotChecked=0, Total=107912 [2019-09-10 08:37:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945624 states. [2019-09-10 08:37:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945624 to 662719. [2019-09-10 08:37:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662719 states. [2019-09-10 08:37:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662719 states to 662719 states and 895198 transitions. [2019-09-10 08:37:55,332 INFO L78 Accepts]: Start accepts. Automaton has 662719 states and 895198 transitions. Word has length 205 [2019-09-10 08:37:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:55,332 INFO L475 AbstractCegarLoop]: Abstraction has 662719 states and 895198 transitions. [2019-09-10 08:37:55,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:37:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 662719 states and 895198 transitions. [2019-09-10 08:37:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 08:37:55,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:55,348 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:37:55,349 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1111729773, now seen corresponding path program 1 times [2019-09-10 08:37:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:55,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:37:55,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:37:55,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2019-09-10 08:37:55,693 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [165], [169], [172], [175], [177], [181], [184], [187], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [240], [244], [247], [250], [254], [257], [261], [264], [267], [269], [272], [275], [278], [280], [283], [286], [289], [291], [294], [297], [300], [302], [305], [308], [311], [313], [316], [319], [322], [324], [326], [329], [332], [335], [337], [339], [342], [349], [351], [354], [355], [357], [360], [365], [373], [375], [378], [381], [386], [388], [391], [399], [401], [404], [412], [414], [417], [420], [425], [427], [430], [438], [448], [450], [453], [456], [458], [466], [469], [475], [478], [481], [483], [498], [500], [503], [506], [508], [523], [525], [528], [531], [533], [541], [544], [550], [553], [556], [558], [573], [575], [577], [580], [583], [585], [600], [603], [607], [616], [618], [621], [624], [626], [770], [771], [775], [776], [777] [2019-09-10 08:37:55,697 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:37:55,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:37:55,729 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:37:56,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:37:56,970 INFO L272 AbstractInterpreter]: Visited 188 different actions 1498 times. Merged at 73 different actions 1124 times. Widened at 29 different actions 236 times. Performed 5044 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5044 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 158 fixpoints after 29 different actions. Largest state had 200 variables. [2019-09-10 08:37:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:56,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:37:56,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:37:56,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:37:56,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:56,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:37:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:57,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:37:57,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:37:57,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:57,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:57,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:37:58,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:38:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:38:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:01,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:38:01,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:38:01,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:38:01,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:38:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:38:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:38:01,358 INFO L87 Difference]: Start difference. First operand 662719 states and 895198 transitions. Second operand 21 states. [2019-09-10 08:38:01,594 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:38:02,217 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:38:03,003 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 08:38:03,409 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:38:03,841 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:38:04,269 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:38:04,768 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:38:05,183 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:38:06,023 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:38:06,378 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:38:06,996 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:38:07,284 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:38:08,168 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:38:08,656 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:38:08,930 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:38:09,341 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:38:10,353 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:10,707 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:38:11,131 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:38:11,723 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:38:12,069 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:38:12,473 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:38:13,506 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:38:13,879 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:38:14,304 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:38:14,801 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:38:15,174 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:38:15,922 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:38:16,357 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:38:16,829 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:38:17,262 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:38:17,984 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:38:18,465 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:38:18,789 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:38:19,196 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:38:19,661 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:38:20,096 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:38:20,705 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:38:21,082 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:38:21,413 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:38:22,088 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:38:24,677 WARN L188 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:38:25,124 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:38:25,652 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:38:26,067 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:38:26,928 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:38:27,393 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:38:27,728 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:38:28,255 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:38:28,837 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:38:29,401 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:38:29,791 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:38:30,279 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:38:30,637 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:38:30,947 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:38:31,414 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:38:31,848 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:38:32,189 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:38:34,059 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:38:34,524 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:35,081 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:35,563 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:36,152 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:36,984 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:37,374 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:38:37,915 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:38,552 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:39,062 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:38:39,587 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:38:40,033 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:38:40,580 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:38:41,215 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:41,854 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:42,742 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:43,134 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:45,504 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:45,977 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:38:46,675 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:47,206 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:47,610 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:38:48,175 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:38:48,934 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:38:49,538 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:38:50,052 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:38:51,008 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:38:51,549 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:38:52,038 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:38:52,836 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:38:53,562 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:54,443 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:38:54,895 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:55,406 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:38:55,902 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:38:56,766 WARN L188 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:38:57,255 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:38:57,999 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:58,517 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:38:58,934 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:38:59,370 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:38:59,957 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:39:00,410 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:39:01,090 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:03,461 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:03,920 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:05,205 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:05,728 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:39:06,157 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:39:08,705 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:39:09,160 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:39:09,492 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:39:10,021 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:39:10,391 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:39:10,827 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:39:11,230 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:11,728 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:39:12,403 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:39:12,849 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:13,371 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:39:13,963 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:14,642 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:39:15,211 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:39:15,849 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:39:16,397 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:39:17,231 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:39:17,689 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:39:18,128 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:39:18,656 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:19,436 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:20,002 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:39:20,586 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:39:20,907 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:39:23,493 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:39:23,933 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:39:24,417 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:24,976 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:39:25,594 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:26,247 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:39:26,825 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:39:27,580 WARN L188 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:39:28,140 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:39:28,565 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:39:29,114 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:39:29,522 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:39:30,425 WARN L188 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:30,854 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:31,373 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:39:31,720 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:32,284 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:39:32,874 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:33,546 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:34,116 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:39:34,521 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:39:35,052 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:39:35,507 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:39:35,897 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:39:36,463 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:37,114 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:39:37,534 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:39:38,595 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:38,974 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:39:43,617 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:39:44,047 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:39:44,713 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:39:45,134 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 08:39:45,900 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:39:46,549 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:39:46,976 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:39:47,858 WARN L188 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:48,384 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:49,112 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:39:49,551 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:39:50,047 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:39:50,553 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:39:50,916 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:39:51,456 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:39:52,068 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:39:52,706 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:39:53,523 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:39:54,103 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:39:54,849 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:39:55,489 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:39:55,946 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:39:56,261 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:39:56,695 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:39:57,231 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:39:57,852 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:39:58,405 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:39:58,969 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:39:59,514 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:40:00,060 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:40:00,577 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:40:01,019 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:40:01,448 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:40:01,892 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:40:02,389 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:40:03,034 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:40:03,448 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:40:05,075 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:40:08,586 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:40:09,097 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:09,760 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:40:10,138 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:10,639 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:40:10,994 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:40:11,823 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:40:12,273 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:40:13,317 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:40:13,896 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:40:14,528 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:15,114 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:40:15,737 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:40:16,076 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:40:16,659 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:40:17,164 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:40:17,620 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 08:40:17,943 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:40:18,473 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:40:18,915 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:40:19,829 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:40:20,857 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:40:21,380 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:40:22,112 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:40:22,684 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 08:40:23,110 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:40:23,850 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 08:40:24,251 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:40:26,028 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:40:26,380 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:40:26,826 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:40:27,210 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:40:27,664 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:28,083 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:40:28,656 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:40:29,100 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:29,634 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:40:30,030 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:40:30,608 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 08:40:31,161 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:40:31,669 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:40:32,104 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 08:40:32,629 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:40:33,006 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:40:33,428 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 08:40:33,907 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:34,295 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:34,846 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:40:35,454 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:40:36,681 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:40:37,302 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:40:37,704 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:40:38,221 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:40:38,690 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 08:40:39,397 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:40:40,227 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-10 08:40:40,718 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:40:41,374 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-09-10 08:40:41,825 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:40:42,452 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:40:42,911 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:40:43,866 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:40:44,318 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:44,781 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:40:45,894 WARN L188 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:40:46,289 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:40:46,675 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:40:47,989 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:40:48,769 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:40:49,286 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-10 08:40:49,926 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:40:57,504 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:40:57,977 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:40:58,465 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:40:58,911 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:41:01,127 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:41:01,639 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:41:02,079 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:41:02,571 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:41:02,926 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:41:03,461 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:41:03,843 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:41:04,344 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:41:04,924 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:41:05,436 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:41:06,004 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:41:06,423 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:41:07,214 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:41:08,030 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:41:08,450 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:41:08,923 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:41:11,632 WARN L188 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:41:12,524 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:41:13,268 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:41:14,176 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:41:16,967 WARN L188 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:41:17,618 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:41:18,308 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:41:19,077 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:41:19,912 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 08:41:20,488 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:41:21,237 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:41:21,679 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:41:24,379 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:41:25,085 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:41:25,843 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:41:26,318 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:41:27,142 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 08:41:27,940 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-10 08:41:28,840 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:41:29,494 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94