java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:01:16,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:16,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:16,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:16,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:16,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:16,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:16,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:16,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:16,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:16,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:16,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:16,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:16,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:16,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:16,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:16,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:16,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:16,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:16,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:16,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:16,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:16,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:16,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:16,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:16,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:16,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:16,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:16,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:16,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:16,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:16,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:16,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:16,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:16,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:16,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:16,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:16,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:16,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:16,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:16,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:16,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:01:16,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:16,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:16,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:16,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:16,421 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:16,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:16,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:16,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:16,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:16,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:16,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:16,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:16,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:16,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:16,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:16,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:16,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:16,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:16,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:16,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:16,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:16,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:16,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:16,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:16,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:16,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:16,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:16,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:16,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:01:16,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:16,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:16,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:16,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:16,711 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:16,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-13 23:01:16,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be6af647/38eb6ff675d143d6888638b3036be8f1/FLAG6538b305f [2019-10-13 23:01:17,347 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:17,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-13 23:01:17,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be6af647/38eb6ff675d143d6888638b3036be8f1/FLAG6538b305f [2019-10-13 23:01:17,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be6af647/38eb6ff675d143d6888638b3036be8f1 [2019-10-13 23:01:17,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:17,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:17,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:17,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:17,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:17,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:17" (1/1) ... [2019-10-13 23:01:17,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6bfa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:17, skipping insertion in model container [2019-10-13 23:01:17,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:17" (1/1) ... [2019-10-13 23:01:17,621 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:17,680 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:18,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:18,144 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:18,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:18,319 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:18,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18 WrapperNode [2019-10-13 23:01:18,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:18,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:18,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:18,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:18,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:18,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:18,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:18,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:18,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (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-10-13 23:01:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-13 23:01:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-13 23:01:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-13 23:01:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-13 23:01:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-13 23:01:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-13 23:01:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-13 23:01:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-13 23:01:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-13 23:01:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-13 23:01:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-13 23:01:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-13 23:01:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-13 23:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-13 23:01:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-13 23:01:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-13 23:01:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-13 23:01:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:18,889 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,949 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:18,949 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:18,959 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,974 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:18,974 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:18,982 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,314 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-13 23:01:19,314 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-13 23:01:19,319 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,423 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-13 23:01:19,423 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-13 23:01:19,435 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,451 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:19,451 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:19,549 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,556 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,556 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:19,557 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,563 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,564 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:19,564 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,578 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,578 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:19,618 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,651 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-13 23:01:19,651 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-13 23:01:19,654 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,783 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-13 23:01:19,784 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-13 23:01:19,822 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,828 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,829 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:19,829 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,842 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,842 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:19,843 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:19,851 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:19,851 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:20,286 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:20,287 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:01:20,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:20 BoogieIcfgContainer [2019-10-13 23:01:20,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:20,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:20,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:20,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:20,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:17" (1/3) ... [2019-10-13 23:01:20,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f43ba01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:20, skipping insertion in model container [2019-10-13 23:01:20,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (2/3) ... [2019-10-13 23:01:20,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f43ba01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:20, skipping insertion in model container [2019-10-13 23:01:20,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:20" (3/3) ... [2019-10-13 23:01:20,296 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-13 23:01:20,306 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:20,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:20,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:20,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:20,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:20,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:20,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:20,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:20,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:20,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:20,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-10-13 23:01:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:01:20,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1462923013, now seen corresponding path program 1 times [2019-10-13 23:01:20,435 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896995368] [2019-10-13 23:01:20,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,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-10-13 23:01:20,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896995368] [2019-10-13 23:01:20,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:20,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251698475] [2019-10-13 23:01:20,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:20,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,812 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-10-13 23:01:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,078 INFO L93 Difference]: Finished difference Result 591 states and 867 transitions. [2019-10-13 23:01:21,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 23:01:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,097 INFO L225 Difference]: With dead ends: 591 [2019-10-13 23:01:21,097 INFO L226 Difference]: Without dead ends: 383 [2019-10-13 23:01:21,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-13 23:01:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2019-10-13 23:01:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-13 23:01:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 486 transitions. [2019-10-13 23:01:21,184 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 486 transitions. Word has length 21 [2019-10-13 23:01:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,185 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 486 transitions. [2019-10-13 23:01:21,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 486 transitions. [2019-10-13 23:01:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:21,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,188 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash 738687115, now seen corresponding path program 1 times [2019-10-13 23:01:21,188 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602547817] [2019-10-13 23:01:21,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602547817] [2019-10-13 23:01:21,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161846887] [2019-10-13 23:01:21,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,253 INFO L87 Difference]: Start difference. First operand 366 states and 486 transitions. Second operand 3 states. [2019-10-13 23:01:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,286 INFO L93 Difference]: Finished difference Result 384 states and 509 transitions. [2019-10-13 23:01:21,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,290 INFO L225 Difference]: With dead ends: 384 [2019-10-13 23:01:21,290 INFO L226 Difference]: Without dead ends: 366 [2019-10-13 23:01:21,292 INFO L600 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-10-13 23:01:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-13 23:01:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-10-13 23:01:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-13 23:01:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2019-10-13 23:01:21,322 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 18 [2019-10-13 23:01:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,322 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2019-10-13 23:01:21,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2019-10-13 23:01:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 23:01:21,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,324 INFO L380 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] [2019-10-13 23:01:21,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1792373602, now seen corresponding path program 1 times [2019-10-13 23:01:21,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313436357] [2019-10-13 23:01:21,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313436357] [2019-10-13 23:01:21,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673174566] [2019-10-13 23:01:21,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,459 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand 3 states. [2019-10-13 23:01:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,505 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2019-10-13 23:01:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 23:01:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,509 INFO L225 Difference]: With dead ends: 462 [2019-10-13 23:01:21,509 INFO L226 Difference]: Without dead ends: 443 [2019-10-13 23:01:21,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 23:01:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-13 23:01:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2019-10-13 23:01:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-13 23:01:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2019-10-13 23:01:21,545 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 26 [2019-10-13 23:01:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,545 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2019-10-13 23:01:21,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2019-10-13 23:01:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 23:01:21,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,551 INFO L380 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] [2019-10-13 23:01:21,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1021087200, now seen corresponding path program 1 times [2019-10-13 23:01:21,553 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692246717] [2019-10-13 23:01:21,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692246717] [2019-10-13 23:01:21,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208160007] [2019-10-13 23:01:21,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,634 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2019-10-13 23:01:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,680 INFO L93 Difference]: Finished difference Result 753 states and 984 transitions. [2019-10-13 23:01:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 23:01:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,684 INFO L225 Difference]: With dead ends: 753 [2019-10-13 23:01:21,684 INFO L226 Difference]: Without dead ends: 560 [2019-10-13 23:01:21,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 23:01:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-13 23:01:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 534. [2019-10-13 23:01:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 23:01:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 705 transitions. [2019-10-13 23:01:21,714 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 705 transitions. Word has length 27 [2019-10-13 23:01:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,715 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 705 transitions. [2019-10-13 23:01:21,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 705 transitions. [2019-10-13 23:01:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:01:21,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,717 INFO L380 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] [2019-10-13 23:01:21,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 576858905, now seen corresponding path program 1 times [2019-10-13 23:01:21,718 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807905162] [2019-10-13 23:01:21,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807905162] [2019-10-13 23:01:21,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923686205] [2019-10-13 23:01:21,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,830 INFO L87 Difference]: Start difference. First operand 534 states and 705 transitions. Second operand 3 states. [2019-10-13 23:01:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,917 INFO L93 Difference]: Finished difference Result 543 states and 716 transitions. [2019-10-13 23:01:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 23:01:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,921 INFO L225 Difference]: With dead ends: 543 [2019-10-13 23:01:21,921 INFO L226 Difference]: Without dead ends: 540 [2019-10-13 23:01:21,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 23:01:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-13 23:01:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-13 23:01:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-13 23:01:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 712 transitions. [2019-10-13 23:01:21,948 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 712 transitions. Word has length 32 [2019-10-13 23:01:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 712 transitions. [2019-10-13 23:01:21,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 712 transitions. [2019-10-13 23:01:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 23:01:21,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,950 INFO L380 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] [2019-10-13 23:01:21,950 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 693216730, now seen corresponding path program 1 times [2019-10-13 23:01:21,951 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576372016] [2019-10-13 23:01:21,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576372016] [2019-10-13 23:01:21,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175481568] [2019-10-13 23:01:21,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,986 INFO L87 Difference]: Start difference. First operand 540 states and 712 transitions. Second operand 3 states. [2019-10-13 23:01:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,060 INFO L93 Difference]: Finished difference Result 572 states and 748 transitions. [2019-10-13 23:01:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:22,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 23:01:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,064 INFO L225 Difference]: With dead ends: 572 [2019-10-13 23:01:22,064 INFO L226 Difference]: Without dead ends: 567 [2019-10-13 23:01:22,065 INFO L600 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-10-13 23:01:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-13 23:01:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2019-10-13 23:01:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-13 23:01:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 741 transitions. [2019-10-13 23:01:22,089 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 741 transitions. Word has length 33 [2019-10-13 23:01:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,089 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 741 transitions. [2019-10-13 23:01:22,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 741 transitions. [2019-10-13 23:01:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 23:01:22,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,091 INFO L380 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] [2019-10-13 23:01:22,091 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 466530989, now seen corresponding path program 1 times [2019-10-13 23:01:22,092 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278473749] [2019-10-13 23:01:22,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278473749] [2019-10-13 23:01:22,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:22,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072721077] [2019-10-13 23:01:22,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:22,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:22,139 INFO L87 Difference]: Start difference. First operand 565 states and 741 transitions. Second operand 5 states. [2019-10-13 23:01:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,206 INFO L93 Difference]: Finished difference Result 578 states and 755 transitions. [2019-10-13 23:01:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:22,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-13 23:01:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,212 INFO L225 Difference]: With dead ends: 578 [2019-10-13 23:01:22,212 INFO L226 Difference]: Without dead ends: 563 [2019-10-13 23:01:22,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-13 23:01:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-13 23:01:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-13 23:01:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 23:01:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 737 transitions. [2019-10-13 23:01:22,250 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 737 transitions. Word has length 34 [2019-10-13 23:01:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,250 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 737 transitions. [2019-10-13 23:01:22,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 737 transitions. [2019-10-13 23:01:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:22,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,256 INFO L380 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] [2019-10-13 23:01:22,256 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2017596672, now seen corresponding path program 1 times [2019-10-13 23:01:22,257 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626642818] [2019-10-13 23:01:22,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626642818] [2019-10-13 23:01:22,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:22,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348735243] [2019-10-13 23:01:22,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:22,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:22,323 INFO L87 Difference]: Start difference. First operand 563 states and 737 transitions. Second operand 5 states. [2019-10-13 23:01:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,370 INFO L93 Difference]: Finished difference Result 576 states and 751 transitions. [2019-10-13 23:01:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:22,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-13 23:01:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,376 INFO L225 Difference]: With dead ends: 576 [2019-10-13 23:01:22,376 INFO L226 Difference]: Without dead ends: 557 [2019-10-13 23:01:22,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-13 23:01:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-13 23:01:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-13 23:01:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-13 23:01:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 729 transitions. [2019-10-13 23:01:22,427 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 729 transitions. Word has length 35 [2019-10-13 23:01:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,427 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 729 transitions. [2019-10-13 23:01:22,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 729 transitions. [2019-10-13 23:01:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:01:22,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,432 INFO L380 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] [2019-10-13 23:01:22,432 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1856256589, now seen corresponding path program 1 times [2019-10-13 23:01:22,433 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299596343] [2019-10-13 23:01:22,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299596343] [2019-10-13 23:01:22,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:22,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287998853] [2019-10-13 23:01:22,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:22,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:22,498 INFO L87 Difference]: Start difference. First operand 557 states and 729 transitions. Second operand 3 states. [2019-10-13 23:01:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,613 INFO L93 Difference]: Finished difference Result 713 states and 945 transitions. [2019-10-13 23:01:22,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:22,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-13 23:01:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,618 INFO L225 Difference]: With dead ends: 713 [2019-10-13 23:01:22,619 INFO L226 Difference]: Without dead ends: 710 [2019-10-13 23:01:22,619 INFO L600 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-10-13 23:01:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-13 23:01:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 603. [2019-10-13 23:01:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 23:01:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 793 transitions. [2019-10-13 23:01:22,648 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 793 transitions. Word has length 38 [2019-10-13 23:01:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,650 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 793 transitions. [2019-10-13 23:01:22,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 793 transitions. [2019-10-13 23:01:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 23:01:22,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,652 INFO L380 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] [2019-10-13 23:01:22,653 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1471321743, now seen corresponding path program 1 times [2019-10-13 23:01:22,653 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561478334] [2019-10-13 23:01:22,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561478334] [2019-10-13 23:01:22,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:22,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448936637] [2019-10-13 23:01:22,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:22,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:22,775 INFO L87 Difference]: Start difference. First operand 603 states and 793 transitions. Second operand 8 states. [2019-10-13 23:01:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,626 INFO L93 Difference]: Finished difference Result 792 states and 1035 transitions. [2019-10-13 23:01:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:23,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-13 23:01:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,631 INFO L225 Difference]: With dead ends: 792 [2019-10-13 23:01:23,631 INFO L226 Difference]: Without dead ends: 723 [2019-10-13 23:01:23,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-13 23:01:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 597. [2019-10-13 23:01:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-13 23:01:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 779 transitions. [2019-10-13 23:01:23,662 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 779 transitions. Word has length 39 [2019-10-13 23:01:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,662 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 779 transitions. [2019-10-13 23:01:23,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 779 transitions. [2019-10-13 23:01:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 23:01:23,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,664 INFO L380 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] [2019-10-13 23:01:23,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash -58105418, now seen corresponding path program 1 times [2019-10-13 23:01:23,665 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606584338] [2019-10-13 23:01:23,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606584338] [2019-10-13 23:01:23,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:23,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725552995] [2019-10-13 23:01:23,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:23,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:23,717 INFO L87 Difference]: Start difference. First operand 597 states and 779 transitions. Second operand 4 states. [2019-10-13 23:01:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,770 INFO L93 Difference]: Finished difference Result 625 states and 812 transitions. [2019-10-13 23:01:23,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:23,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-13 23:01:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,774 INFO L225 Difference]: With dead ends: 625 [2019-10-13 23:01:23,774 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 23:01:23,775 INFO L600 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-10-13 23:01:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 23:01:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2019-10-13 23:01:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 781 transitions. [2019-10-13 23:01:23,804 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 781 transitions. Word has length 37 [2019-10-13 23:01:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 781 transitions. [2019-10-13 23:01:23,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 781 transitions. [2019-10-13 23:01:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 23:01:23,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,806 INFO L380 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] [2019-10-13 23:01:23,806 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 898299433, now seen corresponding path program 1 times [2019-10-13 23:01:23,807 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807508635] [2019-10-13 23:01:23,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807508635] [2019-10-13 23:01:23,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:23,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077311055] [2019-10-13 23:01:23,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:23,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:23,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:23,887 INFO L87 Difference]: Start difference. First operand 599 states and 781 transitions. Second operand 8 states. [2019-10-13 23:01:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,502 INFO L93 Difference]: Finished difference Result 621 states and 803 transitions. [2019-10-13 23:01:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:24,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-13 23:01:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,506 INFO L225 Difference]: With dead ends: 621 [2019-10-13 23:01:24,506 INFO L226 Difference]: Without dead ends: 615 [2019-10-13 23:01:24,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-13 23:01:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-13 23:01:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 780 transitions. [2019-10-13 23:01:24,538 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 780 transitions. Word has length 39 [2019-10-13 23:01:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 780 transitions. [2019-10-13 23:01:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 780 transitions. [2019-10-13 23:01:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:24,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,540 INFO L380 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] [2019-10-13 23:01:24,540 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1216858283, now seen corresponding path program 1 times [2019-10-13 23:01:24,541 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499738433] [2019-10-13 23:01:24,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:24,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499738433] [2019-10-13 23:01:24,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:24,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:24,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219206295] [2019-10-13 23:01:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:24,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:24,607 INFO L87 Difference]: Start difference. First operand 599 states and 780 transitions. Second operand 8 states. [2019-10-13 23:01:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,163 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2019-10-13 23:01:25,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:25,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-10-13 23:01:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,168 INFO L225 Difference]: With dead ends: 621 [2019-10-13 23:01:25,168 INFO L226 Difference]: Without dead ends: 615 [2019-10-13 23:01:25,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-13 23:01:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-13 23:01:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 779 transitions. [2019-10-13 23:01:25,198 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 779 transitions. Word has length 40 [2019-10-13 23:01:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,198 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 779 transitions. [2019-10-13 23:01:25,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 779 transitions. [2019-10-13 23:01:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:25,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,200 INFO L380 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] [2019-10-13 23:01:25,200 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1560994504, now seen corresponding path program 1 times [2019-10-13 23:01:25,201 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538715866] [2019-10-13 23:01:25,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538715866] [2019-10-13 23:01:25,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:25,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637362318] [2019-10-13 23:01:25,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:25,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:25,243 INFO L87 Difference]: Start difference. First operand 599 states and 779 transitions. Second operand 3 states. [2019-10-13 23:01:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,284 INFO L93 Difference]: Finished difference Result 639 states and 826 transitions. [2019-10-13 23:01:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:25,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-13 23:01:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,288 INFO L225 Difference]: With dead ends: 639 [2019-10-13 23:01:25,288 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 23:01:25,289 INFO L600 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-10-13 23:01:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 23:01:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2019-10-13 23:01:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-13 23:01:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 744 transitions. [2019-10-13 23:01:25,370 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 744 transitions. Word has length 40 [2019-10-13 23:01:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,371 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 744 transitions. [2019-10-13 23:01:25,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2019-10-13 23:01:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:25,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,372 INFO L380 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] [2019-10-13 23:01:25,373 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -848551918, now seen corresponding path program 1 times [2019-10-13 23:01:25,373 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888698216] [2019-10-13 23:01:25,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888698216] [2019-10-13 23:01:25,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:25,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394633424] [2019-10-13 23:01:25,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:25,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:25,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:25,419 INFO L87 Difference]: Start difference. First operand 573 states and 744 transitions. Second operand 5 states. [2019-10-13 23:01:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,462 INFO L93 Difference]: Finished difference Result 589 states and 759 transitions. [2019-10-13 23:01:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:25,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 23:01:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,466 INFO L225 Difference]: With dead ends: 589 [2019-10-13 23:01:25,466 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 23:01:25,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 23:01:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 23:01:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 23:01:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 740 transitions. [2019-10-13 23:01:25,495 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 740 transitions. Word has length 41 [2019-10-13 23:01:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,496 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 740 transitions. [2019-10-13 23:01:25,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 740 transitions. [2019-10-13 23:01:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:25,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,498 INFO L380 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] [2019-10-13 23:01:25,498 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1321910963, now seen corresponding path program 1 times [2019-10-13 23:01:25,498 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717985013] [2019-10-13 23:01:25,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717985013] [2019-10-13 23:01:25,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:25,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398433849] [2019-10-13 23:01:25,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:25,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:25,548 INFO L87 Difference]: Start difference. First operand 571 states and 740 transitions. Second operand 4 states. [2019-10-13 23:01:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,727 INFO L93 Difference]: Finished difference Result 621 states and 784 transitions. [2019-10-13 23:01:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:25,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-13 23:01:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,730 INFO L225 Difference]: With dead ends: 621 [2019-10-13 23:01:25,730 INFO L226 Difference]: Without dead ends: 432 [2019-10-13 23:01:25,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-10-13 23:01:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2019-10-13 23:01:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-13 23:01:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 516 transitions. [2019-10-13 23:01:25,756 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 516 transitions. Word has length 43 [2019-10-13 23:01:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,756 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 516 transitions. [2019-10-13 23:01:25,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 516 transitions. [2019-10-13 23:01:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:25,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,759 INFO L380 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] [2019-10-13 23:01:25,759 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash -360854459, now seen corresponding path program 1 times [2019-10-13 23:01:25,760 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387426216] [2019-10-13 23:01:25,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387426216] [2019-10-13 23:01:25,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:25,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516504674] [2019-10-13 23:01:25,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:25,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:25,814 INFO L87 Difference]: Start difference. First operand 413 states and 516 transitions. Second operand 5 states. [2019-10-13 23:01:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,856 INFO L93 Difference]: Finished difference Result 429 states and 531 transitions. [2019-10-13 23:01:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:25,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 23:01:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,859 INFO L225 Difference]: With dead ends: 429 [2019-10-13 23:01:25,860 INFO L226 Difference]: Without dead ends: 411 [2019-10-13 23:01:25,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-13 23:01:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-13 23:01:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 23:01:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 512 transitions. [2019-10-13 23:01:25,881 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 512 transitions. Word has length 41 [2019-10-13 23:01:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,881 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 512 transitions. [2019-10-13 23:01:25,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 512 transitions. [2019-10-13 23:01:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:25,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,883 INFO L380 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] [2019-10-13 23:01:25,883 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1939669222, now seen corresponding path program 1 times [2019-10-13 23:01:25,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609050484] [2019-10-13 23:01:25,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609050484] [2019-10-13 23:01:25,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:25,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408178024] [2019-10-13 23:01:25,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:25,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:25,926 INFO L87 Difference]: Start difference. First operand 411 states and 512 transitions. Second operand 3 states. [2019-10-13 23:01:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,032 INFO L93 Difference]: Finished difference Result 566 states and 717 transitions. [2019-10-13 23:01:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:26,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:01:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,036 INFO L225 Difference]: With dead ends: 566 [2019-10-13 23:01:26,036 INFO L226 Difference]: Without dead ends: 542 [2019-10-13 23:01:26,037 INFO L600 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-10-13 23:01:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-13 23:01:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2019-10-13 23:01:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-13 23:01:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 555 transitions. [2019-10-13 23:01:26,068 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 555 transitions. Word has length 43 [2019-10-13 23:01:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,069 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 555 transitions. [2019-10-13 23:01:26,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 555 transitions. [2019-10-13 23:01:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:26,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,071 INFO L380 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] [2019-10-13 23:01:26,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1952247639, now seen corresponding path program 1 times [2019-10-13 23:01:26,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501572912] [2019-10-13 23:01:26,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501572912] [2019-10-13 23:01:26,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:26,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711467305] [2019-10-13 23:01:26,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:26,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:26,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:26,142 INFO L87 Difference]: Start difference. First operand 445 states and 555 transitions. Second operand 3 states. [2019-10-13 23:01:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,233 INFO L93 Difference]: Finished difference Result 626 states and 787 transitions. [2019-10-13 23:01:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:26,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-13 23:01:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,239 INFO L225 Difference]: With dead ends: 626 [2019-10-13 23:01:26,239 INFO L226 Difference]: Without dead ends: 448 [2019-10-13 23:01:26,240 INFO L600 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-10-13 23:01:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-13 23:01:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-13 23:01:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-13 23:01:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 559 transitions. [2019-10-13 23:01:26,262 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 559 transitions. Word has length 51 [2019-10-13 23:01:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,262 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 559 transitions. [2019-10-13 23:01:26,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 559 transitions. [2019-10-13 23:01:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:26,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,264 INFO L380 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] [2019-10-13 23:01:26,264 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 452129407, now seen corresponding path program 1 times [2019-10-13 23:01:26,265 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316234803] [2019-10-13 23:01:26,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316234803] [2019-10-13 23:01:26,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:26,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723071521] [2019-10-13 23:01:26,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:26,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:26,336 INFO L87 Difference]: Start difference. First operand 448 states and 559 transitions. Second operand 8 states. [2019-10-13 23:01:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,497 INFO L93 Difference]: Finished difference Result 478 states and 593 transitions. [2019-10-13 23:01:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:26,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-13 23:01:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,501 INFO L225 Difference]: With dead ends: 478 [2019-10-13 23:01:26,501 INFO L226 Difference]: Without dead ends: 474 [2019-10-13 23:01:26,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-13 23:01:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2019-10-13 23:01:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 23:01:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 580 transitions. [2019-10-13 23:01:26,524 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 580 transitions. Word has length 44 [2019-10-13 23:01:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,524 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 580 transitions. [2019-10-13 23:01:26,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 580 transitions. [2019-10-13 23:01:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:26,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,526 INFO L380 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] [2019-10-13 23:01:26,526 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 451852577, now seen corresponding path program 1 times [2019-10-13 23:01:26,527 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438535574] [2019-10-13 23:01:26,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438535574] [2019-10-13 23:01:26,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:26,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914985574] [2019-10-13 23:01:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:26,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:26,666 INFO L87 Difference]: Start difference. First operand 466 states and 580 transitions. Second operand 10 states. [2019-10-13 23:01:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,276 INFO L93 Difference]: Finished difference Result 568 states and 718 transitions. [2019-10-13 23:01:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:28,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-13 23:01:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,280 INFO L225 Difference]: With dead ends: 568 [2019-10-13 23:01:28,280 INFO L226 Difference]: Without dead ends: 552 [2019-10-13 23:01:28,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-13 23:01:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 479. [2019-10-13 23:01:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-13 23:01:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 594 transitions. [2019-10-13 23:01:28,308 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 594 transitions. Word has length 44 [2019-10-13 23:01:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,308 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 594 transitions. [2019-10-13 23:01:28,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 594 transitions. [2019-10-13 23:01:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:28,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,310 INFO L380 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] [2019-10-13 23:01:28,310 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1045295946, now seen corresponding path program 1 times [2019-10-13 23:01:28,311 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157664370] [2019-10-13 23:01:28,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:28,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157664370] [2019-10-13 23:01:28,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:28,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387714636] [2019-10-13 23:01:28,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:28,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:28,388 INFO L87 Difference]: Start difference. First operand 479 states and 594 transitions. Second operand 7 states. [2019-10-13 23:01:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,038 INFO L93 Difference]: Finished difference Result 569 states and 702 transitions. [2019-10-13 23:01:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:29,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-13 23:01:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,044 INFO L225 Difference]: With dead ends: 569 [2019-10-13 23:01:29,044 INFO L226 Difference]: Without dead ends: 498 [2019-10-13 23:01:29,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-13 23:01:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2019-10-13 23:01:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 23:01:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 606 transitions. [2019-10-13 23:01:29,073 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 606 transitions. Word has length 44 [2019-10-13 23:01:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,073 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 606 transitions. [2019-10-13 23:01:29,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 606 transitions. [2019-10-13 23:01:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:01:29,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,075 INFO L380 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] [2019-10-13 23:01:29,075 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1960933712, now seen corresponding path program 1 times [2019-10-13 23:01:29,076 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361003346] [2019-10-13 23:01:29,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361003346] [2019-10-13 23:01:29,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:29,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000478028] [2019-10-13 23:01:29,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:29,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:29,201 INFO L87 Difference]: Start difference. First operand 490 states and 606 transitions. Second operand 7 states. [2019-10-13 23:01:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,383 INFO L93 Difference]: Finished difference Result 508 states and 623 transitions. [2019-10-13 23:01:29,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:29,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-10-13 23:01:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,387 INFO L225 Difference]: With dead ends: 508 [2019-10-13 23:01:29,387 INFO L226 Difference]: Without dead ends: 487 [2019-10-13 23:01:29,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-13 23:01:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-10-13 23:01:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-13 23:01:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 589 transitions. [2019-10-13 23:01:29,416 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 589 transitions. Word has length 45 [2019-10-13 23:01:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,416 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 589 transitions. [2019-10-13 23:01:29,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 589 transitions. [2019-10-13 23:01:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:01:29,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,418 INFO L380 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] [2019-10-13 23:01:29,418 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash -519110175, now seen corresponding path program 1 times [2019-10-13 23:01:29,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795931753] [2019-10-13 23:01:29,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795931753] [2019-10-13 23:01:29,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:29,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179930910] [2019-10-13 23:01:29,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:29,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:29,460 INFO L87 Difference]: Start difference. First operand 485 states and 589 transitions. Second operand 3 states. [2019-10-13 23:01:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,547 INFO L93 Difference]: Finished difference Result 569 states and 692 transitions. [2019-10-13 23:01:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:29,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 23:01:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,550 INFO L225 Difference]: With dead ends: 569 [2019-10-13 23:01:29,550 INFO L226 Difference]: Without dead ends: 516 [2019-10-13 23:01:29,551 INFO L600 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-10-13 23:01:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-13 23:01:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2019-10-13 23:01:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-13 23:01:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 573 transitions. [2019-10-13 23:01:29,579 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 573 transitions. Word has length 45 [2019-10-13 23:01:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,579 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 573 transitions. [2019-10-13 23:01:29,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 573 transitions. [2019-10-13 23:01:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:01:29,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,581 INFO L380 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] [2019-10-13 23:01:29,581 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -706098147, now seen corresponding path program 1 times [2019-10-13 23:01:29,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416826922] [2019-10-13 23:01:29,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416826922] [2019-10-13 23:01:29,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:29,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550101065] [2019-10-13 23:01:29,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:29,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:29,718 INFO L87 Difference]: Start difference. First operand 467 states and 573 transitions. Second operand 5 states. [2019-10-13 23:01:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,757 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2019-10-13 23:01:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:29,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-13 23:01:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,760 INFO L225 Difference]: With dead ends: 645 [2019-10-13 23:01:29,760 INFO L226 Difference]: Without dead ends: 435 [2019-10-13 23:01:29,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-13 23:01:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-13 23:01:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-13 23:01:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 526 transitions. [2019-10-13 23:01:29,788 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 526 transitions. Word has length 53 [2019-10-13 23:01:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,788 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 526 transitions. [2019-10-13 23:01:29,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 526 transitions. [2019-10-13 23:01:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:01:29,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,791 INFO L380 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] [2019-10-13 23:01:29,791 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1539102598, now seen corresponding path program 1 times [2019-10-13 23:01:29,792 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960158041] [2019-10-13 23:01:29,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960158041] [2019-10-13 23:01:29,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:29,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823650521] [2019-10-13 23:01:29,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:29,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:29,866 INFO L87 Difference]: Start difference. First operand 435 states and 526 transitions. Second operand 5 states. [2019-10-13 23:01:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,177 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2019-10-13 23:01:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:30,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-13 23:01:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,180 INFO L225 Difference]: With dead ends: 449 [2019-10-13 23:01:30,180 INFO L226 Difference]: Without dead ends: 431 [2019-10-13 23:01:30,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-13 23:01:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-13 23:01:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-13 23:01:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-13 23:01:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2019-10-13 23:01:30,208 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 46 [2019-10-13 23:01:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,209 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2019-10-13 23:01:30,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2019-10-13 23:01:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:30,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,211 INFO L380 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] [2019-10-13 23:01:30,211 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1827396325, now seen corresponding path program 1 times [2019-10-13 23:01:30,211 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980525398] [2019-10-13 23:01:30,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980525398] [2019-10-13 23:01:30,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:30,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136853435] [2019-10-13 23:01:30,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:30,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:30,279 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand 8 states. [2019-10-13 23:01:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,342 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-13 23:01:30,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:30,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-13 23:01:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,345 INFO L225 Difference]: With dead ends: 436 [2019-10-13 23:01:30,345 INFO L226 Difference]: Without dead ends: 412 [2019-10-13 23:01:30,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-10-13 23:01:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-10-13 23:01:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-13 23:01:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 499 transitions. [2019-10-13 23:01:30,379 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 499 transitions. Word has length 47 [2019-10-13 23:01:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,380 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 499 transitions. [2019-10-13 23:01:30,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 499 transitions. [2019-10-13 23:01:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:30,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,381 INFO L380 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] [2019-10-13 23:01:30,382 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 358397846, now seen corresponding path program 1 times [2019-10-13 23:01:30,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615984223] [2019-10-13 23:01:30,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615984223] [2019-10-13 23:01:30,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:30,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338471292] [2019-10-13 23:01:30,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:30,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:30,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:30,458 INFO L87 Difference]: Start difference. First operand 412 states and 499 transitions. Second operand 8 states. [2019-10-13 23:01:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,657 INFO L93 Difference]: Finished difference Result 435 states and 522 transitions. [2019-10-13 23:01:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:30,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-13 23:01:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,660 INFO L225 Difference]: With dead ends: 435 [2019-10-13 23:01:30,660 INFO L226 Difference]: Without dead ends: 407 [2019-10-13 23:01:30,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-13 23:01:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-13 23:01:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-13 23:01:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 491 transitions. [2019-10-13 23:01:30,684 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 491 transitions. Word has length 47 [2019-10-13 23:01:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 491 transitions. [2019-10-13 23:01:30,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 491 transitions. [2019-10-13 23:01:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:30,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,686 INFO L380 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] [2019-10-13 23:01:30,687 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -933816145, now seen corresponding path program 1 times [2019-10-13 23:01:30,687 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935854184] [2019-10-13 23:01:30,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935854184] [2019-10-13 23:01:30,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:30,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621716532] [2019-10-13 23:01:30,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:30,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:30,739 INFO L87 Difference]: Start difference. First operand 407 states and 491 transitions. Second operand 6 states. [2019-10-13 23:01:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,785 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-13 23:01:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:30,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-13 23:01:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,787 INFO L225 Difference]: With dead ends: 436 [2019-10-13 23:01:30,788 INFO L226 Difference]: Without dead ends: 409 [2019-10-13 23:01:30,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-13 23:01:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-13 23:01:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:01:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 493 transitions. [2019-10-13 23:01:30,815 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 493 transitions. Word has length 47 [2019-10-13 23:01:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,815 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 493 transitions. [2019-10-13 23:01:30,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 493 transitions. [2019-10-13 23:01:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:01:30,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,816 INFO L380 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] [2019-10-13 23:01:30,817 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash 971008662, now seen corresponding path program 1 times [2019-10-13 23:01:30,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047721285] [2019-10-13 23:01:30,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047721285] [2019-10-13 23:01:30,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:30,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795007740] [2019-10-13 23:01:30,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:30,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:30,887 INFO L87 Difference]: Start difference. First operand 409 states and 493 transitions. Second operand 5 states. [2019-10-13 23:01:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,152 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-10-13 23:01:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:31,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-13 23:01:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,155 INFO L225 Difference]: With dead ends: 587 [2019-10-13 23:01:31,155 INFO L226 Difference]: Without dead ends: 409 [2019-10-13 23:01:31,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-13 23:01:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-13 23:01:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:01:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-13 23:01:31,188 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 57 [2019-10-13 23:01:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,188 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-13 23:01:31,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-13 23:01:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:01:31,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,190 INFO L380 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] [2019-10-13 23:01:31,190 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -550061814, now seen corresponding path program 1 times [2019-10-13 23:01:31,190 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151769989] [2019-10-13 23:01:31,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:31,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151769989] [2019-10-13 23:01:31,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:31,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031587838] [2019-10-13 23:01:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:31,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:31,316 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 7 states. [2019-10-13 23:01:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,713 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2019-10-13 23:01:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:31,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-13 23:01:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,716 INFO L225 Difference]: With dead ends: 428 [2019-10-13 23:01:31,717 INFO L226 Difference]: Without dead ends: 425 [2019-10-13 23:01:31,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-10-13 23:01:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2019-10-13 23:01:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:01:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-13 23:01:31,759 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 58 [2019-10-13 23:01:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,760 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-13 23:01:31,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-13 23:01:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:31,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,764 INFO L380 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] [2019-10-13 23:01:31,765 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 815295926, now seen corresponding path program 1 times [2019-10-13 23:01:31,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238056176] [2019-10-13 23:01:31,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:31,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238056176] [2019-10-13 23:01:31,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:31,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387161234] [2019-10-13 23:01:31,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:31,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:31,899 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 9 states. [2019-10-13 23:01:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,125 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2019-10-13 23:01:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:32,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-13 23:01:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,128 INFO L225 Difference]: With dead ends: 434 [2019-10-13 23:01:32,128 INFO L226 Difference]: Without dead ends: 404 [2019-10-13 23:01:32,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-13 23:01:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-13 23:01:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-13 23:01:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 484 transitions. [2019-10-13 23:01:32,192 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 484 transitions. Word has length 50 [2019-10-13 23:01:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,193 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 484 transitions. [2019-10-13 23:01:32,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 484 transitions. [2019-10-13 23:01:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:32,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,194 INFO L380 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] [2019-10-13 23:01:32,194 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 298589759, now seen corresponding path program 1 times [2019-10-13 23:01:32,195 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653149978] [2019-10-13 23:01:32,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653149978] [2019-10-13 23:01:32,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:32,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860251241] [2019-10-13 23:01:32,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:32,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:32,269 INFO L87 Difference]: Start difference. First operand 404 states and 484 transitions. Second operand 9 states. [2019-10-13 23:01:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,436 INFO L93 Difference]: Finished difference Result 429 states and 509 transitions. [2019-10-13 23:01:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:32,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-13 23:01:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,439 INFO L225 Difference]: With dead ends: 429 [2019-10-13 23:01:32,439 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 23:01:32,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 23:01:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-13 23:01:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-13 23:01:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 476 transitions. [2019-10-13 23:01:32,467 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 476 transitions. Word has length 50 [2019-10-13 23:01:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,467 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 476 transitions. [2019-10-13 23:01:32,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 476 transitions. [2019-10-13 23:01:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:01:32,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,469 INFO L380 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] [2019-10-13 23:01:32,469 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 211621434, now seen corresponding path program 1 times [2019-10-13 23:01:32,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232937840] [2019-10-13 23:01:32,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232937840] [2019-10-13 23:01:32,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:32,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063885696] [2019-10-13 23:01:32,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:32,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:32,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:32,528 INFO L87 Difference]: Start difference. First operand 399 states and 476 transitions. Second operand 6 states. [2019-10-13 23:01:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,595 INFO L93 Difference]: Finished difference Result 416 states and 492 transitions. [2019-10-13 23:01:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:32,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-13 23:01:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,598 INFO L225 Difference]: With dead ends: 416 [2019-10-13 23:01:32,598 INFO L226 Difference]: Without dead ends: 394 [2019-10-13 23:01:32,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-13 23:01:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-10-13 23:01:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-10-13 23:01:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 470 transitions. [2019-10-13 23:01:32,628 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 470 transitions. Word has length 52 [2019-10-13 23:01:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,629 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 470 transitions. [2019-10-13 23:01:32,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 470 transitions. [2019-10-13 23:01:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:32,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,630 INFO L380 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] [2019-10-13 23:01:32,631 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash -407065973, now seen corresponding path program 1 times [2019-10-13 23:01:32,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499978979] [2019-10-13 23:01:32,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499978979] [2019-10-13 23:01:32,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:32,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860099272] [2019-10-13 23:01:32,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:32,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:32,713 INFO L87 Difference]: Start difference. First operand 394 states and 470 transitions. Second operand 9 states. [2019-10-13 23:01:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,880 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2019-10-13 23:01:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:32,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-13 23:01:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,884 INFO L225 Difference]: With dead ends: 419 [2019-10-13 23:01:32,884 INFO L226 Difference]: Without dead ends: 389 [2019-10-13 23:01:32,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-13 23:01:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2019-10-13 23:01:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-13 23:01:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 462 transitions. [2019-10-13 23:01:32,915 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 462 transitions. Word has length 51 [2019-10-13 23:01:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,915 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 462 transitions. [2019-10-13 23:01:32,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 462 transitions. [2019-10-13 23:01:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:01:32,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,920 INFO L380 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] [2019-10-13 23:01:32,920 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2007347647, now seen corresponding path program 1 times [2019-10-13 23:01:32,921 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894552986] [2019-10-13 23:01:32,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894552986] [2019-10-13 23:01:32,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:32,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294995352] [2019-10-13 23:01:32,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:32,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:32,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:32,984 INFO L87 Difference]: Start difference. First operand 389 states and 462 transitions. Second operand 6 states. [2019-10-13 23:01:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,034 INFO L93 Difference]: Finished difference Result 401 states and 474 transitions. [2019-10-13 23:01:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:33,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-13 23:01:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,036 INFO L225 Difference]: With dead ends: 401 [2019-10-13 23:01:33,036 INFO L226 Difference]: Without dead ends: 362 [2019-10-13 23:01:33,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-13 23:01:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-13 23:01:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 23:01:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 422 transitions. [2019-10-13 23:01:33,063 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 422 transitions. Word has length 53 [2019-10-13 23:01:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,063 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 422 transitions. [2019-10-13 23:01:33,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 422 transitions. [2019-10-13 23:01:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:01:33,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,065 INFO L380 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] [2019-10-13 23:01:33,065 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash -759076076, now seen corresponding path program 1 times [2019-10-13 23:01:33,066 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167047830] [2019-10-13 23:01:33,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:33,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167047830] [2019-10-13 23:01:33,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:33,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179857720] [2019-10-13 23:01:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:33,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:33,177 INFO L87 Difference]: Start difference. First operand 360 states and 422 transitions. Second operand 5 states. [2019-10-13 23:01:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,501 INFO L93 Difference]: Finished difference Result 613 states and 733 transitions. [2019-10-13 23:01:33,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:33,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-13 23:01:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,504 INFO L225 Difference]: With dead ends: 613 [2019-10-13 23:01:33,504 INFO L226 Difference]: Without dead ends: 441 [2019-10-13 23:01:33,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-13 23:01:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2019-10-13 23:01:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-10-13 23:01:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2019-10-13 23:01:33,543 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 57 [2019-10-13 23:01:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,543 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2019-10-13 23:01:33,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2019-10-13 23:01:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:33,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,545 INFO L380 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] [2019-10-13 23:01:33,545 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1791603402, now seen corresponding path program 1 times [2019-10-13 23:01:33,545 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544839680] [2019-10-13 23:01:33,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:33,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544839680] [2019-10-13 23:01:33,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:33,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930735808] [2019-10-13 23:01:33,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:33,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:33,639 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand 9 states. [2019-10-13 23:01:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,880 INFO L93 Difference]: Finished difference Result 435 states and 509 transitions. [2019-10-13 23:01:33,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:33,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 23:01:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,883 INFO L225 Difference]: With dead ends: 435 [2019-10-13 23:01:33,883 INFO L226 Difference]: Without dead ends: 381 [2019-10-13 23:01:33,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-13 23:01:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-10-13 23:01:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-13 23:01:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 448 transitions. [2019-10-13 23:01:33,912 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 448 transitions. Word has length 54 [2019-10-13 23:01:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,913 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 448 transitions. [2019-10-13 23:01:33,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 448 transitions. [2019-10-13 23:01:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:33,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,920 INFO L380 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] [2019-10-13 23:01:33,920 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1794667652, now seen corresponding path program 1 times [2019-10-13 23:01:33,921 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677787265] [2019-10-13 23:01:33,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:34,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677787265] [2019-10-13 23:01:34,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:34,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385665320] [2019-10-13 23:01:34,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:34,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:34,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:34,071 INFO L87 Difference]: Start difference. First operand 381 states and 448 transitions. Second operand 8 states. [2019-10-13 23:01:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,224 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2019-10-13 23:01:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:34,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-13 23:01:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,228 INFO L225 Difference]: With dead ends: 398 [2019-10-13 23:01:34,228 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 23:01:34,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 23:01:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-10-13 23:01:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-13 23:01:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 417 transitions. [2019-10-13 23:01:34,255 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 417 transitions. Word has length 54 [2019-10-13 23:01:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,255 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 417 transitions. [2019-10-13 23:01:34,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 417 transitions. [2019-10-13 23:01:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 23:01:34,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,257 INFO L380 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] [2019-10-13 23:01:34,257 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash -309591851, now seen corresponding path program 1 times [2019-10-13 23:01:34,257 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874544212] [2019-10-13 23:01:34,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:34,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874544212] [2019-10-13 23:01:34,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:34,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54617731] [2019-10-13 23:01:34,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:34,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:34,375 INFO L87 Difference]: Start difference. First operand 354 states and 417 transitions. Second operand 10 states. [2019-10-13 23:01:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,901 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2019-10-13 23:01:34,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:34,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-13 23:01:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,904 INFO L225 Difference]: With dead ends: 388 [2019-10-13 23:01:34,905 INFO L226 Difference]: Without dead ends: 352 [2019-10-13 23:01:34,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-13 23:01:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-10-13 23:01:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 23:01:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-13 23:01:34,929 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 66 [2019-10-13 23:01:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,929 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-13 23:01:34,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-13 23:01:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 23:01:34,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,931 INFO L380 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] [2019-10-13 23:01:34,931 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -83778572, now seen corresponding path program 1 times [2019-10-13 23:01:34,932 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412355007] [2019-10-13 23:01:34,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:35,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412355007] [2019-10-13 23:01:35,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:35,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:35,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704021204] [2019-10-13 23:01:35,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:35,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:35,064 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 8 states. [2019-10-13 23:01:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:35,536 INFO L93 Difference]: Finished difference Result 434 states and 521 transitions. [2019-10-13 23:01:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:35,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-13 23:01:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:35,540 INFO L225 Difference]: With dead ends: 434 [2019-10-13 23:01:35,540 INFO L226 Difference]: Without dead ends: 430 [2019-10-13 23:01:35,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-13 23:01:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 352. [2019-10-13 23:01:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 23:01:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-13 23:01:35,578 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 67 [2019-10-13 23:01:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:35,578 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-13 23:01:35,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-13 23:01:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:35,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:35,580 INFO L380 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] [2019-10-13 23:01:35,581 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 451436269, now seen corresponding path program 1 times [2019-10-13 23:01:35,581 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:35,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546975748] [2019-10-13 23:01:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:35,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546975748] [2019-10-13 23:01:35,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:35,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:35,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321662499] [2019-10-13 23:01:35,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:35,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:35,647 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 5 states. [2019-10-13 23:01:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,032 INFO L93 Difference]: Finished difference Result 637 states and 726 transitions. [2019-10-13 23:01:36,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:36,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 23:01:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,035 INFO L225 Difference]: With dead ends: 637 [2019-10-13 23:01:36,035 INFO L226 Difference]: Without dead ends: 418 [2019-10-13 23:01:36,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-13 23:01:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2019-10-13 23:01:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-10-13 23:01:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 456 transitions. [2019-10-13 23:01:36,066 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 456 transitions. Word has length 62 [2019-10-13 23:01:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,067 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 456 transitions. [2019-10-13 23:01:36,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 456 transitions. [2019-10-13 23:01:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 23:01:36,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:36,068 INFO L380 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] [2019-10-13 23:01:36,068 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1445775960, now seen corresponding path program 1 times [2019-10-13 23:01:36,069 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:36,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682799987] [2019-10-13 23:01:36,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:36,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682799987] [2019-10-13 23:01:36,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:36,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:36,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587629709] [2019-10-13 23:01:36,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:36,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:36,142 INFO L87 Difference]: Start difference. First operand 398 states and 456 transitions. Second operand 9 states. [2019-10-13 23:01:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,282 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2019-10-13 23:01:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:36,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-13 23:01:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,285 INFO L225 Difference]: With dead ends: 400 [2019-10-13 23:01:36,285 INFO L226 Difference]: Without dead ends: 328 [2019-10-13 23:01:36,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-13 23:01:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-10-13 23:01:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-13 23:01:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 380 transitions. [2019-10-13 23:01:36,313 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 380 transitions. Word has length 63 [2019-10-13 23:01:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,313 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 380 transitions. [2019-10-13 23:01:36,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 380 transitions. [2019-10-13 23:01:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-13 23:01:36,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:36,315 INFO L380 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] [2019-10-13 23:01:36,315 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2143981119, now seen corresponding path program 1 times [2019-10-13 23:01:36,315 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:36,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860799135] [2019-10-13 23:01:36,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:36,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860799135] [2019-10-13 23:01:36,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:36,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:36,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688888959] [2019-10-13 23:01:36,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:36,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:36,375 INFO L87 Difference]: Start difference. First operand 328 states and 380 transitions. Second operand 7 states. [2019-10-13 23:01:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,462 INFO L93 Difference]: Finished difference Result 345 states and 396 transitions. [2019-10-13 23:01:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:36,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-10-13 23:01:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,465 INFO L225 Difference]: With dead ends: 345 [2019-10-13 23:01:36,465 INFO L226 Difference]: Without dead ends: 326 [2019-10-13 23:01:36,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-13 23:01:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-10-13 23:01:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-13 23:01:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2019-10-13 23:01:36,489 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 74 [2019-10-13 23:01:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,489 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2019-10-13 23:01:36,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2019-10-13 23:01:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 23:01:36,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:36,491 INFO L380 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] [2019-10-13 23:01:36,491 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -123615300, now seen corresponding path program 1 times [2019-10-13 23:01:36,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:36,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740886893] [2019-10-13 23:01:36,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:36,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740886893] [2019-10-13 23:01:36,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:36,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:36,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447377339] [2019-10-13 23:01:36,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:36,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:36,609 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand 10 states. [2019-10-13 23:01:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,981 INFO L93 Difference]: Finished difference Result 403 states and 457 transitions. [2019-10-13 23:01:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:36,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-10-13 23:01:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,985 INFO L225 Difference]: With dead ends: 403 [2019-10-13 23:01:36,985 INFO L226 Difference]: Without dead ends: 259 [2019-10-13 23:01:36,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-13 23:01:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-10-13 23:01:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-13 23:01:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 289 transitions. [2019-10-13 23:01:37,007 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 289 transitions. Word has length 75 [2019-10-13 23:01:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,008 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 289 transitions. [2019-10-13 23:01:37,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 289 transitions. [2019-10-13 23:01:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 23:01:37,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,009 INFO L380 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] [2019-10-13 23:01:37,010 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1138474364, now seen corresponding path program 1 times [2019-10-13 23:01:37,010 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777472147] [2019-10-13 23:01:37,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,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-10-13 23:01:37,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777472147] [2019-10-13 23:01:37,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:37,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895580117] [2019-10-13 23:01:37,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:37,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:37,127 INFO L87 Difference]: Start difference. First operand 255 states and 289 transitions. Second operand 10 states. [2019-10-13 23:01:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:37,371 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2019-10-13 23:01:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:37,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-10-13 23:01:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:37,373 INFO L225 Difference]: With dead ends: 297 [2019-10-13 23:01:37,373 INFO L226 Difference]: Without dead ends: 235 [2019-10-13 23:01:37,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-13 23:01:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-10-13 23:01:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-13 23:01:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2019-10-13 23:01:37,394 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 81 [2019-10-13 23:01:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,394 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2019-10-13 23:01:37,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2019-10-13 23:01:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 23:01:37,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,396 INFO L380 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] [2019-10-13 23:01:37,396 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 775720589, now seen corresponding path program 1 times [2019-10-13 23:01:37,397 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160375183] [2019-10-13 23:01:37,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:37,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160375183] [2019-10-13 23:01:37,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:37,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089274275] [2019-10-13 23:01:37,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:37,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:37,548 INFO L87 Difference]: Start difference. First operand 235 states and 265 transitions. Second operand 11 states. [2019-10-13 23:01:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:37,703 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2019-10-13 23:01:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:37,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-13 23:01:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:37,705 INFO L225 Difference]: With dead ends: 313 [2019-10-13 23:01:37,705 INFO L226 Difference]: Without dead ends: 200 [2019-10-13 23:01:37,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-13 23:01:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2019-10-13 23:01:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-13 23:01:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2019-10-13 23:01:37,722 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 86 [2019-10-13 23:01:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2019-10-13 23:01:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2019-10-13 23:01:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:01:37,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,724 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:37,724 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1293847127, now seen corresponding path program 1 times [2019-10-13 23:01:37,725 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807110248] [2019-10-13 23:01:37,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 23:01:37,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807110248] [2019-10-13 23:01:37,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:37,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198475827] [2019-10-13 23:01:37,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:37,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:37,850 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 7 states. [2019-10-13 23:01:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:38,063 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2019-10-13 23:01:38,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:38,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-13 23:01:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:38,066 INFO L225 Difference]: With dead ends: 251 [2019-10-13 23:01:38,066 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 23:01:38,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 23:01:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2019-10-13 23:01:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-13 23:01:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2019-10-13 23:01:38,097 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 91 [2019-10-13 23:01:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2019-10-13 23:01:38,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2019-10-13 23:01:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 23:01:38,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:38,101 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:38,101 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2073576186, now seen corresponding path program 1 times [2019-10-13 23:01:38,102 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:38,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595150332] [2019-10-13 23:01:38,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:38,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595150332] [2019-10-13 23:01:38,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:38,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:38,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909834262] [2019-10-13 23:01:38,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:38,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:38,192 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand 5 states. [2019-10-13 23:01:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:38,395 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2019-10-13 23:01:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:38,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-13 23:01:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:38,397 INFO L225 Difference]: With dead ends: 307 [2019-10-13 23:01:38,397 INFO L226 Difference]: Without dead ends: 246 [2019-10-13 23:01:38,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-13 23:01:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 151. [2019-10-13 23:01:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-13 23:01:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-10-13 23:01:38,421 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 99 [2019-10-13 23:01:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:38,421 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-10-13 23:01:38,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-10-13 23:01:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 23:01:38,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:38,424 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:38,424 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1183994184, now seen corresponding path program 1 times [2019-10-13 23:01:38,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:38,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135914536] [2019-10-13 23:01:38,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:38,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135914536] [2019-10-13 23:01:38,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:38,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:38,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655625636] [2019-10-13 23:01:38,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:38,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:38,587 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 13 states. [2019-10-13 23:01:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:38,802 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2019-10-13 23:01:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:38,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-10-13 23:01:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:38,804 INFO L225 Difference]: With dead ends: 194 [2019-10-13 23:01:38,804 INFO L226 Difference]: Without dead ends: 165 [2019-10-13 23:01:38,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-13 23:01:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-10-13 23:01:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-13 23:01:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2019-10-13 23:01:38,820 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 110 [2019-10-13 23:01:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:38,820 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2019-10-13 23:01:38,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2019-10-13 23:01:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 23:01:38,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:38,822 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:38,822 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1713752837, now seen corresponding path program 1 times [2019-10-13 23:01:38,823 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:38,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812297164] [2019-10-13 23:01:38,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:38,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812297164] [2019-10-13 23:01:38,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:38,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:38,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315067634] [2019-10-13 23:01:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:38,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:38,945 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 11 states. [2019-10-13 23:01:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:39,074 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-10-13 23:01:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:39,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-10-13 23:01:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:39,075 INFO L225 Difference]: With dead ends: 190 [2019-10-13 23:01:39,075 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 23:01:39,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 23:01:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 23:01:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 23:01:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2019-10-13 23:01:39,092 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 123 [2019-10-13 23:01:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:39,092 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2019-10-13 23:01:39,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2019-10-13 23:01:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 23:01:39,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:39,095 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:39,095 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1253619711, now seen corresponding path program 1 times [2019-10-13 23:01:39,095 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:39,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911714455] [2019-10-13 23:01:39,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:39,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:39,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:39,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911714455] [2019-10-13 23:01:39,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:39,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:39,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284422483] [2019-10-13 23:01:39,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:39,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:39,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:39,176 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 5 states. [2019-10-13 23:01:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:39,260 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2019-10-13 23:01:39,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:39,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-10-13 23:01:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:39,262 INFO L225 Difference]: With dead ends: 196 [2019-10-13 23:01:39,262 INFO L226 Difference]: Without dead ends: 142 [2019-10-13 23:01:39,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-13 23:01:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-13 23:01:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-13 23:01:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-13 23:01:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-13 23:01:39,277 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 126 [2019-10-13 23:01:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:39,277 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-13 23:01:39,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-13 23:01:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 23:01:39,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:39,279 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:39,279 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 120929572, now seen corresponding path program 1 times [2019-10-13 23:01:39,280 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:39,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043606003] [2019-10-13 23:01:39,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:39,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:39,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043606003] [2019-10-13 23:01:39,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:39,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:39,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333371262] [2019-10-13 23:01:39,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:39,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:39,576 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 14 states. [2019-10-13 23:01:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:40,431 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2019-10-13 23:01:40,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:01:40,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 128 [2019-10-13 23:01:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:40,433 INFO L225 Difference]: With dead ends: 145 [2019-10-13 23:01:40,433 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:01:40,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:01:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:01:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:01:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:01:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:01:40,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2019-10-13 23:01:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:40,435 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:01:40,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:01:40,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:01:40,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:01:41,891 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-13 23:01:42,181 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-10-13 23:01:42,424 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2019-10-13 23:01:42,668 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-13 23:01:42,856 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-10-13 23:01:43,384 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 91 [2019-10-13 23:01:43,513 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-10-13 23:01:43,755 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-10-13 23:01:44,074 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-10-13 23:01:44,650 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 56 [2019-10-13 23:01:45,140 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 90 [2019-10-13 23:01:45,315 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2019-10-13 23:01:45,931 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-10-13 23:01:46,211 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 1 [2019-10-13 23:01:46,322 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-13 23:01:46,570 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-10-13 23:01:46,678 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-13 23:01:47,294 WARN L191 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-10-13 23:01:47,538 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-10-13 23:01:47,662 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-13 23:01:48,031 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-13 23:01:48,217 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-10-13 23:01:48,515 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 1 [2019-10-13 23:01:48,729 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-13 23:01:49,257 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 93 [2019-10-13 23:01:49,391 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-10-13 23:01:49,894 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 80 [2019-10-13 23:01:50,005 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-13 23:01:50,525 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 91