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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:33:37,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:33:37,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:33:37,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:33:37,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:33:37,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:33:37,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:33:37,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:33:37,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:33:37,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:33:37,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:33:37,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:33:37,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:33:37,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:33:37,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:33:37,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:33:37,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:33:37,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:33:37,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:33:37,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:33:37,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:33:37,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:33:37,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:33:37,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:33:37,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:33:37,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:33:37,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:33:37,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:33:37,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:33:37,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:33:37,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:33:37,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:33:37,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:33:37,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:33:37,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:33:37,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:33:37,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:33:37,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:33:37,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:33:37,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:33:37,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:33:37,333 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:33:37,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:33:37,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:33:37,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:33:37,364 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:33:37,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:33:37,366 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:33:37,366 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:33:37,366 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:33:37,366 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:33:37,367 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:33:37,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:33:37,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:33:37,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:33:37,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:33:37,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:33:37,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:33:37,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:33:37,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:33:37,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:33:37,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:33:37,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:33:37,371 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:33:37,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:33:37,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:33:37,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:33:37,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:33:37,372 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:33:37,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:33:37,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:33:37,373 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:33:37,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:33:37,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:33:37,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:33:37,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:33:37,449 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:33:37,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:33:37,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703beeea4/24ef17f01d7a4f39bee32df4ec752816/FLAG18b925032 [2019-09-10 08:33:38,044 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:33:38,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:33:38,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703beeea4/24ef17f01d7a4f39bee32df4ec752816/FLAG18b925032 [2019-09-10 08:33:38,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703beeea4/24ef17f01d7a4f39bee32df4ec752816 [2019-09-10 08:33:38,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:33:38,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:33:38,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:33:38,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:33:38,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:33:38,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:33:38" (1/1) ... [2019-09-10 08:33:38,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:38, skipping insertion in model container [2019-09-10 08:33:38,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:33:38" (1/1) ... [2019-09-10 08:33:38,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:33:38,453 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:33:38,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:33:38,945 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:33:39,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:33:39,110 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:33:39,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39 WrapperNode [2019-09-10 08:33:39,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:33:39,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:33:39,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:33:39,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:33:39,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (1/1) ... [2019-09-10 08:33:39,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:33:39,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:33:39,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:33:39,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:33:39,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (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:33:39,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:33:39,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:33:39,269 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:33:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:33:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:33:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:33:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:33:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:33:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:33:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:33:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:33:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:33:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:33:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:33:40,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:33:40,486 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:33:40,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:33:40 BoogieIcfgContainer [2019-09-10 08:33:40,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:33:40,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:33:40,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:33:40,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:33:40,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:33:38" (1/3) ... [2019-09-10 08:33:40,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766337d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:33:40, skipping insertion in model container [2019-09-10 08:33:40,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:33:39" (2/3) ... [2019-09-10 08:33:40,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766337d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:33:40, skipping insertion in model container [2019-09-10 08:33:40,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:33:40" (3/3) ... [2019-09-10 08:33:40,503 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:33:40,514 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:33:40,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:33:40,558 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:33:40,596 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:33:40,596 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:33:40,596 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:33:40,597 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:33:40,597 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:33:40,597 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:33:40,597 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:33:40,598 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:33:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-10 08:33:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:33:40,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:40,647 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:33:40,650 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1507923580, now seen corresponding path program 1 times [2019-09-10 08:33:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:41,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:41,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:41,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:41,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:41,311 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-10 08:33:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:41,476 INFO L93 Difference]: Finished difference Result 358 states and 603 transitions. [2019-09-10 08:33:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:33:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:41,496 INFO L225 Difference]: With dead ends: 358 [2019-09-10 08:33:41,496 INFO L226 Difference]: Without dead ends: 350 [2019-09-10 08:33:41,498 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:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-10 08:33:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-09-10 08:33:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 08:33:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 499 transitions. [2019-09-10 08:33:41,585 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 499 transitions. Word has length 128 [2019-09-10 08:33:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:41,586 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 499 transitions. [2019-09-10 08:33:41,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2019-09-10 08:33:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:41,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:41,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:41,593 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2036693343, now seen corresponding path program 1 times [2019-09-10 08:33:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:41,949 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:33:41,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:41,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:41,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:41,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:41,953 INFO L87 Difference]: Start difference. First operand 348 states and 499 transitions. Second operand 5 states. [2019-09-10 08:33:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:42,388 INFO L93 Difference]: Finished difference Result 581 states and 866 transitions. [2019-09-10 08:33:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:42,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-10 08:33:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:42,399 INFO L225 Difference]: With dead ends: 581 [2019-09-10 08:33:42,399 INFO L226 Difference]: Without dead ends: 581 [2019-09-10 08:33:42,400 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:33:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-10 08:33:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-09-10 08:33:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2019-09-10 08:33:42,433 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 130 [2019-09-10 08:33:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:42,434 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2019-09-10 08:33:42,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2019-09-10 08:33:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:42,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:42,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:42,439 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -603628053, now seen corresponding path program 1 times [2019-09-10 08:33:42,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:42,709 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:33:42,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:42,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:42,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:42,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:42,714 INFO L87 Difference]: Start difference. First operand 579 states and 865 transitions. Second operand 5 states. [2019-09-10 08:33:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:42,965 INFO L93 Difference]: Finished difference Result 579 states and 860 transitions. [2019-09-10 08:33:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:42,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-10 08:33:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:42,970 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:42,970 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:42,971 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:33:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 860 transitions. [2019-09-10 08:33:42,991 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 860 transitions. Word has length 131 [2019-09-10 08:33:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:42,992 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 860 transitions. [2019-09-10 08:33:42,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 860 transitions. [2019-09-10 08:33:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:33:42,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:42,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:42,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash -894619088, now seen corresponding path program 1 times [2019-09-10 08:33:42,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,155 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:33:43,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:43,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:43,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:43,157 INFO L87 Difference]: Start difference. First operand 579 states and 860 transitions. Second operand 5 states. [2019-09-10 08:33:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,382 INFO L93 Difference]: Finished difference Result 579 states and 855 transitions. [2019-09-10 08:33:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:43,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 08:33:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:43,387 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:43,387 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:43,387 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:33:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 855 transitions. [2019-09-10 08:33:43,405 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 855 transitions. Word has length 132 [2019-09-10 08:33:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:43,405 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 855 transitions. [2019-09-10 08:33:43,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 855 transitions. [2019-09-10 08:33:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:33:43,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:43,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:43,408 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash 95427819, now seen corresponding path program 1 times [2019-09-10 08:33:43,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,577 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:33:43,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:43,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:43,580 INFO L87 Difference]: Start difference. First operand 579 states and 855 transitions. Second operand 5 states. [2019-09-10 08:33:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,803 INFO L93 Difference]: Finished difference Result 579 states and 850 transitions. [2019-09-10 08:33:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:43,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 08:33:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:43,807 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:43,807 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:43,809 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:33:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 850 transitions. [2019-09-10 08:33:43,827 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 850 transitions. Word has length 133 [2019-09-10 08:33:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:43,828 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 850 transitions. [2019-09-10 08:33:43,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 850 transitions. [2019-09-10 08:33:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:33:43,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:43,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:43,831 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 952733183, now seen corresponding path program 1 times [2019-09-10 08:33:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:43,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:43,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:43,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:43,991 INFO L87 Difference]: Start difference. First operand 579 states and 850 transitions. Second operand 5 states. [2019-09-10 08:33:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:44,213 INFO L93 Difference]: Finished difference Result 579 states and 845 transitions. [2019-09-10 08:33:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:44,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-10 08:33:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:44,218 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:44,218 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:44,219 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:33:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 845 transitions. [2019-09-10 08:33:44,237 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 845 transitions. Word has length 134 [2019-09-10 08:33:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:44,238 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 845 transitions. [2019-09-10 08:33:44,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 845 transitions. [2019-09-10 08:33:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:33:44,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:44,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:44,241 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1075246054, now seen corresponding path program 1 times [2019-09-10 08:33:44,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:44,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:44,410 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:33:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:44,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:44,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:44,413 INFO L87 Difference]: Start difference. First operand 579 states and 845 transitions. Second operand 5 states. [2019-09-10 08:33:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:44,617 INFO L93 Difference]: Finished difference Result 579 states and 840 transitions. [2019-09-10 08:33:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:44,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-10 08:33:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:44,620 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:44,621 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:44,621 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:33:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 840 transitions. [2019-09-10 08:33:44,637 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 840 transitions. Word has length 135 [2019-09-10 08:33:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:44,638 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 840 transitions. [2019-09-10 08:33:44,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 840 transitions. [2019-09-10 08:33:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:33:44,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:44,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash -402862384, now seen corresponding path program 1 times [2019-09-10 08:33:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:44,817 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:33:44,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:44,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:44,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:44,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:44,819 INFO L87 Difference]: Start difference. First operand 579 states and 840 transitions. Second operand 5 states. [2019-09-10 08:33:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:45,038 INFO L93 Difference]: Finished difference Result 579 states and 835 transitions. [2019-09-10 08:33:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:45,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 08:33:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:45,042 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:45,042 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:45,043 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:33:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 835 transitions. [2019-09-10 08:33:45,060 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 835 transitions. Word has length 136 [2019-09-10 08:33:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:45,060 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 835 transitions. [2019-09-10 08:33:45,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 835 transitions. [2019-09-10 08:33:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:33:45,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:45,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:45,063 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:45,063 INFO L82 PathProgramCache]: Analyzing trace with hash 133489020, now seen corresponding path program 1 times [2019-09-10 08:33:45,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:45,240 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:33:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:45,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:45,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:45,242 INFO L87 Difference]: Start difference. First operand 579 states and 835 transitions. Second operand 5 states. [2019-09-10 08:33:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:45,442 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2019-09-10 08:33:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:45,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 08:33:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:45,447 INFO L225 Difference]: With dead ends: 579 [2019-09-10 08:33:45,447 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 08:33:45,448 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:33:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 08:33:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-10 08:33:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 08:33:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 830 transitions. [2019-09-10 08:33:45,465 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 830 transitions. Word has length 137 [2019-09-10 08:33:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:45,465 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 830 transitions. [2019-09-10 08:33:45,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 830 transitions. [2019-09-10 08:33:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:45,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:45,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:45,468 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1696593501, now seen corresponding path program 1 times [2019-09-10 08:33:45,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:45,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:45,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:45,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:45,816 INFO L87 Difference]: Start difference. First operand 579 states and 830 transitions. Second operand 10 states. [2019-09-10 08:33:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:46,341 INFO L93 Difference]: Finished difference Result 3321 states and 4975 transitions. [2019-09-10 08:33:46,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:46,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2019-09-10 08:33:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:46,360 INFO L225 Difference]: With dead ends: 3321 [2019-09-10 08:33:46,361 INFO L226 Difference]: Without dead ends: 3321 [2019-09-10 08:33:46,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:33:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2019-09-10 08:33:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 752. [2019-09-10 08:33:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-10 08:33:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1093 transitions. [2019-09-10 08:33:46,438 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1093 transitions. Word has length 138 [2019-09-10 08:33:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:46,439 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1093 transitions. [2019-09-10 08:33:46,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1093 transitions. [2019-09-10 08:33:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:46,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:46,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:46,442 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash 770003406, now seen corresponding path program 1 times [2019-09-10 08:33:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:46,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:46,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:46,609 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:33:46,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:46,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:46,611 INFO L87 Difference]: Start difference. First operand 752 states and 1093 transitions. Second operand 5 states. [2019-09-10 08:33:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:46,744 INFO L93 Difference]: Finished difference Result 1886 states and 2808 transitions. [2019-09-10 08:33:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:46,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:46,754 INFO L225 Difference]: With dead ends: 1886 [2019-09-10 08:33:46,754 INFO L226 Difference]: Without dead ends: 1886 [2019-09-10 08:33:46,754 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:33:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-10 08:33:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1754. [2019-09-10 08:33:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-09-10 08:33:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2619 transitions. [2019-09-10 08:33:46,798 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2619 transitions. Word has length 138 [2019-09-10 08:33:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:46,799 INFO L475 AbstractCegarLoop]: Abstraction has 1754 states and 2619 transitions. [2019-09-10 08:33:46,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2619 transitions. [2019-09-10 08:33:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:46,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:46,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:46,802 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -285171100, now seen corresponding path program 1 times [2019-09-10 08:33:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:46,948 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:33:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:46,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:46,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:46,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:46,950 INFO L87 Difference]: Start difference. First operand 1754 states and 2619 transitions. Second operand 5 states. [2019-09-10 08:33:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:47,073 INFO L93 Difference]: Finished difference Result 2852 states and 4276 transitions. [2019-09-10 08:33:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:47,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:47,089 INFO L225 Difference]: With dead ends: 2852 [2019-09-10 08:33:47,089 INFO L226 Difference]: Without dead ends: 2852 [2019-09-10 08:33:47,090 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:33:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-09-10 08:33:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2320. [2019-09-10 08:33:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-09-10 08:33:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3482 transitions. [2019-09-10 08:33:47,151 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3482 transitions. Word has length 138 [2019-09-10 08:33:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:47,152 INFO L475 AbstractCegarLoop]: Abstraction has 2320 states and 3482 transitions. [2019-09-10 08:33:47,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3482 transitions. [2019-09-10 08:33:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:47,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:47,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:47,155 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1169624369, now seen corresponding path program 1 times [2019-09-10 08:33:47,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:47,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:47,401 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:33:47,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:47,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:47,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:47,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:47,404 INFO L87 Difference]: Start difference. First operand 2320 states and 3482 transitions. Second operand 5 states. [2019-09-10 08:33:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:47,539 INFO L93 Difference]: Finished difference Result 3368 states and 5063 transitions. [2019-09-10 08:33:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:47,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:47,556 INFO L225 Difference]: With dead ends: 3368 [2019-09-10 08:33:47,556 INFO L226 Difference]: Without dead ends: 3368 [2019-09-10 08:33:47,557 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:33:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2019-09-10 08:33:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2876. [2019-09-10 08:33:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2019-09-10 08:33:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4329 transitions. [2019-09-10 08:33:47,637 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4329 transitions. Word has length 138 [2019-09-10 08:33:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 2876 states and 4329 transitions. [2019-09-10 08:33:47,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4329 transitions. [2019-09-10 08:33:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:47,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:47,642 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1895946469, now seen corresponding path program 1 times [2019-09-10 08:33:47,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:47,789 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:33:47,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:47,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:47,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:47,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:47,791 INFO L87 Difference]: Start difference. First operand 2876 states and 4329 transitions. Second operand 5 states. [2019-09-10 08:33:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:47,945 INFO L93 Difference]: Finished difference Result 3646 states and 5487 transitions. [2019-09-10 08:33:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:47,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:47,966 INFO L225 Difference]: With dead ends: 3646 [2019-09-10 08:33:47,966 INFO L226 Difference]: Without dead ends: 3646 [2019-09-10 08:33:47,968 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:33:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2019-09-10 08:33:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3234. [2019-09-10 08:33:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-09-10 08:33:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4873 transitions. [2019-09-10 08:33:48,080 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4873 transitions. Word has length 138 [2019-09-10 08:33:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:48,081 INFO L475 AbstractCegarLoop]: Abstraction has 3234 states and 4873 transitions. [2019-09-10 08:33:48,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4873 transitions. [2019-09-10 08:33:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:48,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:48,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:48,086 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -81695263, now seen corresponding path program 1 times [2019-09-10 08:33:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:48,251 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:33:48,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:48,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:48,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:48,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:48,254 INFO L87 Difference]: Start difference. First operand 3234 states and 4873 transitions. Second operand 5 states. [2019-09-10 08:33:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:48,373 INFO L93 Difference]: Finished difference Result 3962 states and 5969 transitions. [2019-09-10 08:33:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:48,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:48,395 INFO L225 Difference]: With dead ends: 3962 [2019-09-10 08:33:48,395 INFO L226 Difference]: Without dead ends: 3962 [2019-09-10 08:33:48,397 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:33:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2019-09-10 08:33:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3590. [2019-09-10 08:33:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-09-10 08:33:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5415 transitions. [2019-09-10 08:33:48,540 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5415 transitions. Word has length 138 [2019-09-10 08:33:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:48,540 INFO L475 AbstractCegarLoop]: Abstraction has 3590 states and 5415 transitions. [2019-09-10 08:33:48,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5415 transitions. [2019-09-10 08:33:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:48,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:48,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:48,543 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1932326251, now seen corresponding path program 1 times [2019-09-10 08:33:48,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:48,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:48,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:48,623 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:33:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:48,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:48,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:48,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:48,625 INFO L87 Difference]: Start difference. First operand 3590 states and 5415 transitions. Second operand 3 states. [2019-09-10 08:33:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:48,674 INFO L93 Difference]: Finished difference Result 6548 states and 9774 transitions. [2019-09-10 08:33:48,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:48,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:33:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:48,697 INFO L225 Difference]: With dead ends: 6548 [2019-09-10 08:33:48,698 INFO L226 Difference]: Without dead ends: 6548 [2019-09-10 08:33:48,698 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:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-09-10 08:33:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6474. [2019-09-10 08:33:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2019-09-10 08:33:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 9665 transitions. [2019-09-10 08:33:48,832 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 9665 transitions. Word has length 138 [2019-09-10 08:33:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:48,832 INFO L475 AbstractCegarLoop]: Abstraction has 6474 states and 9665 transitions. [2019-09-10 08:33:48,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 9665 transitions. [2019-09-10 08:33:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:48,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:48,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:48,835 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2083290838, now seen corresponding path program 1 times [2019-09-10 08:33:48,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:48,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:48,938 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:33:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:48,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:48,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:48,940 INFO L87 Difference]: Start difference. First operand 6474 states and 9665 transitions. Second operand 3 states. [2019-09-10 08:33:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:49,016 INFO L93 Difference]: Finished difference Result 6476 states and 9654 transitions. [2019-09-10 08:33:49,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:49,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:33:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:49,029 INFO L225 Difference]: With dead ends: 6476 [2019-09-10 08:33:49,030 INFO L226 Difference]: Without dead ends: 6476 [2019-09-10 08:33:49,031 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:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2019-09-10 08:33:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 6474. [2019-09-10 08:33:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2019-09-10 08:33:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 9653 transitions. [2019-09-10 08:33:49,160 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 9653 transitions. Word has length 138 [2019-09-10 08:33:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:49,160 INFO L475 AbstractCegarLoop]: Abstraction has 6474 states and 9653 transitions. [2019-09-10 08:33:49,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 9653 transitions. [2019-09-10 08:33:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:49,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:49,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:49,167 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -128883718, now seen corresponding path program 1 times [2019-09-10 08:33:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:49,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:49,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:49,376 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:33:49,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:49,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:49,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:49,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:49,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:49,378 INFO L87 Difference]: Start difference. First operand 6474 states and 9653 transitions. Second operand 5 states. [2019-09-10 08:33:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:49,514 INFO L93 Difference]: Finished difference Result 8030 states and 11961 transitions. [2019-09-10 08:33:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:49,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:33:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:49,529 INFO L225 Difference]: With dead ends: 8030 [2019-09-10 08:33:49,529 INFO L226 Difference]: Without dead ends: 8030 [2019-09-10 08:33:49,530 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:33:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2019-09-10 08:33:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 7162. [2019-09-10 08:33:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7162 states. [2019-09-10 08:33:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 10683 transitions. [2019-09-10 08:33:49,662 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 10683 transitions. Word has length 138 [2019-09-10 08:33:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:49,663 INFO L475 AbstractCegarLoop]: Abstraction has 7162 states and 10683 transitions. [2019-09-10 08:33:49,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 10683 transitions. [2019-09-10 08:33:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:33:49,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:49,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:49,666 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash -90574265, now seen corresponding path program 1 times [2019-09-10 08:33:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:49,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:49,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:49,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:49,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:49,933 INFO L87 Difference]: Start difference. First operand 7162 states and 10683 transitions. Second operand 10 states. [2019-09-10 08:33:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:50,473 INFO L93 Difference]: Finished difference Result 21293 states and 31814 transitions. [2019-09-10 08:33:50,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:50,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2019-09-10 08:33:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:50,512 INFO L225 Difference]: With dead ends: 21293 [2019-09-10 08:33:50,512 INFO L226 Difference]: Without dead ends: 21293 [2019-09-10 08:33:50,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:33:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21293 states. [2019-09-10 08:33:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21293 to 8217. [2019-09-10 08:33:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12259 transitions. [2019-09-10 08:33:50,823 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12259 transitions. Word has length 138 [2019-09-10 08:33:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:50,824 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12259 transitions. [2019-09-10 08:33:50,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12259 transitions. [2019-09-10 08:33:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:33:50,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:50,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:50,828 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 41492491, now seen corresponding path program 1 times [2019-09-10 08:33:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:50,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:50,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:51,230 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:33:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:51,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:51,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:51,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:51,232 INFO L87 Difference]: Start difference. First operand 8217 states and 12259 transitions. Second operand 9 states. [2019-09-10 08:33:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:52,053 INFO L93 Difference]: Finished difference Result 15985 states and 23873 transitions. [2019-09-10 08:33:52,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:52,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-09-10 08:33:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:52,084 INFO L225 Difference]: With dead ends: 15985 [2019-09-10 08:33:52,084 INFO L226 Difference]: Without dead ends: 15985 [2019-09-10 08:33:52,085 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:33:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15985 states. [2019-09-10 08:33:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15985 to 8217. [2019-09-10 08:33:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12258 transitions. [2019-09-10 08:33:52,251 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12258 transitions. Word has length 139 [2019-09-10 08:33:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:52,252 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12258 transitions. [2019-09-10 08:33:52,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12258 transitions. [2019-09-10 08:33:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:33:52,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:52,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:52,255 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1381047467, now seen corresponding path program 1 times [2019-09-10 08:33:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:52,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:33:52,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:52,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:52,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:52,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:52,630 INFO L87 Difference]: Start difference. First operand 8217 states and 12258 transitions. Second operand 10 states. [2019-09-10 08:33:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:53,610 INFO L93 Difference]: Finished difference Result 16394 states and 24399 transitions. [2019-09-10 08:33:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:33:53,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 08:33:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:53,641 INFO L225 Difference]: With dead ends: 16394 [2019-09-10 08:33:53,641 INFO L226 Difference]: Without dead ends: 16394 [2019-09-10 08:33:53,642 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:33:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16394 states. [2019-09-10 08:33:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16394 to 8217. [2019-09-10 08:33:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12252 transitions. [2019-09-10 08:33:53,837 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12252 transitions. Word has length 140 [2019-09-10 08:33:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12252 transitions. [2019-09-10 08:33:53,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12252 transitions. [2019-09-10 08:33:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:33:53,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:53,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:53,841 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 520469796, now seen corresponding path program 1 times [2019-09-10 08:33:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:53,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:53,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:53,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:54,125 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:33:54,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:54,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:54,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:54,128 INFO L87 Difference]: Start difference. First operand 8217 states and 12252 transitions. Second operand 10 states. [2019-09-10 08:33:54,928 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 08:33:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:55,876 INFO L93 Difference]: Finished difference Result 15739 states and 23391 transitions. [2019-09-10 08:33:55,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:33:55,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 08:33:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:55,916 INFO L225 Difference]: With dead ends: 15739 [2019-09-10 08:33:55,917 INFO L226 Difference]: Without dead ends: 15739 [2019-09-10 08:33:55,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:33:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15739 states. [2019-09-10 08:33:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15739 to 8217. [2019-09-10 08:33:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12249 transitions. [2019-09-10 08:33:56,082 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12249 transitions. Word has length 140 [2019-09-10 08:33:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:56,082 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12249 transitions. [2019-09-10 08:33:56,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12249 transitions. [2019-09-10 08:33:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:33:56,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:56,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:56,086 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -137813890, now seen corresponding path program 1 times [2019-09-10 08:33:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:56,392 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:33:56,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:56,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:56,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:56,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:56,394 INFO L87 Difference]: Start difference. First operand 8217 states and 12249 transitions. Second operand 10 states. [2019-09-10 08:33:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:57,364 INFO L93 Difference]: Finished difference Result 16406 states and 24401 transitions. [2019-09-10 08:33:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:33:57,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-10 08:33:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:57,388 INFO L225 Difference]: With dead ends: 16406 [2019-09-10 08:33:57,389 INFO L226 Difference]: Without dead ends: 16406 [2019-09-10 08:33:57,389 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:33:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16406 states. [2019-09-10 08:33:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16406 to 8217. [2019-09-10 08:33:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12239 transitions. [2019-09-10 08:33:57,636 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12239 transitions. Word has length 141 [2019-09-10 08:33:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:57,636 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12239 transitions. [2019-09-10 08:33:57,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12239 transitions. [2019-09-10 08:33:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:33:57,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:57,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:57,639 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 280658806, now seen corresponding path program 1 times [2019-09-10 08:33:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:57,906 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:33:57,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:57,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:57,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:57,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:57,910 INFO L87 Difference]: Start difference. First operand 8217 states and 12239 transitions. Second operand 10 states. [2019-09-10 08:33:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:59,014 INFO L93 Difference]: Finished difference Result 16376 states and 24336 transitions. [2019-09-10 08:33:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:33:59,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-09-10 08:33:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:59,032 INFO L225 Difference]: With dead ends: 16376 [2019-09-10 08:33:59,032 INFO L226 Difference]: Without dead ends: 16376 [2019-09-10 08:33:59,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16376 states. [2019-09-10 08:33:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16376 to 8217. [2019-09-10 08:33:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:33:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12226 transitions. [2019-09-10 08:33:59,163 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12226 transitions. Word has length 142 [2019-09-10 08:33:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:59,164 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12226 transitions. [2019-09-10 08:33:59,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12226 transitions. [2019-09-10 08:33:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:33:59,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:59,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:59,166 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1276470156, now seen corresponding path program 1 times [2019-09-10 08:33:59,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:59,471 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:33:59,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:59,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:59,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:59,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:59,473 INFO L87 Difference]: Start difference. First operand 8217 states and 12226 transitions. Second operand 10 states. [2019-09-10 08:34:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:00,738 INFO L93 Difference]: Finished difference Result 16326 states and 24238 transitions. [2019-09-10 08:34:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:34:00,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2019-09-10 08:34:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:00,760 INFO L225 Difference]: With dead ends: 16326 [2019-09-10 08:34:00,760 INFO L226 Difference]: Without dead ends: 16326 [2019-09-10 08:34:00,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:34:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16326 states. [2019-09-10 08:34:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16326 to 8217. [2019-09-10 08:34:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:34:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12211 transitions. [2019-09-10 08:34:00,923 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12211 transitions. Word has length 143 [2019-09-10 08:34:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:00,923 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12211 transitions. [2019-09-10 08:34:00,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12211 transitions. [2019-09-10 08:34:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:34:00,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:00,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,926 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -168650880, now seen corresponding path program 1 times [2019-09-10 08:34:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:01,237 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:34:01,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:34:01,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:01,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:34:01,239 INFO L87 Difference]: Start difference. First operand 8217 states and 12211 transitions. Second operand 10 states. [2019-09-10 08:34:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:02,432 INFO L93 Difference]: Finished difference Result 16261 states and 24115 transitions. [2019-09-10 08:34:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:34:02,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2019-09-10 08:34:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:02,450 INFO L225 Difference]: With dead ends: 16261 [2019-09-10 08:34:02,450 INFO L226 Difference]: Without dead ends: 16261 [2019-09-10 08:34:02,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:34:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2019-09-10 08:34:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 8217. [2019-09-10 08:34:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-10 08:34:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12194 transitions. [2019-09-10 08:34:02,674 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12194 transitions. Word has length 144 [2019-09-10 08:34:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:02,675 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12194 transitions. [2019-09-10 08:34:02,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12194 transitions. [2019-09-10 08:34:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 08:34:02,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:02,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:02,678 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1276940182, now seen corresponding path program 1 times [2019-09-10 08:34:02,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:02,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:02,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:02,968 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:34:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:02,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:34:02,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:02,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:34:02,970 INFO L87 Difference]: Start difference. First operand 8217 states and 12194 transitions. Second operand 10 states. [2019-09-10 08:34:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:04,403 INFO L93 Difference]: Finished difference Result 30722 states and 45392 transitions. [2019-09-10 08:34:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:34:04,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-09-10 08:34:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:04,428 INFO L225 Difference]: With dead ends: 30722 [2019-09-10 08:34:04,429 INFO L226 Difference]: Without dead ends: 30722 [2019-09-10 08:34:04,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:34:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30722 states. [2019-09-10 08:34:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30722 to 8274. [2019-09-10 08:34:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2019-09-10 08:34:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 12270 transitions. [2019-09-10 08:34:04,628 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 12270 transitions. Word has length 145 [2019-09-10 08:34:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:04,628 INFO L475 AbstractCegarLoop]: Abstraction has 8274 states and 12270 transitions. [2019-09-10 08:34:04,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 12270 transitions. [2019-09-10 08:34:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:34:04,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:04,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,630 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1580759111, now seen corresponding path program 1 times [2019-09-10 08:34:04,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:05,721 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:34:05,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:05,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:05,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:05,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:05,723 INFO L87 Difference]: Start difference. First operand 8274 states and 12270 transitions. Second operand 17 states. [2019-09-10 08:34:06,345 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:34:06,517 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:34:06,757 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 08:34:06,928 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:34:07,113 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:34:07,261 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:34:07,464 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:34:07,684 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:34:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:08,573 INFO L93 Difference]: Finished difference Result 32932 states and 49125 transitions. [2019-09-10 08:34:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:34:08,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2019-09-10 08:34:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:08,603 INFO L225 Difference]: With dead ends: 32932 [2019-09-10 08:34:08,604 INFO L226 Difference]: Without dead ends: 32932 [2019-09-10 08:34:08,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:34:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32932 states. [2019-09-10 08:34:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32932 to 8269. [2019-09-10 08:34:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2019-09-10 08:34:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 12261 transitions. [2019-09-10 08:34:08,794 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 12261 transitions. Word has length 146 [2019-09-10 08:34:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:08,794 INFO L475 AbstractCegarLoop]: Abstraction has 8269 states and 12261 transitions. [2019-09-10 08:34:08,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:34:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 12261 transitions. [2019-09-10 08:34:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:34:08,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:08,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:08,796 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1709272328, now seen corresponding path program 1 times [2019-09-10 08:34:08,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:08,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:08,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:10,331 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 08:34:10,485 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:34:10,666 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 08:34:10,862 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:34:11,059 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:34:11,295 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:34:13,547 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-10 08:34:15,775 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:34:16,621 WARN L188 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 08:34:16,863 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 08:34:17,148 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 08:34:19,290 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 08:34:24,138 WARN L188 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:34:27,448 WARN L188 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 08:34:27,749 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 08:34:27,982 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 08:34:30,866 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:34:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-10 08:34:30,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:30,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 08:34:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 08:34:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2117, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:34:30,868 INFO L87 Difference]: Start difference. First operand 8269 states and 12261 transitions. Second operand 48 states. [2019-09-10 08:34:31,222 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 08:34:32,889 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:34:33,118 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:34:33,462 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 08:34:33,729 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:34:34,087 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:34:34,407 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:34:35,367 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:34:36,454 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:34:37,121 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2019-09-10 08:34:37,929 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 134 [2019-09-10 08:34:38,917 WARN L188 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 153 [2019-09-10 08:34:41,744 WARN L188 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 204 DAG size of output: 169 [2019-09-10 08:34:43,065 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 215 DAG size of output: 177 [2019-09-10 08:34:44,542 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 232 DAG size of output: 188 [2019-09-10 08:34:46,164 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 249 DAG size of output: 200 [2019-09-10 08:34:48,096 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 273 DAG size of output: 226 [2019-09-10 08:34:50,212 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 289 DAG size of output: 240 [2019-09-10 08:35:11,183 WARN L188 SmtUtils]: Spent 20.69 s on a formula simplification. DAG size of input: 319 DAG size of output: 269 [2019-09-10 08:35:27,574 WARN L188 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 346 DAG size of output: 294 [2019-09-10 08:35:59,912 WARN L188 SmtUtils]: Spent 32.04 s on a formula simplification. DAG size of input: 360 DAG size of output: 308 [2019-09-10 08:36:00,468 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2019-09-10 08:36:01,005 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2019-09-10 08:36:01,675 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:36:02,086 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-10 08:36:02,442 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-09-10 08:36:02,747 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 08:36:03,232 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:36:04,501 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-09-10 08:36:05,060 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 08:36:05,570 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 08:36:06,392 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2019-09-10 08:36:06,707 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 08:36:07,804 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 08:36:08,594 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 08:36:09,860 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 08:36:10,917 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 08:36:12,443 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:36:13,712 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:36:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:39,478 INFO L93 Difference]: Finished difference Result 38055 states and 56569 transitions. [2019-09-10 08:36:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 08:36:39,479 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2019-09-10 08:36:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:39,509 INFO L225 Difference]: With dead ends: 38055 [2019-09-10 08:36:39,510 INFO L226 Difference]: Without dead ends: 38055 [2019-09-10 08:36:39,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 113.1s TimeCoverageRelationStatistics Valid=1404, Invalid=8298, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 08:36:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38055 states. [2019-09-10 08:36:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38055 to 8326. [2019-09-10 08:36:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-09-10 08:36:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 12338 transitions. [2019-09-10 08:36:39,702 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 12338 transitions. Word has length 146 [2019-09-10 08:36:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:39,703 INFO L475 AbstractCegarLoop]: Abstraction has 8326 states and 12338 transitions. [2019-09-10 08:36:39,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 08:36:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 12338 transitions. [2019-09-10 08:36:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:36:39,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:39,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:39,705 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1849626936, now seen corresponding path program 1 times [2019-09-10 08:36:39,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:39,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:39,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:39,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:39,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:39,788 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:36:39,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:39,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:39,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:39,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:39,790 INFO L87 Difference]: Start difference. First operand 8326 states and 12338 transitions. Second operand 3 states. [2019-09-10 08:36:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:39,837 INFO L93 Difference]: Finished difference Result 15726 states and 23380 transitions. [2019-09-10 08:36:39,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:39,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:36:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:39,854 INFO L225 Difference]: With dead ends: 15726 [2019-09-10 08:36:39,854 INFO L226 Difference]: Without dead ends: 15726 [2019-09-10 08:36:39,855 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:36:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15726 states. [2019-09-10 08:36:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15726 to 15356. [2019-09-10 08:36:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15356 states. [2019-09-10 08:36:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 22735 transitions. [2019-09-10 08:36:40,051 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 22735 transitions. Word has length 146 [2019-09-10 08:36:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:40,052 INFO L475 AbstractCegarLoop]: Abstraction has 15356 states and 22735 transitions. [2019-09-10 08:36:40,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 22735 transitions. [2019-09-10 08:36:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:36:40,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:40,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:40,055 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1322981754, now seen corresponding path program 1 times [2019-09-10 08:36:40,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:40,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:40,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:40,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:41,357 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:36:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:36:41,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:41,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:36:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:36:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:36:41,359 INFO L87 Difference]: Start difference. First operand 15356 states and 22735 transitions. Second operand 19 states. [2019-09-10 08:36:42,156 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 08:36:42,357 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:36:42,681 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:36:42,998 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-10 08:36:43,174 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:36:43,565 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:36:43,877 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:36:44,057 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:36:44,314 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:36:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:45,666 INFO L93 Difference]: Finished difference Result 80088 states and 119018 transitions. [2019-09-10 08:36:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:36:45,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-10 08:36:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:45,733 INFO L225 Difference]: With dead ends: 80088 [2019-09-10 08:36:45,733 INFO L226 Difference]: Without dead ends: 80088 [2019-09-10 08:36:45,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:36:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80088 states. [2019-09-10 08:36:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80088 to 15374. [2019-09-10 08:36:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15374 states. [2019-09-10 08:36:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15374 states to 15374 states and 22747 transitions. [2019-09-10 08:36:46,171 INFO L78 Accepts]: Start accepts. Automaton has 15374 states and 22747 transitions. Word has length 146 [2019-09-10 08:36:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:46,171 INFO L475 AbstractCegarLoop]: Abstraction has 15374 states and 22747 transitions. [2019-09-10 08:36:46,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:36:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15374 states and 22747 transitions. [2019-09-10 08:36:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:36:46,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:46,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:46,174 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -763063941, now seen corresponding path program 1 times [2019-09-10 08:36:46,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:46,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:46,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:47,598 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:36:47,899 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 08:36:48,246 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 08:36:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:49,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:49,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:36:49,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:49,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:36:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:36:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:36:49,250 INFO L87 Difference]: Start difference. First operand 15374 states and 22747 transitions. Second operand 31 states. [2019-09-10 08:36:50,538 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 08:36:51,160 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 08:36:51,471 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:36:51,879 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:36:52,392 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-09-10 08:36:53,016 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-09-10 08:36:53,684 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 133 [2019-09-10 08:36:54,523 WARN L188 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 159 [2019-09-10 08:36:55,505 WARN L188 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 172 [2019-09-10 08:36:55,803 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:36:56,004 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 08:36:56,462 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:36:57,014 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 08:36:57,311 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 08:36:57,754 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 08:36:58,353 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:36:59,009 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:36:59,729 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:37:00,240 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:37:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:05,196 INFO L93 Difference]: Finished difference Result 81777 states and 121444 transitions. [2019-09-10 08:37:05,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:37:05,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 146 [2019-09-10 08:37:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:05,283 INFO L225 Difference]: With dead ends: 81777 [2019-09-10 08:37:05,283 INFO L226 Difference]: Without dead ends: 81777 [2019-09-10 08:37:05,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:37:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81777 states. [2019-09-10 08:37:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81777 to 15419. [2019-09-10 08:37:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15419 states. [2019-09-10 08:37:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15419 states to 15419 states and 22798 transitions. [2019-09-10 08:37:05,741 INFO L78 Accepts]: Start accepts. Automaton has 15419 states and 22798 transitions. Word has length 146 [2019-09-10 08:37:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:05,741 INFO L475 AbstractCegarLoop]: Abstraction has 15419 states and 22798 transitions. [2019-09-10 08:37:05,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:37:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15419 states and 22798 transitions. [2019-09-10 08:37:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:37:05,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:05,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:05,743 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:05,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1501026150, now seen corresponding path program 1 times [2019-09-10 08:37:05,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:05,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:05,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:05,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:05,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:06,801 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:37:06,966 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 08:37:07,145 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:37:07,336 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:37:07,567 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:37:07,768 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 08:37:08,024 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 08:37:08,264 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:37:08,522 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 08:37:08,798 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:37:09,060 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 08:37:09,306 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 08:37:09,591 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:37:09,817 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:37:10,057 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 08:37:10,276 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 08:37:10,501 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:37:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:13,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:13,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-10 08:37:13,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:13,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 08:37:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 08:37:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:37:13,236 INFO L87 Difference]: Start difference. First operand 15419 states and 22798 transitions. Second operand 48 states. [2019-09-10 08:37:13,545 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 08:37:15,193 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:37:15,425 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:37:15,653 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:37:15,957 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 08:37:16,235 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 08:37:16,515 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 08:37:17,933 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 08:37:18,395 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:37:18,871 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:37:19,490 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2019-09-10 08:37:20,248 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 118 [2019-09-10 08:37:21,094 WARN L188 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 134 [2019-09-10 08:37:22,020 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 143 [2019-09-10 08:37:23,100 WARN L188 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 160 [2019-09-10 08:37:24,259 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 204 DAG size of output: 170 [2019-09-10 08:37:25,628 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 225 DAG size of output: 189 [2019-09-10 08:37:27,036 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 237 DAG size of output: 198 [2019-09-10 08:37:28,713 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 262 DAG size of output: 216 [2019-09-10 08:37:30,592 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 283 DAG size of output: 236 [2019-09-10 08:37:32,607 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 306 DAG size of output: 258 [2019-09-10 08:37:33,129 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-09-10 08:37:33,641 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-09-10 08:37:33,946 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 08:37:34,432 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-10 08:37:34,665 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 08:37:35,367 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-10 08:37:35,865 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-09-10 08:37:43,072 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:37:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:56,397 INFO L93 Difference]: Finished difference Result 57521 states and 85129 transitions. [2019-09-10 08:37:56,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:37:56,398 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2019-09-10 08:37:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:56,453 INFO L225 Difference]: With dead ends: 57521 [2019-09-10 08:37:56,453 INFO L226 Difference]: Without dead ends: 57521 [2019-09-10 08:37:56,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=1371, Invalid=7371, Unknown=0, NotChecked=0, Total=8742 [2019-09-10 08:37:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57521 states. [2019-09-10 08:37:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57521 to 15570. [2019-09-10 08:37:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15570 states. [2019-09-10 08:37:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 22993 transitions. [2019-09-10 08:37:56,784 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 22993 transitions. Word has length 146 [2019-09-10 08:37:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:56,785 INFO L475 AbstractCegarLoop]: Abstraction has 15570 states and 22993 transitions. [2019-09-10 08:37:56,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 08:37:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 22993 transitions. [2019-09-10 08:37:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:37:56,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:56,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:56,787 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -632394695, now seen corresponding path program 1 times [2019-09-10 08:37:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:57,818 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:37:57,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:57,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:37:57,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:57,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:37:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:37:57,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:37:57,820 INFO L87 Difference]: Start difference. First operand 15570 states and 22993 transitions. Second operand 19 states. [2019-09-10 08:37:58,449 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 08:37:58,654 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:37:58,956 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-10 08:37:59,399 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 08:37:59,570 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:37:59,936 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:38:00,204 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:38:00,426 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:38:00,689 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:38:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:01,786 INFO L93 Difference]: Finished difference Result 80481 states and 119485 transitions. [2019-09-10 08:38:01,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:38:01,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-10 08:38:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:01,854 INFO L225 Difference]: With dead ends: 80481 [2019-09-10 08:38:01,854 INFO L226 Difference]: Without dead ends: 80481 [2019-09-10 08:38:01,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:38:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80481 states. [2019-09-10 08:38:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80481 to 15525. [2019-09-10 08:38:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15525 states. [2019-09-10 08:38:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15525 states to 15525 states and 22922 transitions. [2019-09-10 08:38:02,435 INFO L78 Accepts]: Start accepts. Automaton has 15525 states and 22922 transitions. Word has length 146 [2019-09-10 08:38:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:02,435 INFO L475 AbstractCegarLoop]: Abstraction has 15525 states and 22922 transitions. [2019-09-10 08:38:02,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:38:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 15525 states and 22922 transitions. [2019-09-10 08:38:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:38:02,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:02,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,437 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash -496113447, now seen corresponding path program 1 times [2019-09-10 08:38:02,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:02,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:03,430 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:38:03,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:03,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:38:03,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:03,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:38:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:38:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:38:03,432 INFO L87 Difference]: Start difference. First operand 15525 states and 22922 transitions. Second operand 19 states. [2019-09-10 08:38:04,076 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 08:38:04,276 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:38:04,561 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 08:38:04,889 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:38:05,069 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:38:05,439 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:38:05,681 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:38:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:06,515 INFO L93 Difference]: Finished difference Result 49834 states and 73910 transitions. [2019-09-10 08:38:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:38:06,516 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-10 08:38:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:06,565 INFO L225 Difference]: With dead ends: 49834 [2019-09-10 08:38:06,565 INFO L226 Difference]: Without dead ends: 49834 [2019-09-10 08:38:06,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:38:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49834 states. [2019-09-10 08:38:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49834 to 15457. [2019-09-10 08:38:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15457 states. [2019-09-10 08:38:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15457 states to 15457 states and 22830 transitions. [2019-09-10 08:38:06,882 INFO L78 Accepts]: Start accepts. Automaton has 15457 states and 22830 transitions. Word has length 146 [2019-09-10 08:38:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:06,882 INFO L475 AbstractCegarLoop]: Abstraction has 15457 states and 22830 transitions. [2019-09-10 08:38:06,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:38:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15457 states and 22830 transitions. [2019-09-10 08:38:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:06,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:06,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:06,884 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -841502904, now seen corresponding path program 1 times [2019-09-10 08:38:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:06,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:08,078 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:38:08,215 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:38:08,364 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:38:08,559 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:38:08,730 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:38:08,943 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 08:38:09,116 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:38:09,318 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:38:09,669 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:38:11,284 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:38:11,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:11,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2019-09-10 08:38:11,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:11,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 08:38:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 08:38:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:38:11,286 INFO L87 Difference]: Start difference. First operand 15457 states and 22830 transitions. Second operand 37 states. [2019-09-10 08:38:11,535 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 08:38:12,525 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 08:38:12,701 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:38:12,892 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 08:38:13,467 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 08:38:14,159 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-10 08:38:14,517 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-09-10 08:38:15,032 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 100 [2019-09-10 08:38:15,594 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-09-10 08:38:16,349 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 125 [2019-09-10 08:38:17,127 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2019-09-10 08:38:18,073 WARN L188 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 156 [2019-09-10 08:38:19,131 WARN L188 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 167 [2019-09-10 08:38:20,534 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 228 DAG size of output: 193 [2019-09-10 08:38:21,866 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 242 DAG size of output: 206 [2019-09-10 08:38:22,263 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-09-10 08:38:22,550 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-09-10 08:38:23,095 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-09-10 08:38:23,658 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-09-10 08:38:24,193 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-10 08:38:24,723 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-10 08:38:25,611 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 08:38:26,295 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 08:38:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:34,325 INFO L93 Difference]: Finished difference Result 63241 states and 93730 transitions. [2019-09-10 08:38:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 08:38:34,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2019-09-10 08:38:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:34,375 INFO L225 Difference]: With dead ends: 63241 [2019-09-10 08:38:34,376 INFO L226 Difference]: Without dead ends: 63241 [2019-09-10 08:38:34,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=889, Invalid=4081, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:38:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63241 states. [2019-09-10 08:38:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63241 to 15511. [2019-09-10 08:38:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15511 states. [2019-09-10 08:38:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15511 states to 15511 states and 22893 transitions. [2019-09-10 08:38:34,702 INFO L78 Accepts]: Start accepts. Automaton has 15511 states and 22893 transitions. Word has length 147 [2019-09-10 08:38:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:34,702 INFO L475 AbstractCegarLoop]: Abstraction has 15511 states and 22893 transitions. [2019-09-10 08:38:34,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 08:38:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15511 states and 22893 transitions. [2019-09-10 08:38:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:34,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:34,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:34,704 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 104705483, now seen corresponding path program 1 times [2019-09-10 08:38:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:35,701 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:38:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:35,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:38:35,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:35,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:38:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:38:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:38:35,702 INFO L87 Difference]: Start difference. First operand 15511 states and 22893 transitions. Second operand 19 states. [2019-09-10 08:38:36,543 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 08:38:36,775 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:38:37,109 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:38:37,455 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-09-10 08:38:37,664 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:38:37,817 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:38:38,142 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:38:38,480 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:38:38,791 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:38:39,193 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:38:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:40,156 INFO L93 Difference]: Finished difference Result 50886 states and 75394 transitions. [2019-09-10 08:38:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:38:40,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-10 08:38:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:40,200 INFO L225 Difference]: With dead ends: 50886 [2019-09-10 08:38:40,200 INFO L226 Difference]: Without dead ends: 50886 [2019-09-10 08:38:40,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:38:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50886 states. [2019-09-10 08:38:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50886 to 15504. [2019-09-10 08:38:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15504 states. [2019-09-10 08:38:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15504 states to 15504 states and 22880 transitions. [2019-09-10 08:38:40,493 INFO L78 Accepts]: Start accepts. Automaton has 15504 states and 22880 transitions. Word has length 147 [2019-09-10 08:38:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:40,494 INFO L475 AbstractCegarLoop]: Abstraction has 15504 states and 22880 transitions. [2019-09-10 08:38:40,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:38:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15504 states and 22880 transitions. [2019-09-10 08:38:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:40,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:40,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:40,496 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash 257503598, now seen corresponding path program 1 times [2019-09-10 08:38:40,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:40,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:40,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:40,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:41,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:38:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:38:41,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:41,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:38:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:38:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:38:41,198 INFO L87 Difference]: Start difference. First operand 15504 states and 22880 transitions. Second operand 11 states. [2019-09-10 08:38:41,644 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:38:41,822 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 08:38:42,002 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 08:38:42,146 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:38:42,290 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:38:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:42,642 INFO L93 Difference]: Finished difference Result 59843 states and 88907 transitions. [2019-09-10 08:38:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:38:42,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-10 08:38:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:42,692 INFO L225 Difference]: With dead ends: 59843 [2019-09-10 08:38:42,692 INFO L226 Difference]: Without dead ends: 59843 [2019-09-10 08:38:42,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:38:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59843 states. [2019-09-10 08:38:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59843 to 15449. [2019-09-10 08:38:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15449 states. [2019-09-10 08:38:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15449 states to 15449 states and 22808 transitions. [2019-09-10 08:38:43,030 INFO L78 Accepts]: Start accepts. Automaton has 15449 states and 22808 transitions. Word has length 147 [2019-09-10 08:38:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:43,030 INFO L475 AbstractCegarLoop]: Abstraction has 15449 states and 22808 transitions. [2019-09-10 08:38:43,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:38:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15449 states and 22808 transitions. [2019-09-10 08:38:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:43,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:43,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:43,032 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 339968070, now seen corresponding path program 1 times [2019-09-10 08:38:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:43,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:43,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:44,029 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:38:44,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:44,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:38:44,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:44,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:38:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:38:44,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:38:44,030 INFO L87 Difference]: Start difference. First operand 15449 states and 22808 transitions. Second operand 19 states. [2019-09-10 08:38:44,712 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:38:44,925 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:38:45,248 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:38:45,584 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-09-10 08:38:45,762 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:38:46,091 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:38:46,344 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:38:46,577 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:38:46,830 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:38:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:47,510 INFO L93 Difference]: Finished difference Result 80204 states and 119089 transitions. [2019-09-10 08:38:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:38:47,511 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-10 08:38:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:47,581 INFO L225 Difference]: With dead ends: 80204 [2019-09-10 08:38:47,581 INFO L226 Difference]: Without dead ends: 80204 [2019-09-10 08:38:47,581 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:38:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80204 states. [2019-09-10 08:38:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80204 to 15375. [2019-09-10 08:38:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15375 states. [2019-09-10 08:38:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15375 states to 15375 states and 22706 transitions. [2019-09-10 08:38:48,316 INFO L78 Accepts]: Start accepts. Automaton has 15375 states and 22706 transitions. Word has length 147 [2019-09-10 08:38:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:48,316 INFO L475 AbstractCegarLoop]: Abstraction has 15375 states and 22706 transitions. [2019-09-10 08:38:48,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:38:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 15375 states and 22706 transitions. [2019-09-10 08:38:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:48,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:48,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,318 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -401329723, now seen corresponding path program 1 times [2019-09-10 08:38:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:48,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:48,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:48,948 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:38:49,259 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:38:49,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:49,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:38:49,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:49,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:38:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:38:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:38:49,261 INFO L87 Difference]: Start difference. First operand 15375 states and 22706 transitions. Second operand 16 states. [2019-09-10 08:38:49,463 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:38:49,827 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:38:50,062 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:38:50,332 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:38:50,524 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2019-09-10 08:38:50,891 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-09-10 08:38:51,239 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-10 08:38:51,590 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-10 08:38:51,771 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:38:51,943 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:38:52,282 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-10 08:38:52,428 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:38:52,830 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 08:38:53,036 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 08:38:53,692 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:38:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:54,238 INFO L93 Difference]: Finished difference Result 89783 states and 133345 transitions. [2019-09-10 08:38:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:38:54,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2019-09-10 08:38:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:54,321 INFO L225 Difference]: With dead ends: 89783 [2019-09-10 08:38:54,322 INFO L226 Difference]: Without dead ends: 89783 [2019-09-10 08:38:54,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:38:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89783 states. [2019-09-10 08:38:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89783 to 15269. [2019-09-10 08:38:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15269 states. [2019-09-10 08:38:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15269 states to 15269 states and 22572 transitions. [2019-09-10 08:38:54,865 INFO L78 Accepts]: Start accepts. Automaton has 15269 states and 22572 transitions. Word has length 147 [2019-09-10 08:38:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:54,866 INFO L475 AbstractCegarLoop]: Abstraction has 15269 states and 22572 transitions. [2019-09-10 08:38:54,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:38:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15269 states and 22572 transitions. [2019-09-10 08:38:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:38:54,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:54,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:54,867 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash -477350258, now seen corresponding path program 1 times [2019-09-10 08:38:54,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:54,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:54,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:55,809 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:38:56,101 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:38:57,518 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-09-10 08:38:57,826 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:38:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:57,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:38:57,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:57,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:38:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:38:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:38:57,828 INFO L87 Difference]: Start difference. First operand 15269 states and 22572 transitions. Second operand 30 states. [2019-09-10 08:38:57,987 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:38:59,565 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:38:59,825 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 08:39:00,096 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:39:00,480 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 08:39:00,888 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 08:39:01,447 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-10 08:39:02,084 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2019-09-10 08:39:02,882 WARN L188 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 146 [2019-09-10 08:39:03,180 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:39:03,459 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:39:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:07,237 INFO L93 Difference]: Finished difference Result 46582 states and 68986 transitions. [2019-09-10 08:39:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:39:07,237 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-09-10 08:39:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:07,275 INFO L225 Difference]: With dead ends: 46582 [2019-09-10 08:39:07,275 INFO L226 Difference]: Without dead ends: 46582 [2019-09-10 08:39:07,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=502, Invalid=2468, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 08:39:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46582 states. [2019-09-10 08:39:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46582 to 15318. [2019-09-10 08:39:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15318 states. [2019-09-10 08:39:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15318 states to 15318 states and 22632 transitions. [2019-09-10 08:39:07,517 INFO L78 Accepts]: Start accepts. Automaton has 15318 states and 22632 transitions. Word has length 147 [2019-09-10 08:39:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:07,517 INFO L475 AbstractCegarLoop]: Abstraction has 15318 states and 22632 transitions. [2019-09-10 08:39:07,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:39:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15318 states and 22632 transitions. [2019-09-10 08:39:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:39:07,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:07,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:07,519 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2044975532, now seen corresponding path program 1 times [2019-09-10 08:39:07,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:07,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:07,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:07,664 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:39:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:39:07,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:07,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:39:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:39:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:07,666 INFO L87 Difference]: Start difference. First operand 15318 states and 22632 transitions. Second operand 4 states. [2019-09-10 08:39:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:07,766 INFO L93 Difference]: Finished difference Result 21960 states and 32361 transitions. [2019-09-10 08:39:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:07,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-10 08:39:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:07,786 INFO L225 Difference]: With dead ends: 21960 [2019-09-10 08:39:07,786 INFO L226 Difference]: Without dead ends: 21960 [2019-09-10 08:39:07,787 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:39:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2019-09-10 08:39:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 21874. [2019-09-10 08:39:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21874 states. [2019-09-10 08:39:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21874 states to 21874 states and 32276 transitions. [2019-09-10 08:39:08,234 INFO L78 Accepts]: Start accepts. Automaton has 21874 states and 32276 transitions. Word has length 147 [2019-09-10 08:39:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:08,234 INFO L475 AbstractCegarLoop]: Abstraction has 21874 states and 32276 transitions. [2019-09-10 08:39:08,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:39:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21874 states and 32276 transitions. [2019-09-10 08:39:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:39:08,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:08,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:08,235 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:08,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2049083608, now seen corresponding path program 1 times [2019-09-10 08:39:08,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:08,340 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:39:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:08,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:08,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:08,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:08,342 INFO L87 Difference]: Start difference. First operand 21874 states and 32276 transitions. Second operand 5 states. [2019-09-10 08:39:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:08,437 INFO L93 Difference]: Finished difference Result 36096 states and 53108 transitions. [2019-09-10 08:39:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:39:08,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 08:39:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:08,466 INFO L225 Difference]: With dead ends: 36096 [2019-09-10 08:39:08,466 INFO L226 Difference]: Without dead ends: 36096 [2019-09-10 08:39:08,466 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:39:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36096 states. [2019-09-10 08:39:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36096 to 21994. [2019-09-10 08:39:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21994 states. [2019-09-10 08:39:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21994 states to 21994 states and 32352 transitions. [2019-09-10 08:39:08,704 INFO L78 Accepts]: Start accepts. Automaton has 21994 states and 32352 transitions. Word has length 147 [2019-09-10 08:39:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:08,705 INFO L475 AbstractCegarLoop]: Abstraction has 21994 states and 32352 transitions. [2019-09-10 08:39:08,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21994 states and 32352 transitions. [2019-09-10 08:39:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:39:08,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:08,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:08,706 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash -74338866, now seen corresponding path program 1 times [2019-09-10 08:39:08,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:09,695 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:39:09,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:09,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:39:09,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:09,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:39:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:39:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:39:09,697 INFO L87 Difference]: Start difference. First operand 21994 states and 32352 transitions. Second operand 18 states. [2019-09-10 08:39:10,636 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:39:10,919 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 08:39:11,079 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:39:11,242 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:39:11,406 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:39:11,883 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:39:12,125 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 08:39:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:13,051 INFO L93 Difference]: Finished difference Result 101019 states and 148923 transitions. [2019-09-10 08:39:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:39:13,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2019-09-10 08:39:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:13,161 INFO L225 Difference]: With dead ends: 101019 [2019-09-10 08:39:13,162 INFO L226 Difference]: Without dead ends: 101019 [2019-09-10 08:39:13,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:39:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101019 states. [2019-09-10 08:39:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101019 to 21918. [2019-09-10 08:39:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-09-10 08:39:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 32263 transitions. [2019-09-10 08:39:13,755 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 32263 transitions. Word has length 147 [2019-09-10 08:39:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:13,755 INFO L475 AbstractCegarLoop]: Abstraction has 21918 states and 32263 transitions. [2019-09-10 08:39:13,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:39:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 32263 transitions. [2019-09-10 08:39:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:39:13,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:13,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:13,757 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2099094595, now seen corresponding path program 1 times [2019-09-10 08:39:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:13,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:13,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:14,419 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:39:14,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:14,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:39:14,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:14,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:39:14,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:39:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:39:14,421 INFO L87 Difference]: Start difference. First operand 21918 states and 32263 transitions. Second operand 12 states. [2019-09-10 08:39:14,881 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:39:15,249 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:39:15,416 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:39:15,720 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:39:15,942 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:39:16,088 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:39:16,528 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:39:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:16,767 INFO L93 Difference]: Finished difference Result 108178 states and 159698 transitions. [2019-09-10 08:39:16,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:39:16,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-09-10 08:39:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:16,880 INFO L225 Difference]: With dead ends: 108178 [2019-09-10 08:39:16,880 INFO L226 Difference]: Without dead ends: 108178 [2019-09-10 08:39:16,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:39:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108178 states. [2019-09-10 08:39:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108178 to 21839. [2019-09-10 08:39:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21839 states. [2019-09-10 08:39:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21839 states to 21839 states and 32166 transitions. [2019-09-10 08:39:17,559 INFO L78 Accepts]: Start accepts. Automaton has 21839 states and 32166 transitions. Word has length 148 [2019-09-10 08:39:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:17,559 INFO L475 AbstractCegarLoop]: Abstraction has 21839 states and 32166 transitions. [2019-09-10 08:39:17,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:39:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21839 states and 32166 transitions. [2019-09-10 08:39:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:39:17,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:17,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:17,561 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2076503299, now seen corresponding path program 1 times [2019-09-10 08:39:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:17,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:17,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:18,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:39:18,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:18,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:39:18,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:18,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:39:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:39:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:39:18,971 INFO L87 Difference]: Start difference. First operand 21839 states and 32166 transitions. Second operand 20 states. [2019-09-10 08:39:20,016 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:39:20,187 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:39:20,464 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-10 08:39:20,771 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 08:39:20,976 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:39:21,438 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:39:21,605 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:39:21,836 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:39:22,162 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:39:22,614 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:39:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:23,978 INFO L93 Difference]: Finished difference Result 134633 states and 198520 transitions. [2019-09-10 08:39:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:39:23,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 148 [2019-09-10 08:39:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:24,111 INFO L225 Difference]: With dead ends: 134633 [2019-09-10 08:39:24,112 INFO L226 Difference]: Without dead ends: 134633 [2019-09-10 08:39:24,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:39:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134633 states. [2019-09-10 08:39:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134633 to 21864. [2019-09-10 08:39:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21864 states. [2019-09-10 08:39:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21864 states to 21864 states and 32196 transitions. [2019-09-10 08:39:25,191 INFO L78 Accepts]: Start accepts. Automaton has 21864 states and 32196 transitions. Word has length 148 [2019-09-10 08:39:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:25,191 INFO L475 AbstractCegarLoop]: Abstraction has 21864 states and 32196 transitions. [2019-09-10 08:39:25,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:39:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21864 states and 32196 transitions. [2019-09-10 08:39:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:39:25,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:25,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:25,192 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1381144628, now seen corresponding path program 1 times [2019-09-10 08:39:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:25,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:26,621 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:39:26,759 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:39:26,897 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:39:27,054 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:39:27,233 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:39:27,392 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:39:27,561 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 08:39:27,741 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:39:27,931 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 08:39:28,100 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:39:28,279 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 08:39:28,445 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:39:28,635 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:39:28,814 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:39:29,055 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 08:39:29,434 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:39:32,262 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:39:32,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:32,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2019-09-10 08:39:32,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:32,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 08:39:32,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 08:39:32,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:39:32,264 INFO L87 Difference]: Start difference. First operand 21864 states and 32196 transitions. Second operand 50 states. [2019-09-10 08:39:32,755 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-09-10 08:39:33,795 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 08:39:34,044 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:39:34,356 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:39:34,668 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 08:39:35,021 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:39:35,371 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:39:36,029 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 08:39:36,449 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:39:36,928 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:39:37,430 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-09-10 08:39:38,953 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-09-10 08:39:39,491 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-09-10 08:39:40,022 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-09-10 08:39:40,570 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 95 [2019-09-10 08:39:41,199 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 104 [2019-09-10 08:39:41,848 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2019-09-10 08:39:42,611 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 121 [2019-09-10 08:39:43,392 WARN L188 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 129 [2019-09-10 08:39:44,297 WARN L188 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2019-09-10 08:39:45,225 WARN L188 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 150 [2019-09-10 08:39:46,325 WARN L188 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 160 [2019-09-10 08:39:47,490 WARN L188 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 169 [2019-09-10 08:39:48,923 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 251 DAG size of output: 190 [2019-09-10 08:39:50,451 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 268 DAG size of output: 206 [2019-09-10 08:39:52,097 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 279 DAG size of output: 216 [2019-09-10 08:39:52,609 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 106 [2019-09-10 08:39:53,115 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 106 [2019-09-10 08:39:54,033 WARN L188 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 110 [2019-09-10 08:39:54,506 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 103 [2019-09-10 08:39:55,195 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2019-09-10 08:39:55,592 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-09-10 08:39:56,183 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 101 [2019-09-10 08:39:56,702 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 08:39:57,636 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:39:58,643 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:39:59,148 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 08:40:00,664 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:40:02,677 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:40:04,616 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:40:06,014 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 08:40:06,426 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 08:40:07,084 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:40:07,731 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:40:08,172 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-09-10 08:40:11,937 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-10 08:40:34,737 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-09-10 08:40:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:36,434 INFO L93 Difference]: Finished difference Result 265147 states and 391063 transitions. [2019-09-10 08:40:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 08:40:36,435 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 148 [2019-09-10 08:40:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:36,732 INFO L225 Difference]: With dead ends: 265147 [2019-09-10 08:40:36,732 INFO L226 Difference]: Without dead ends: 265147 [2019-09-10 08:40:36,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=1817, Invalid=10615, Unknown=0, NotChecked=0, Total=12432 [2019-09-10 08:40:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265147 states. [2019-09-10 08:40:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265147 to 21884. [2019-09-10 08:40:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21884 states. [2019-09-10 08:40:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21884 states to 21884 states and 32221 transitions. [2019-09-10 08:40:38,171 INFO L78 Accepts]: Start accepts. Automaton has 21884 states and 32221 transitions. Word has length 148 [2019-09-10 08:40:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:38,171 INFO L475 AbstractCegarLoop]: Abstraction has 21884 states and 32221 transitions. [2019-09-10 08:40:38,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 08:40:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21884 states and 32221 transitions. [2019-09-10 08:40:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:40:38,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:38,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:38,172 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash -317738845, now seen corresponding path program 1 times [2019-09-10 08:40:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:38,720 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:40:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:40:38,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:38,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:40:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:40:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:40:38,721 INFO L87 Difference]: Start difference. First operand 21884 states and 32221 transitions. Second operand 13 states. [2019-09-10 08:40:39,270 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:40:39,490 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:40:39,721 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:40:40,081 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:40:40,318 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:40:40,521 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:40:41,021 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:40:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:41,250 INFO L93 Difference]: Finished difference Result 108142 states and 159657 transitions. [2019-09-10 08:40:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:40:41,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2019-09-10 08:40:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:41,354 INFO L225 Difference]: With dead ends: 108142 [2019-09-10 08:40:41,354 INFO L226 Difference]: Without dead ends: 108142 [2019-09-10 08:40:41,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:40:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108142 states. [2019-09-10 08:40:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108142 to 21812. [2019-09-10 08:40:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21812 states. [2019-09-10 08:40:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21812 states to 21812 states and 32135 transitions. [2019-09-10 08:40:42,351 INFO L78 Accepts]: Start accepts. Automaton has 21812 states and 32135 transitions. Word has length 148 [2019-09-10 08:40:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:42,351 INFO L475 AbstractCegarLoop]: Abstraction has 21812 states and 32135 transitions. [2019-09-10 08:40:42,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:40:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21812 states and 32135 transitions. [2019-09-10 08:40:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:40:42,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:42,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:42,352 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1792861309, now seen corresponding path program 1 times [2019-09-10 08:40:42,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:42,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:42,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:43,443 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:40:43,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:43,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:40:43,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:43,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:40:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:40:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:40:43,444 INFO L87 Difference]: Start difference. First operand 21812 states and 32135 transitions. Second operand 18 states. [2019-09-10 08:40:44,188 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 08:40:44,370 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:40:44,679 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:40:44,867 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:40:45,056 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:40:45,273 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:40:45,417 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:40:45,591 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:40:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:46,966 INFO L93 Difference]: Finished difference Result 95767 states and 141622 transitions. [2019-09-10 08:40:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:40:46,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2019-09-10 08:40:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:47,070 INFO L225 Difference]: With dead ends: 95767 [2019-09-10 08:40:47,070 INFO L226 Difference]: Without dead ends: 95767 [2019-09-10 08:40:47,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:40:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95767 states. [2019-09-10 08:40:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95767 to 21761. [2019-09-10 08:40:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2019-09-10 08:40:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 32075 transitions. [2019-09-10 08:40:47,709 INFO L78 Accepts]: Start accepts. Automaton has 21761 states and 32075 transitions. Word has length 148 [2019-09-10 08:40:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:47,710 INFO L475 AbstractCegarLoop]: Abstraction has 21761 states and 32075 transitions. [2019-09-10 08:40:47,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:40:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21761 states and 32075 transitions. [2019-09-10 08:40:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:40:47,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:47,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:47,711 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 496128768, now seen corresponding path program 1 times [2019-09-10 08:40:47,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:47,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:47,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:48,245 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-10 08:40:48,571 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:40:48,696 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:40:48,831 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:40:48,971 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:40:49,130 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:40:49,251 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:40:49,374 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:40:49,501 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:40:49,637 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:40:49,767 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:40:49,916 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:40:50,074 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:40:50,232 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 08:40:50,396 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:40:50,555 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 08:40:50,732 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:40:50,894 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:40:51,072 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 08:40:51,239 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:40:51,474 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 08:40:51,646 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:40:51,874 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 08:40:52,392 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:40:55,654 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:40:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2019-09-10 08:40:55,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:55,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 08:40:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 08:40:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:40:55,655 INFO L87 Difference]: Start difference. First operand 21761 states and 32075 transitions. Second operand 50 states. [2019-09-10 08:40:56,225 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-09-10 08:40:57,444 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 08:40:57,731 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:40:58,051 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:40:58,491 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:40:58,942 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-10 08:40:59,461 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-09-10 08:40:59,975 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-09-10 08:41:01,412 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-09-10 08:41:02,264 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2019-09-10 08:41:02,912 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2019-09-10 08:41:03,672 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-09-10 08:41:04,476 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 108 [2019-09-10 08:41:05,407 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 118 [2019-09-10 08:41:06,373 WARN L188 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 128 [2019-09-10 08:41:07,514 WARN L188 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 140 [2019-09-10 08:41:08,736 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 203 DAG size of output: 148 [2019-09-10 08:41:10,257 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 231 DAG size of output: 171 [2019-09-10 08:41:11,916 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 248 DAG size of output: 186 [2019-09-10 08:41:13,670 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 259 DAG size of output: 196 [2019-09-10 08:41:15,472 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 266 DAG size of output: 201 [2019-09-10 08:41:17,456 WARN L188 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 276 DAG size of output: 209 [2019-09-10 08:41:19,662 WARN L188 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 287 DAG size of output: 219 [2019-09-10 08:41:20,455 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 114 [2019-09-10 08:41:21,230 WARN L188 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 114 [2019-09-10 08:41:21,879 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 08:41:22,227 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 08:41:22,551 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 08:41:22,745 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:41:23,281 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:41:23,823 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:41:25,259 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:41:26,982 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:41:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:36,252 INFO L93 Difference]: Finished difference Result 87699 states and 129480 transitions. [2019-09-10 08:41:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 08:41:36,252 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 148 [2019-09-10 08:41:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:36,345 INFO L225 Difference]: With dead ends: 87699 [2019-09-10 08:41:36,346 INFO L226 Difference]: Without dead ends: 87699 [2019-09-10 08:41:36,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=1301, Invalid=8401, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 08:41:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87699 states. [2019-09-10 08:41:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87699 to 21788. [2019-09-10 08:41:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21788 states. [2019-09-10 08:41:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21788 states to 21788 states and 32107 transitions. [2019-09-10 08:41:36,895 INFO L78 Accepts]: Start accepts. Automaton has 21788 states and 32107 transitions. Word has length 148 [2019-09-10 08:41:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:36,896 INFO L475 AbstractCegarLoop]: Abstraction has 21788 states and 32107 transitions. [2019-09-10 08:41:36,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 08:41:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21788 states and 32107 transitions. [2019-09-10 08:41:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:41:36,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:36,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:36,897 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1491910918, now seen corresponding path program 1 times [2019-09-10 08:41:36,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:36,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:36,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:37,447 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:41:37,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:37,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:41:37,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:37,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:41:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:41:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:41:37,449 INFO L87 Difference]: Start difference. First operand 21788 states and 32107 transitions. Second operand 13 states. [2019-09-10 08:41:37,960 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:41:38,138 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:41:38,323 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:41:38,639 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:41:38,885 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:41:39,036 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:41:39,548 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:41:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:39,818 INFO L93 Difference]: Finished difference Result 107734 states and 159177 transitions. [2019-09-10 08:41:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:41:39,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2019-09-10 08:41:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:39,935 INFO L225 Difference]: With dead ends: 107734 [2019-09-10 08:41:39,935 INFO L226 Difference]: Without dead ends: 107734 [2019-09-10 08:41:39,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:41:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107734 states. [2019-09-10 08:41:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107734 to 21771. [2019-09-10 08:41:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-09-10 08:41:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 32087 transitions. [2019-09-10 08:41:40,803 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 32087 transitions. Word has length 148 [2019-09-10 08:41:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:40,803 INFO L475 AbstractCegarLoop]: Abstraction has 21771 states and 32087 transitions. [2019-09-10 08:41:40,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:41:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 32087 transitions. [2019-09-10 08:41:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:41:40,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:40,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:40,805 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1522381227, now seen corresponding path program 1 times [2019-09-10 08:41:40,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:40,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:41,114 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 08:41:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:41:41,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:41,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:41:41,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:41:41,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:41:41,663 INFO L87 Difference]: Start difference. First operand 21771 states and 32087 transitions. Second operand 14 states. [2019-09-10 08:41:42,210 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 08:41:42,382 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:41:42,558 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:41:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:43,085 INFO L93 Difference]: Finished difference Result 43283 states and 63884 transitions. [2019-09-10 08:41:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:41:43,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 148 [2019-09-10 08:41:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:43,122 INFO L225 Difference]: With dead ends: 43283 [2019-09-10 08:41:43,122 INFO L226 Difference]: Without dead ends: 43283 [2019-09-10 08:41:43,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:41:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43283 states. [2019-09-10 08:41:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43283 to 21729. [2019-09-10 08:41:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21729 states. [2019-09-10 08:41:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21729 states to 21729 states and 32037 transitions. [2019-09-10 08:41:43,418 INFO L78 Accepts]: Start accepts. Automaton has 21729 states and 32037 transitions. Word has length 148 [2019-09-10 08:41:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:43,418 INFO L475 AbstractCegarLoop]: Abstraction has 21729 states and 32037 transitions. [2019-09-10 08:41:43,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:41:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21729 states and 32037 transitions. [2019-09-10 08:41:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:41:43,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:43,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:43,419 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1101043701, now seen corresponding path program 1 times [2019-09-10 08:41:43,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:44,565 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:41:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:45,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:45,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 08:41:45,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:45,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:41:45,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:41:45,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:41:45,560 INFO L87 Difference]: Start difference. First operand 21729 states and 32037 transitions. Second operand 29 states. [2019-09-10 08:41:47,282 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:41:47,456 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:41:47,681 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:41:47,915 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 08:41:48,284 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-09-10 08:41:48,683 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-10 08:41:49,167 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2019-09-10 08:41:49,418 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:41:49,637 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:41:49,919 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 08:41:50,121 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:41:50,379 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 08:41:50,754 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:41:51,148 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:41:51,371 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:41:52,211 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 08:41:52,886 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 08:41:54,649 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:41:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:58,904 INFO L93 Difference]: Finished difference Result 160747 states and 237145 transitions. [2019-09-10 08:41:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 08:41:58,904 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 149 [2019-09-10 08:41:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:59,077 INFO L225 Difference]: With dead ends: 160747 [2019-09-10 08:41:59,078 INFO L226 Difference]: Without dead ends: 160747 [2019-09-10 08:41:59,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=784, Invalid=4186, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:41:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160747 states. [2019-09-10 08:41:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160747 to 21713. [2019-09-10 08:41:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21713 states. [2019-09-10 08:42:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21713 states to 21713 states and 32017 transitions. [2019-09-10 08:42:00,016 INFO L78 Accepts]: Start accepts. Automaton has 21713 states and 32017 transitions. Word has length 149 [2019-09-10 08:42:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:00,016 INFO L475 AbstractCegarLoop]: Abstraction has 21713 states and 32017 transitions. [2019-09-10 08:42:00,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:42:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21713 states and 32017 transitions. [2019-09-10 08:42:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:42:00,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:00,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:00,017 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1238459413, now seen corresponding path program 1 times [2019-09-10 08:42:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:00,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:00,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:01,187 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:42:01,457 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:42:02,037 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:42:03,364 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:42:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-09-10 08:42:03,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 08:42:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 08:42:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:42:03,365 INFO L87 Difference]: Start difference. First operand 21713 states and 32017 transitions. Second operand 34 states. [2019-09-10 08:42:03,763 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-10 08:42:04,137 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 08:42:04,302 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-09-10 08:42:04,503 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 08:42:04,745 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:42:05,086 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:42:05,452 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:42:06,303 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-10 08:42:06,781 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 08:42:07,217 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-09-10 08:42:07,691 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-09-10 08:42:08,253 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-09-10 08:42:08,858 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2019-09-10 08:42:09,578 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 93 [2019-09-10 08:42:10,354 WARN L188 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 104 [2019-09-10 08:42:11,399 WARN L188 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 124 [2019-09-10 08:42:12,531 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 184 DAG size of output: 139 [2019-09-10 08:42:12,967 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-09-10 08:42:13,385 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-09-10 08:42:13,628 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:42:14,088 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:42:15,040 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 08:42:16,276 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 08:42:16,575 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:42:16,905 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:42:18,141 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 08:42:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:27,231 INFO L93 Difference]: Finished difference Result 287074 states and 424494 transitions. [2019-09-10 08:42:27,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:42:27,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 149 [2019-09-10 08:42:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:27,559 INFO L225 Difference]: With dead ends: 287074 [2019-09-10 08:42:27,559 INFO L226 Difference]: Without dead ends: 287074 [2019-09-10 08:42:27,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=708, Invalid=3714, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 08:42:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287074 states. [2019-09-10 08:42:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287074 to 21720. [2019-09-10 08:42:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21720 states. [2019-09-10 08:42:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21720 states to 21720 states and 32027 transitions. [2019-09-10 08:42:29,211 INFO L78 Accepts]: Start accepts. Automaton has 21720 states and 32027 transitions. Word has length 149 [2019-09-10 08:42:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:29,212 INFO L475 AbstractCegarLoop]: Abstraction has 21720 states and 32027 transitions. [2019-09-10 08:42:29,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 08:42:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21720 states and 32027 transitions. [2019-09-10 08:42:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:42:29,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:29,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:29,213 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1106185454, now seen corresponding path program 1 times [2019-09-10 08:42:29,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:29,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:30,040 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:42:30,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:30,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:42:30,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:30,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:42:30,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:42:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:42:30,042 INFO L87 Difference]: Start difference. First operand 21720 states and 32027 transitions. Second operand 16 states. [2019-09-10 08:42:30,847 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:42:31,094 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 08:42:31,542 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-10 08:42:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:33,178 INFO L93 Difference]: Finished difference Result 140950 states and 207324 transitions. [2019-09-10 08:42:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:42:33,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 149 [2019-09-10 08:42:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:33,333 INFO L225 Difference]: With dead ends: 140950 [2019-09-10 08:42:33,333 INFO L226 Difference]: Without dead ends: 140950 [2019-09-10 08:42:33,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:42:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140950 states. [2019-09-10 08:42:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140950 to 21712. [2019-09-10 08:42:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21712 states. [2019-09-10 08:42:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21712 states to 21712 states and 32018 transitions. [2019-09-10 08:42:34,256 INFO L78 Accepts]: Start accepts. Automaton has 21712 states and 32018 transitions. Word has length 149 [2019-09-10 08:42:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:34,256 INFO L475 AbstractCegarLoop]: Abstraction has 21712 states and 32018 transitions. [2019-09-10 08:42:34,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:42:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21712 states and 32018 transitions. [2019-09-10 08:42:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:42:34,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:34,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:34,258 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash 632593517, now seen corresponding path program 1 times [2019-09-10 08:42:34,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:34,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:34,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:34,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:42:34,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:34,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:42:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:42:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:42:34,853 INFO L87 Difference]: Start difference. First operand 21712 states and 32018 transitions. Second operand 13 states. [2019-09-10 08:42:35,348 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-09-10 08:42:35,523 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 08:42:35,697 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 08:42:36,041 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 08:42:36,280 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 08:42:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:36,759 INFO L93 Difference]: Finished difference Result 86188 states and 127341 transitions. [2019-09-10 08:42:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:36,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 149 [2019-09-10 08:42:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:36,843 INFO L225 Difference]: With dead ends: 86188 [2019-09-10 08:42:36,843 INFO L226 Difference]: Without dead ends: 86188 [2019-09-10 08:42:36,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:42:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86188 states. [2019-09-10 08:42:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86188 to 21656. [2019-09-10 08:42:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21656 states. [2019-09-10 08:42:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21656 states to 21656 states and 31950 transitions. [2019-09-10 08:42:37,382 INFO L78 Accepts]: Start accepts. Automaton has 21656 states and 31950 transitions. Word has length 149 [2019-09-10 08:42:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:37,382 INFO L475 AbstractCegarLoop]: Abstraction has 21656 states and 31950 transitions. [2019-09-10 08:42:37,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:42:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21656 states and 31950 transitions. [2019-09-10 08:42:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:42:37,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:37,386 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, 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:42:37,386 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash -192986117, now seen corresponding path program 1 times [2019-09-10 08:42:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:37,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:37,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:37,448 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:42:37,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:37,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:37,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:37,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:37,450 INFO L87 Difference]: Start difference. First operand 21656 states and 31950 transitions. Second operand 3 states. [2019-09-10 08:42:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:37,536 INFO L93 Difference]: Finished difference Result 42058 states and 61559 transitions. [2019-09-10 08:42:37,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:37,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:42:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:37,574 INFO L225 Difference]: With dead ends: 42058 [2019-09-10 08:42:37,574 INFO L226 Difference]: Without dead ends: 42058 [2019-09-10 08:42:37,574 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:42:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42058 states. [2019-09-10 08:42:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42058 to 40984. [2019-09-10 08:42:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40984 states. [2019-09-10 08:42:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40984 states to 40984 states and 60218 transitions. [2019-09-10 08:42:38,165 INFO L78 Accepts]: Start accepts. Automaton has 40984 states and 60218 transitions. Word has length 187 [2019-09-10 08:42:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:38,165 INFO L475 AbstractCegarLoop]: Abstraction has 40984 states and 60218 transitions. [2019-09-10 08:42:38,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 40984 states and 60218 transitions. [2019-09-10 08:42:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:42:38,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:38,169 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, 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:42:38,169 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 930092652, now seen corresponding path program 1 times [2019-09-10 08:42:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:38,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:38,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:38,245 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:42:38,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:38,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:38,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:38,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:38,247 INFO L87 Difference]: Start difference. First operand 40984 states and 60218 transitions. Second operand 3 states. [2019-09-10 08:42:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:38,412 INFO L93 Difference]: Finished difference Result 79642 states and 115951 transitions. [2019-09-10 08:42:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:38,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 08:42:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:38,498 INFO L225 Difference]: With dead ends: 79642 [2019-09-10 08:42:38,498 INFO L226 Difference]: Without dead ends: 79642 [2019-09-10 08:42:38,498 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:42:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79642 states. [2019-09-10 08:42:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79642 to 77496. [2019-09-10 08:42:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77496 states. [2019-09-10 08:42:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77496 states to 77496 states and 113270 transitions. [2019-09-10 08:42:39,318 INFO L78 Accepts]: Start accepts. Automaton has 77496 states and 113270 transitions. Word has length 188 [2019-09-10 08:42:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:39,319 INFO L475 AbstractCegarLoop]: Abstraction has 77496 states and 113270 transitions. [2019-09-10 08:42:39,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 77496 states and 113270 transitions. [2019-09-10 08:42:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:42:39,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:39,322 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, 1, 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:42:39,322 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 943469873, now seen corresponding path program 1 times [2019-09-10 08:42:39,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:39,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:39,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:39,406 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:42:39,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:39,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:39,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:39,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:39,408 INFO L87 Difference]: Start difference. First operand 77496 states and 113270 transitions. Second operand 3 states. [2019-09-10 08:42:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:39,658 INFO L93 Difference]: Finished difference Result 106452 states and 154956 transitions. [2019-09-10 08:42:39,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:39,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-10 08:42:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:39,780 INFO L225 Difference]: With dead ends: 106452 [2019-09-10 08:42:39,780 INFO L226 Difference]: Without dead ends: 106452 [2019-09-10 08:42:39,780 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:42:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106452 states. [2019-09-10 08:42:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106452 to 103626. [2019-09-10 08:42:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103626 states. [2019-09-10 08:42:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103626 states to 103626 states and 151072 transitions. [2019-09-10 08:42:40,999 INFO L78 Accepts]: Start accepts. Automaton has 103626 states and 151072 transitions. Word has length 189 [2019-09-10 08:42:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:40,999 INFO L475 AbstractCegarLoop]: Abstraction has 103626 states and 151072 transitions. [2019-09-10 08:42:41,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 103626 states and 151072 transitions. [2019-09-10 08:42:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:42:41,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:41,001 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, 1, 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:42:41,002 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash -715368651, now seen corresponding path program 1 times [2019-09-10 08:42:41,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:41,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:41,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:41,118 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:42:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:41,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:42:41,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:41,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:42:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:42:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:42:41,120 INFO L87 Difference]: Start difference. First operand 103626 states and 151072 transitions. Second operand 7 states. [2019-09-10 08:42:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:42,574 INFO L93 Difference]: Finished difference Result 270416 states and 390491 transitions. [2019-09-10 08:42:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:42:42,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-10 08:42:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:42,976 INFO L225 Difference]: With dead ends: 270416 [2019-09-10 08:42:42,977 INFO L226 Difference]: Without dead ends: 270416 [2019-09-10 08:42:42,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:42:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270416 states. [2019-09-10 08:42:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270416 to 110106. [2019-09-10 08:42:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110106 states. [2019-09-10 08:42:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110106 states to 110106 states and 159712 transitions. [2019-09-10 08:42:44,906 INFO L78 Accepts]: Start accepts. Automaton has 110106 states and 159712 transitions. Word has length 189 [2019-09-10 08:42:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:44,906 INFO L475 AbstractCegarLoop]: Abstraction has 110106 states and 159712 transitions. [2019-09-10 08:42:44,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:42:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 110106 states and 159712 transitions. [2019-09-10 08:42:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:42:44,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:44,908 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, 1, 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:42:44,908 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1342917326, now seen corresponding path program 1 times [2019-09-10 08:42:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:44,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:42:45,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:45,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:42:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:42:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:42:45,023 INFO L87 Difference]: Start difference. First operand 110106 states and 159712 transitions. Second operand 7 states. [2019-09-10 08:42:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:47,249 INFO L93 Difference]: Finished difference Result 494544 states and 708763 transitions. [2019-09-10 08:42:47,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:42:47,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-10 08:42:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:47,914 INFO L225 Difference]: With dead ends: 494544 [2019-09-10 08:42:47,914 INFO L226 Difference]: Without dead ends: 494544 [2019-09-10 08:42:47,914 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:42:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494544 states. [2019-09-10 08:42:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494544 to 234410. [2019-09-10 08:42:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234410 states. [2019-09-10 08:42:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234410 states to 234410 states and 339368 transitions. [2019-09-10 08:42:56,177 INFO L78 Accepts]: Start accepts. Automaton has 234410 states and 339368 transitions. Word has length 189 [2019-09-10 08:42:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:56,178 INFO L475 AbstractCegarLoop]: Abstraction has 234410 states and 339368 transitions. [2019-09-10 08:42:56,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:42:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 234410 states and 339368 transitions. [2019-09-10 08:42:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:42:56,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:56,179 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, 1, 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:42:56,180 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 423393198, now seen corresponding path program 1 times [2019-09-10 08:42:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:56,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:56,335 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:42:56,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:42:56,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:42:56,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-09-10 08:42:56,339 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], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [196], [198], [202], [205], [208], [210], [214], [217], [220], [222], [226], [229], [232], [234], [238], [241], [244], [246], [250], [253], [256], [258], [262], [265], [268], [270], [274], [277], [280], [282], [285], [289], [292], [295], [299], [302], [306], [309], [312], [314], [317], [320], [323], [325], [328], [331], [334], [336], [339], [342], [345], [347], [350], [353], [356], [358], [361], [364], [367], [369], [372], [375], [378], [380], [382], [385], [388], [391], [393], [395], [398], [405], [407], [410], [411], [413], [431], [444], [447], [455], [457], [470], [473], [481], [483], [486], [494], [496], [499], [507], [517], [542], [567], [594], [597], [600], [602], [617], [644], [647], [650], [652], [671], [674], [677], [679], [694], [697], [699], [703], [706], [888], [889], [893], [894], [895] [2019-09-10 08:42:56,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:42:56,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:42:56,653 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:42:57,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:42:57,379 INFO L272 AbstractInterpreter]: Visited 181 different actions 435 times. Merged at 47 different actions 242 times. Widened at 17 different actions 23 times. Performed 1800 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 220 variables. [2019-09-10 08:42:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:57,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:42:57,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:42:57,387 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:42:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:57,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:42:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:57,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:42:57,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:42:57,818 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:42:57,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:42:57,951 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:42:57,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:42:57,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 08:42:57,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:42:57,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:42:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:42:57,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:42:57,969 INFO L87 Difference]: Start difference. First operand 234410 states and 339368 transitions. Second operand 11 states. [2019-09-10 08:43:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:07,677 INFO L93 Difference]: Finished difference Result 728752 states and 1045035 transitions. [2019-09-10 08:43:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:43:07,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2019-09-10 08:43:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:09,359 INFO L225 Difference]: With dead ends: 728752 [2019-09-10 08:43:09,359 INFO L226 Difference]: Without dead ends: 728752 [2019-09-10 08:43:09,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:43:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728752 states. [2019-09-10 08:43:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728752 to 488778. [2019-09-10 08:43:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488778 states. [2019-09-10 08:43:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488778 states to 488778 states and 704440 transitions. [2019-09-10 08:43:17,850 INFO L78 Accepts]: Start accepts. Automaton has 488778 states and 704440 transitions. Word has length 189 [2019-09-10 08:43:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:17,851 INFO L475 AbstractCegarLoop]: Abstraction has 488778 states and 704440 transitions. [2019-09-10 08:43:17,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:43:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 488778 states and 704440 transitions. [2019-09-10 08:43:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:43:17,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:17,853 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, 1, 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:43:17,853 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1825913599, now seen corresponding path program 1 times [2019-09-10 08:43:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:18,080 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:43:18,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:43:18,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:18,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:43:18,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:43:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:43:18,082 INFO L87 Difference]: Start difference. First operand 488778 states and 704440 transitions. Second operand 7 states. [2019-09-10 08:43:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:30,334 INFO L93 Difference]: Finished difference Result 1595536 states and 2268411 transitions. [2019-09-10 08:43:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:43:30,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-10 08:43:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:32,821 INFO L225 Difference]: With dead ends: 1595536 [2019-09-10 08:43:32,822 INFO L226 Difference]: Without dead ends: 1595536 [2019-09-10 08:43:32,822 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:43:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595536 states. [2019-09-10 08:44:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595536 to 1034954. [2019-09-10 08:44:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034954 states. [2019-09-10 08:44:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034954 states to 1034954 states and 1489304 transitions. [2019-09-10 08:44:38,717 INFO L78 Accepts]: Start accepts. Automaton has 1034954 states and 1489304 transitions. Word has length 189 [2019-09-10 08:44:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:38,717 INFO L475 AbstractCegarLoop]: Abstraction has 1034954 states and 1489304 transitions. [2019-09-10 08:44:38,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:44:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1034954 states and 1489304 transitions. [2019-09-10 08:44:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:44:38,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:38,720 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, 1, 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:44:38,720 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:38,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1767222411, now seen corresponding path program 1 times [2019-09-10 08:44:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:38,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:38,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:38,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:38,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:38,892 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:44:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:44:38,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:38,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:44:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:44:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:44:38,895 INFO L87 Difference]: Start difference. First operand 1034954 states and 1489304 transitions. Second operand 7 states. [2019-09-10 08:44:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:56,728 INFO L93 Difference]: Finished difference Result 1717936 states and 2446971 transitions. [2019-09-10 08:44:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:44:56,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-10 08:44:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:00,412 INFO L225 Difference]: With dead ends: 1717936 [2019-09-10 08:45:00,412 INFO L226 Difference]: Without dead ends: 1717936 [2019-09-10 08:45:00,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:45:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717936 states.