/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:37:09,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:37:09,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:37:09,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:37:09,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:37:09,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:37:09,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:37:09,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:37:09,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:37:09,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:37:09,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:37:09,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:37:09,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:37:09,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:37:09,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:37:09,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:37:09,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:37:09,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:37:09,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:37:09,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:37:09,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:37:09,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:37:09,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:37:09,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:37:09,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:37:09,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:37:09,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:37:09,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:37:09,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:37:09,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:37:09,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:37:09,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:37:09,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:37:09,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:37:09,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:37:09,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:37:09,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:37:09,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:37:09,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:37:09,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:37:09,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:37:09,471 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-11-07 00:37:09,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:37:09,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:37:09,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:37:09,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:37:09,509 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:37:09,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:37:09,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:37:09,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:37:09,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:37:09,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:37:09,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:37:09,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:37:09,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:37:09,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:37:09,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:37:09,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:37:09,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:09,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:37:09,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:37:09,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:37:09,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:37:09,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:37:09,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:37:09,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:37:09,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:37:09,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:37:09,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:37:09,820 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:37:09,821 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:37:09,821 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-07 00:37:09,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35469122/ea1846ad681348d29d1924702ec40a04/FLAGaed88205e [2019-11-07 00:37:10,378 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:37:10,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-07 00:37:10,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35469122/ea1846ad681348d29d1924702ec40a04/FLAGaed88205e [2019-11-07 00:37:10,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35469122/ea1846ad681348d29d1924702ec40a04 [2019-11-07 00:37:10,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:37:10,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:37:10,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:10,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:37:10,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:37:10,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:10" (1/1) ... [2019-11-07 00:37:10,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a98dfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:10, skipping insertion in model container [2019-11-07 00:37:10,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:10" (1/1) ... [2019-11-07 00:37:10,757 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:37:10,804 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:37:11,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:11,269 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:37:11,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:11,417 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:37:11,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11 WrapperNode [2019-11-07 00:37:11,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:11,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:37:11,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:37:11,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:37:11,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (1/1) ... [2019-11-07 00:37:11,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:37:11,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:37:11,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:37:11,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:37:11,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (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-11-07 00:37:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:37:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:37:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-11-07 00:37:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-11-07 00:37:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-11-07 00:37:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 00:37:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 00:37:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 00:37:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 00:37:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 00:37:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-07 00:37:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:37:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 00:37:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:37:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 00:37:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 00:37:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-11-07 00:37:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-11-07 00:37:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-11-07 00:37:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-11-07 00:37:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-11-07 00:37:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-11-07 00:37:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-11-07 00:37:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 00:37:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:37:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:37:11,868 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,089 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-07 00:37:12,090 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-07 00:37:12,103 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,160 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-11-07 00:37:12,160 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-11-07 00:37:12,186 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,211 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 00:37:12,211 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 00:37:12,216 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,229 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 00:37:12,229 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 00:37:12,461 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,497 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-11-07 00:37:12,498 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-11-07 00:37:12,539 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:12,563 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-11-07 00:37:12,563 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-11-07 00:37:12,588 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:37:12,588 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:37:12,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:12 BoogieIcfgContainer [2019-11-07 00:37:12,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:37:12,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:37:12,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:37:12,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:37:12,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:37:10" (1/3) ... [2019-11-07 00:37:12,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4736b8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:12, skipping insertion in model container [2019-11-07 00:37:12,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:11" (2/3) ... [2019-11-07 00:37:12,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4736b8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:12, skipping insertion in model container [2019-11-07 00:37:12,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:12" (3/3) ... [2019-11-07 00:37:12,598 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-11-07 00:37:12,607 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:37:12,615 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:37:12,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:37:12,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:37:12,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:37:12,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:37:12,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:37:12,650 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:37:12,650 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:37:12,650 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:37:12,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:37:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-11-07 00:37:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:37:12,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:12,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:12,685 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-11-07 00:37:12,697 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:12,698 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320828936] [2019-11-07 00:37:12,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:12,945 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320828936] [2019-11-07 00:37:12,947 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:12,947 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:12,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901024309] [2019-11-07 00:37:12,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:12,955 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:12,973 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-11-07 00:37:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:13,193 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2019-11-07 00:37:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:13,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:37:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:13,210 INFO L225 Difference]: With dead ends: 537 [2019-11-07 00:37:13,210 INFO L226 Difference]: Without dead ends: 287 [2019-11-07 00:37:13,218 INFO L630 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-11-07 00:37:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-07 00:37:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-07 00:37:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-07 00:37:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-11-07 00:37:13,294 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-11-07 00:37:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:13,294 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-11-07 00:37:13,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-11-07 00:37:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:37:13,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:13,297 INFO L410 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] [2019-11-07 00:37:13,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:13,297 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-11-07 00:37:13,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:13,298 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238916455] [2019-11-07 00:37:13,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:13,462 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238916455] [2019-11-07 00:37:13,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:13,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:13,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415010034] [2019-11-07 00:37:13,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:13,464 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:13,465 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-11-07 00:37:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:13,663 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2019-11-07 00:37:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:13,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:37:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:13,672 INFO L225 Difference]: With dead ends: 637 [2019-11-07 00:37:13,672 INFO L226 Difference]: Without dead ends: 454 [2019-11-07 00:37:13,674 INFO L630 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-11-07 00:37:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-07 00:37:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-11-07 00:37:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-07 00:37:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-11-07 00:37:13,730 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-11-07 00:37:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:13,731 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-11-07 00:37:13,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-11-07 00:37:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:37:13,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:13,734 INFO L410 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] [2019-11-07 00:37:13,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-11-07 00:37:13,735 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:13,735 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044038546] [2019-11-07 00:37:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:13,854 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044038546] [2019-11-07 00:37:13,855 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:13,855 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:13,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256625482] [2019-11-07 00:37:13,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:13,856 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:13,858 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-11-07 00:37:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:13,937 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2019-11-07 00:37:13,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:13,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:37:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:13,947 INFO L225 Difference]: With dead ends: 963 [2019-11-07 00:37:13,947 INFO L226 Difference]: Without dead ends: 646 [2019-11-07 00:37:13,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-07 00:37:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-07 00:37:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-11-07 00:37:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-07 00:37:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-11-07 00:37:14,064 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-11-07 00:37:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:14,066 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-11-07 00:37:14,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-11-07 00:37:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 00:37:14,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:14,072 INFO L410 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] [2019-11-07 00:37:14,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-11-07 00:37:14,073 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:14,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817218085] [2019-11-07 00:37:14,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:14,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817218085] [2019-11-07 00:37:14,166 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:14,166 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:14,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791497046] [2019-11-07 00:37:14,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:14,167 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:14,168 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-11-07 00:37:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:14,284 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2019-11-07 00:37:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:14,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 00:37:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:14,290 INFO L225 Difference]: With dead ends: 621 [2019-11-07 00:37:14,290 INFO L226 Difference]: Without dead ends: 617 [2019-11-07 00:37:14,291 INFO L630 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-11-07 00:37:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-07 00:37:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-11-07 00:37:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-11-07 00:37:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-11-07 00:37:14,327 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-11-07 00:37:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:14,328 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-11-07 00:37:14,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-11-07 00:37:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 00:37:14,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:14,338 INFO L410 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-11-07 00:37:14,338 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-11-07 00:37:14,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:14,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717528067] [2019-11-07 00:37:14,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:14,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717528067] [2019-11-07 00:37:14,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:14,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:14,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652035411] [2019-11-07 00:37:14,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:14,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:14,394 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-11-07 00:37:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:14,474 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2019-11-07 00:37:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:14,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-07 00:37:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:14,492 INFO L225 Difference]: With dead ends: 1072 [2019-11-07 00:37:14,492 INFO L226 Difference]: Without dead ends: 1053 [2019-11-07 00:37:14,493 INFO L630 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-11-07 00:37:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-07 00:37:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-11-07 00:37:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-11-07 00:37:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-11-07 00:37:14,577 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-11-07 00:37:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:14,579 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-11-07 00:37:14,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-11-07 00:37:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 00:37:14,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:14,582 INFO L410 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-11-07 00:37:14,582 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-11-07 00:37:14,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:14,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72670588] [2019-11-07 00:37:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:14,656 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72670588] [2019-11-07 00:37:14,656 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:14,656 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:14,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710069846] [2019-11-07 00:37:14,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:14,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:14,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:14,659 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-11-07 00:37:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:14,771 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2019-11-07 00:37:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:14,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-07 00:37:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:14,779 INFO L225 Difference]: With dead ends: 1050 [2019-11-07 00:37:14,779 INFO L226 Difference]: Without dead ends: 1045 [2019-11-07 00:37:14,780 INFO L630 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-11-07 00:37:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-07 00:37:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-11-07 00:37:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-07 00:37:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-11-07 00:37:14,836 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-11-07 00:37:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:14,836 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-11-07 00:37:14,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-11-07 00:37:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 00:37:14,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:14,838 INFO L410 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-11-07 00:37:14,838 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-11-07 00:37:14,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:14,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355706300] [2019-11-07 00:37:14,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:14,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355706300] [2019-11-07 00:37:14,929 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:14,930 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546352345] [2019-11-07 00:37:14,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:14,931 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:14,931 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-11-07 00:37:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:14,995 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2019-11-07 00:37:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:14,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-07 00:37:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:15,003 INFO L225 Difference]: With dead ends: 1058 [2019-11-07 00:37:15,003 INFO L226 Difference]: Without dead ends: 1036 [2019-11-07 00:37:15,004 INFO L630 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-11-07 00:37:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-07 00:37:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-11-07 00:37:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-11-07 00:37:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-11-07 00:37:15,061 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-11-07 00:37:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:15,062 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-11-07 00:37:15,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-11-07 00:37:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 00:37:15,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:15,064 INFO L410 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-11-07 00:37:15,064 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-11-07 00:37:15,065 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:15,065 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094424403] [2019-11-07 00:37:15,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:15,114 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094424403] [2019-11-07 00:37:15,114 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:15,115 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:15,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324614251] [2019-11-07 00:37:15,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:15,116 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:15,116 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-11-07 00:37:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:15,166 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2019-11-07 00:37:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:15,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 00:37:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:15,172 INFO L225 Difference]: With dead ends: 1448 [2019-11-07 00:37:15,172 INFO L226 Difference]: Without dead ends: 578 [2019-11-07 00:37:15,179 INFO L630 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-11-07 00:37:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-11-07 00:37:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-11-07 00:37:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-07 00:37:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-11-07 00:37:15,219 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-11-07 00:37:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:15,219 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-11-07 00:37:15,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-11-07 00:37:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 00:37:15,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:15,221 INFO L410 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-11-07 00:37:15,221 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-11-07 00:37:15,222 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:15,222 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118802296] [2019-11-07 00:37:15,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:15,345 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118802296] [2019-11-07 00:37:15,346 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:15,346 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:15,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085223629] [2019-11-07 00:37:15,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:15,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:15,348 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-11-07 00:37:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:16,269 INFO L93 Difference]: Finished difference Result 607 states and 855 transitions. [2019-11-07 00:37:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:16,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-07 00:37:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:16,278 INFO L225 Difference]: With dead ends: 607 [2019-11-07 00:37:16,279 INFO L226 Difference]: Without dead ends: 601 [2019-11-07 00:37:16,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:37:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-11-07 00:37:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-11-07 00:37:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-07 00:37:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-11-07 00:37:16,324 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-11-07 00:37:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:16,324 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-11-07 00:37:16,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-11-07 00:37:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 00:37:16,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:16,326 INFO L410 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-11-07 00:37:16,326 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-11-07 00:37:16,327 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:16,327 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251610586] [2019-11-07 00:37:16,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:16,433 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251610586] [2019-11-07 00:37:16,433 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:16,434 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:16,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152559660] [2019-11-07 00:37:16,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:16,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:16,435 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-11-07 00:37:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:17,258 INFO L93 Difference]: Finished difference Result 607 states and 853 transitions. [2019-11-07 00:37:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:17,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-07 00:37:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:17,263 INFO L225 Difference]: With dead ends: 607 [2019-11-07 00:37:17,264 INFO L226 Difference]: Without dead ends: 601 [2019-11-07 00:37:17,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:37:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-11-07 00:37:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-11-07 00:37:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-07 00:37:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-11-07 00:37:17,299 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-11-07 00:37:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:17,299 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-11-07 00:37:17,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-11-07 00:37:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:17,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:17,301 INFO L410 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-11-07 00:37:17,301 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-11-07 00:37:17,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:17,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057938280] [2019-11-07 00:37:17,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:17,365 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057938280] [2019-11-07 00:37:17,365 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:17,366 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:17,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013681005] [2019-11-07 00:37:17,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:17,366 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:17,367 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-11-07 00:37:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:17,434 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-11-07 00:37:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:37:17,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-07 00:37:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:17,439 INFO L225 Difference]: With dead ends: 601 [2019-11-07 00:37:17,439 INFO L226 Difference]: Without dead ends: 576 [2019-11-07 00:37:17,440 INFO L630 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-11-07 00:37:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-11-07 00:37:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-11-07 00:37:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-07 00:37:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-11-07 00:37:17,484 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-11-07 00:37:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:17,484 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-11-07 00:37:17,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-11-07 00:37:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:17,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:17,486 INFO L410 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-11-07 00:37:17,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-11-07 00:37:17,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:17,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800242999] [2019-11-07 00:37:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:17,564 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800242999] [2019-11-07 00:37:17,565 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:17,565 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:17,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497952720] [2019-11-07 00:37:17,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:17,568 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:17,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:17,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:17,569 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-11-07 00:37:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:17,733 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2019-11-07 00:37:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-07 00:37:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:17,769 INFO L225 Difference]: With dead ends: 810 [2019-11-07 00:37:17,769 INFO L226 Difference]: Without dead ends: 802 [2019-11-07 00:37:17,770 INFO L630 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-11-07 00:37:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-07 00:37:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-11-07 00:37:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-07 00:37:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-11-07 00:37:17,812 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-11-07 00:37:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:17,812 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-11-07 00:37:17,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-11-07 00:37:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:37:17,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:17,814 INFO L410 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] [2019-11-07 00:37:17,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-11-07 00:37:17,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:17,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609449487] [2019-11-07 00:37:17,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:17,860 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609449487] [2019-11-07 00:37:17,861 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:17,861 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:17,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582049234] [2019-11-07 00:37:17,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:17,862 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:17,862 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-11-07 00:37:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,045 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2019-11-07 00:37:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:18,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-07 00:37:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:18,049 INFO L225 Difference]: With dead ends: 719 [2019-11-07 00:37:18,050 INFO L226 Difference]: Without dead ends: 452 [2019-11-07 00:37:18,052 INFO L630 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-11-07 00:37:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-07 00:37:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-11-07 00:37:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-07 00:37:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-11-07 00:37:18,076 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2019-11-07 00:37:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:18,077 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-11-07 00:37:18,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-11-07 00:37:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 00:37:18,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:18,079 INFO L410 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-11-07 00:37:18,079 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-11-07 00:37:18,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:18,080 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409834158] [2019-11-07 00:37:18,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:18,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409834158] [2019-11-07 00:37:18,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:18,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:18,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722503155] [2019-11-07 00:37:18,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:18,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:18,151 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-11-07 00:37:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,332 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2019-11-07 00:37:18,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:18,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-07 00:37:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:18,337 INFO L225 Difference]: With dead ends: 447 [2019-11-07 00:37:18,337 INFO L226 Difference]: Without dead ends: 443 [2019-11-07 00:37:18,338 INFO L630 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-11-07 00:37:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-07 00:37:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-11-07 00:37:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-07 00:37:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-11-07 00:37:18,363 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-11-07 00:37:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:18,363 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-11-07 00:37:18,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-11-07 00:37:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 00:37:18,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:18,365 INFO L410 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-11-07 00:37:18,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-11-07 00:37:18,366 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:18,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089146497] [2019-11-07 00:37:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:18,428 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089146497] [2019-11-07 00:37:18,428 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:18,428 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:18,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660303693] [2019-11-07 00:37:18,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:18,429 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:18,430 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-11-07 00:37:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,531 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2019-11-07 00:37:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:18,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-07 00:37:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:18,535 INFO L225 Difference]: With dead ends: 760 [2019-11-07 00:37:18,535 INFO L226 Difference]: Without dead ends: 462 [2019-11-07 00:37:18,538 INFO L630 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-11-07 00:37:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-07 00:37:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-11-07 00:37:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-07 00:37:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-11-07 00:37:18,566 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-11-07 00:37:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:18,566 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-11-07 00:37:18,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-11-07 00:37:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 00:37:18,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:18,568 INFO L410 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] [2019-11-07 00:37:18,569 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-11-07 00:37:18,570 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:18,570 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399913681] [2019-11-07 00:37:18,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:18,726 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399913681] [2019-11-07 00:37:18,726 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:18,726 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:18,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016109492] [2019-11-07 00:37:18,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:18,727 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:18,748 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-11-07 00:37:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:19,686 INFO L93 Difference]: Finished difference Result 776 states and 1071 transitions. [2019-11-07 00:37:19,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:19,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-07 00:37:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:19,691 INFO L225 Difference]: With dead ends: 776 [2019-11-07 00:37:19,691 INFO L226 Difference]: Without dead ends: 475 [2019-11-07 00:37:19,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-07 00:37:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-11-07 00:37:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-07 00:37:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-11-07 00:37:19,724 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-11-07 00:37:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:19,724 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-11-07 00:37:19,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-11-07 00:37:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 00:37:19,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:19,726 INFO L410 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] [2019-11-07 00:37:19,727 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-11-07 00:37:19,727 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:19,728 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196811802] [2019-11-07 00:37:19,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:19,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196811802] [2019-11-07 00:37:19,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:19,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:19,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711363422] [2019-11-07 00:37:19,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:19,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:19,806 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-11-07 00:37:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:20,445 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2019-11-07 00:37:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:20,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 00:37:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:20,449 INFO L225 Difference]: With dead ends: 580 [2019-11-07 00:37:20,449 INFO L226 Difference]: Without dead ends: 561 [2019-11-07 00:37:20,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-11-07 00:37:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-11-07 00:37:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-07 00:37:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-11-07 00:37:20,478 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-11-07 00:37:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:20,479 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-11-07 00:37:20,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-11-07 00:37:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:37:20,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:20,480 INFO L410 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] [2019-11-07 00:37:20,480 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-11-07 00:37:20,481 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:20,481 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25162736] [2019-11-07 00:37:20,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:20,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25162736] [2019-11-07 00:37:20,547 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:20,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:20,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78143339] [2019-11-07 00:37:20,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:20,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:20,549 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-11-07 00:37:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:20,690 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2019-11-07 00:37:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:20,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-07 00:37:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:20,694 INFO L225 Difference]: With dead ends: 448 [2019-11-07 00:37:20,694 INFO L226 Difference]: Without dead ends: 417 [2019-11-07 00:37:20,694 INFO L630 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-11-07 00:37:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-07 00:37:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-11-07 00:37:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-07 00:37:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-11-07 00:37:20,716 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-11-07 00:37:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:20,716 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-11-07 00:37:20,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-11-07 00:37:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:20,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:20,717 INFO L410 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-11-07 00:37:20,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-11-07 00:37:20,718 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:20,718 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739019437] [2019-11-07 00:37:20,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:20,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739019437] [2019-11-07 00:37:20,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:20,768 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:20,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683254240] [2019-11-07 00:37:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:20,769 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:20,769 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-11-07 00:37:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:20,815 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2019-11-07 00:37:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:20,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-07 00:37:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:20,819 INFO L225 Difference]: With dead ends: 432 [2019-11-07 00:37:20,819 INFO L226 Difference]: Without dead ends: 399 [2019-11-07 00:37:20,820 INFO L630 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-11-07 00:37:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-07 00:37:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-11-07 00:37:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-07 00:37:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-11-07 00:37:20,840 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-11-07 00:37:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:20,840 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-11-07 00:37:20,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-11-07 00:37:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:20,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:20,841 INFO L410 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-11-07 00:37:20,841 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-11-07 00:37:20,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:20,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383299623] [2019-11-07 00:37:20,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:20,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383299623] [2019-11-07 00:37:20,902 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:20,902 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:20,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581587286] [2019-11-07 00:37:20,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:20,903 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:20,903 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-11-07 00:37:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:21,048 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2019-11-07 00:37:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:21,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-07 00:37:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:21,052 INFO L225 Difference]: With dead ends: 429 [2019-11-07 00:37:21,052 INFO L226 Difference]: Without dead ends: 408 [2019-11-07 00:37:21,053 INFO L630 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-11-07 00:37:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-07 00:37:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-11-07 00:37:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-11-07 00:37:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-11-07 00:37:21,079 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-11-07 00:37:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:21,079 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-11-07 00:37:21,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-11-07 00:37:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:37:21,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:21,081 INFO L410 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-11-07 00:37:21,081 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-11-07 00:37:21,082 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:21,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570910440] [2019-11-07 00:37:21,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:21,130 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570910440] [2019-11-07 00:37:21,130 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:21,130 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281215011] [2019-11-07 00:37:21,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:21,132 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:21,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:21,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:21,132 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-11-07 00:37:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:21,183 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2019-11-07 00:37:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:21,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-07 00:37:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:21,188 INFO L225 Difference]: With dead ends: 436 [2019-11-07 00:37:21,188 INFO L226 Difference]: Without dead ends: 410 [2019-11-07 00:37:21,189 INFO L630 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-11-07 00:37:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-07 00:37:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-11-07 00:37:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-07 00:37:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-11-07 00:37:21,225 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-11-07 00:37:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:21,226 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-11-07 00:37:21,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-11-07 00:37:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:37:21,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:21,227 INFO L410 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-11-07 00:37:21,228 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-11-07 00:37:21,228 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:21,229 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428916750] [2019-11-07 00:37:21,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:21,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428916750] [2019-11-07 00:37:21,308 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:21,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:37:21,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56474970] [2019-11-07 00:37:21,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:37:21,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:37:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:21,311 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-11-07 00:37:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:22,043 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2019-11-07 00:37:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:22,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-07 00:37:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:22,047 INFO L225 Difference]: With dead ends: 565 [2019-11-07 00:37:22,048 INFO L226 Difference]: Without dead ends: 511 [2019-11-07 00:37:22,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:37:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-07 00:37:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-11-07 00:37:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-11-07 00:37:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-11-07 00:37:22,080 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-11-07 00:37:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:22,080 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-11-07 00:37:22,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:37:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-11-07 00:37:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:37:22,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:22,082 INFO L410 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-11-07 00:37:22,082 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-11-07 00:37:22,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:22,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183206195] [2019-11-07 00:37:22,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:22,117 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183206195] [2019-11-07 00:37:22,117 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:22,117 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:22,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266211739] [2019-11-07 00:37:22,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:22,118 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:22,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:22,118 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-11-07 00:37:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:22,245 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2019-11-07 00:37:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:22,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-07 00:37:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:22,250 INFO L225 Difference]: With dead ends: 673 [2019-11-07 00:37:22,250 INFO L226 Difference]: Without dead ends: 659 [2019-11-07 00:37:22,251 INFO L630 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-11-07 00:37:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-07 00:37:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-11-07 00:37:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-07 00:37:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-11-07 00:37:22,289 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-11-07 00:37:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:22,289 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-11-07 00:37:22,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-11-07 00:37:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 00:37:22,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:22,290 INFO L410 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-11-07 00:37:22,290 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-11-07 00:37:22,291 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:22,291 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495696288] [2019-11-07 00:37:22,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:22,366 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495696288] [2019-11-07 00:37:22,367 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:22,367 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:22,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187216863] [2019-11-07 00:37:22,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:22,368 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:22,369 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-11-07 00:37:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:22,440 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2019-11-07 00:37:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:22,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-07 00:37:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:22,445 INFO L225 Difference]: With dead ends: 598 [2019-11-07 00:37:22,445 INFO L226 Difference]: Without dead ends: 574 [2019-11-07 00:37:22,447 INFO L630 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-11-07 00:37:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-07 00:37:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-07 00:37:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-07 00:37:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-11-07 00:37:22,485 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-11-07 00:37:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:22,485 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-11-07 00:37:22,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-11-07 00:37:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:22,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:22,487 INFO L410 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-11-07 00:37:22,487 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-11-07 00:37:22,488 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:22,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862493570] [2019-11-07 00:37:22,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:22,624 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862493570] [2019-11-07 00:37:22,624 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:22,624 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:22,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926524517] [2019-11-07 00:37:22,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:22,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:22,626 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-11-07 00:37:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:23,367 INFO L93 Difference]: Finished difference Result 597 states and 868 transitions. [2019-11-07 00:37:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:23,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-11-07 00:37:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:23,372 INFO L225 Difference]: With dead ends: 597 [2019-11-07 00:37:23,372 INFO L226 Difference]: Without dead ends: 573 [2019-11-07 00:37:23,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-07 00:37:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-11-07 00:37:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-11-07 00:37:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-11-07 00:37:23,408 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-11-07 00:37:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:23,408 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-11-07 00:37:23,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-11-07 00:37:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:23,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:23,410 INFO L410 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-11-07 00:37:23,410 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-11-07 00:37:23,410 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:23,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835456521] [2019-11-07 00:37:23,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:23,455 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835456521] [2019-11-07 00:37:23,455 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:23,455 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:23,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043088123] [2019-11-07 00:37:23,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:23,456 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:23,456 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-11-07 00:37:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:23,938 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2019-11-07 00:37:23,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:23,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-07 00:37:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:23,944 INFO L225 Difference]: With dead ends: 659 [2019-11-07 00:37:23,944 INFO L226 Difference]: Without dead ends: 624 [2019-11-07 00:37:23,945 INFO L630 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-11-07 00:37:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-07 00:37:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-11-07 00:37:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-07 00:37:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-11-07 00:37:23,982 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-11-07 00:37:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:23,982 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-11-07 00:37:23,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-11-07 00:37:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:23,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:23,983 INFO L410 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-11-07 00:37:23,983 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:23,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-11-07 00:37:23,984 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:23,984 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863713197] [2019-11-07 00:37:23,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:24,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863713197] [2019-11-07 00:37:24,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:24,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:24,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84542174] [2019-11-07 00:37:24,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:24,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:24,033 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-11-07 00:37:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:24,100 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2019-11-07 00:37:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:24,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 00:37:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:24,105 INFO L225 Difference]: With dead ends: 955 [2019-11-07 00:37:24,105 INFO L226 Difference]: Without dead ends: 527 [2019-11-07 00:37:24,109 INFO L630 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-11-07 00:37:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-11-07 00:37:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-11-07 00:37:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-07 00:37:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-11-07 00:37:24,144 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-11-07 00:37:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:24,145 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-11-07 00:37:24,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-11-07 00:37:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 00:37:24,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:24,146 INFO L410 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] [2019-11-07 00:37:24,146 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-11-07 00:37:24,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:24,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151002659] [2019-11-07 00:37:24,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:24,237 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151002659] [2019-11-07 00:37:24,237 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:24,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:24,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405938656] [2019-11-07 00:37:24,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:24,238 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:24,239 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-11-07 00:37:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:24,494 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2019-11-07 00:37:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:24,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-11-07 00:37:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:24,498 INFO L225 Difference]: With dead ends: 529 [2019-11-07 00:37:24,498 INFO L226 Difference]: Without dead ends: 466 [2019-11-07 00:37:24,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-07 00:37:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-11-07 00:37:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 00:37:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-11-07 00:37:24,527 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-11-07 00:37:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:24,528 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-11-07 00:37:24,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-11-07 00:37:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 00:37:24,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:24,529 INFO L410 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-11-07 00:37:24,529 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-11-07 00:37:24,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:24,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824516799] [2019-11-07 00:37:24,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:24,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824516799] [2019-11-07 00:37:24,628 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:24,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:24,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083266267] [2019-11-07 00:37:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:24,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:24,629 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-11-07 00:37:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:24,706 INFO L93 Difference]: Finished difference Result 924 states and 1444 transitions. [2019-11-07 00:37:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:24,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-07 00:37:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:24,711 INFO L225 Difference]: With dead ends: 924 [2019-11-07 00:37:24,711 INFO L226 Difference]: Without dead ends: 497 [2019-11-07 00:37:24,714 INFO L630 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-11-07 00:37:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-07 00:37:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-11-07 00:37:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-11-07 00:37:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-11-07 00:37:24,745 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-11-07 00:37:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:24,745 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-11-07 00:37:24,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-11-07 00:37:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 00:37:24,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:24,746 INFO L410 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-11-07 00:37:24,747 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-11-07 00:37:24,747 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:24,747 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842597657] [2019-11-07 00:37:24,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:24,790 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842597657] [2019-11-07 00:37:24,791 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:24,791 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:24,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491330031] [2019-11-07 00:37:24,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:24,792 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:24,792 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-11-07 00:37:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:24,896 INFO L93 Difference]: Finished difference Result 735 states and 1199 transitions. [2019-11-07 00:37:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:24,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-07 00:37:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:24,902 INFO L225 Difference]: With dead ends: 735 [2019-11-07 00:37:24,902 INFO L226 Difference]: Without dead ends: 732 [2019-11-07 00:37:24,904 INFO L630 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-11-07 00:37:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-07 00:37:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-11-07 00:37:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-07 00:37:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-11-07 00:37:24,943 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-11-07 00:37:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:24,943 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-11-07 00:37:24,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-11-07 00:37:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:24,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:24,947 INFO L410 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] [2019-11-07 00:37:24,947 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1133247993, now seen corresponding path program 1 times [2019-11-07 00:37:24,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:24,948 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281475456] [2019-11-07 00:37:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:25,091 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281475456] [2019-11-07 00:37:25,091 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:25,091 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:25,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111543960] [2019-11-07 00:37:25,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:25,093 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:25,099 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-11-07 00:37:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:26,048 INFO L93 Difference]: Finished difference Result 1228 states and 2118 transitions. [2019-11-07 00:37:26,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:26,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-11-07 00:37:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:26,055 INFO L225 Difference]: With dead ends: 1228 [2019-11-07 00:37:26,055 INFO L226 Difference]: Without dead ends: 786 [2019-11-07 00:37:26,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:26,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-11-07 00:37:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-11-07 00:37:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-07 00:37:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-11-07 00:37:26,102 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 65 [2019-11-07 00:37:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:26,103 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-11-07 00:37:26,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-11-07 00:37:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:26,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:26,104 INFO L410 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] [2019-11-07 00:37:26,104 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:26,105 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-11-07 00:37:26,105 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:26,105 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195652470] [2019-11-07 00:37:26,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:26,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195652470] [2019-11-07 00:37:26,261 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:26,261 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:26,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652997739] [2019-11-07 00:37:26,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:26,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:26,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:26,263 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-11-07 00:37:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:26,336 INFO L93 Difference]: Finished difference Result 808 states and 1290 transitions. [2019-11-07 00:37:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:26,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-07 00:37:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:26,340 INFO L225 Difference]: With dead ends: 808 [2019-11-07 00:37:26,340 INFO L226 Difference]: Without dead ends: 335 [2019-11-07 00:37:26,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-07 00:37:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-11-07 00:37:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-07 00:37:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-11-07 00:37:26,369 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-11-07 00:37:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:26,370 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-11-07 00:37:26,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-11-07 00:37:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-07 00:37:26,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:26,371 INFO L410 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] [2019-11-07 00:37:26,372 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-11-07 00:37:26,372 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:26,372 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182154584] [2019-11-07 00:37:26,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:26,439 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182154584] [2019-11-07 00:37:26,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:26,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:26,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761053710] [2019-11-07 00:37:26,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:26,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:26,440 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-11-07 00:37:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:26,675 INFO L93 Difference]: Finished difference Result 602 states and 874 transitions. [2019-11-07 00:37:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:26,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-07 00:37:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:26,678 INFO L225 Difference]: With dead ends: 602 [2019-11-07 00:37:26,678 INFO L226 Difference]: Without dead ends: 310 [2019-11-07 00:37:26,680 INFO L630 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-11-07 00:37:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-07 00:37:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-11-07 00:37:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-07 00:37:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-11-07 00:37:26,706 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-11-07 00:37:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:26,708 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-11-07 00:37:26,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-11-07 00:37:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-07 00:37:26,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:26,709 INFO L410 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] [2019-11-07 00:37:26,710 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1481853785, now seen corresponding path program 1 times [2019-11-07 00:37:26,710 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:26,710 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476542510] [2019-11-07 00:37:26,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:26,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476542510] [2019-11-07 00:37:26,839 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:26,839 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:26,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802543019] [2019-11-07 00:37:26,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:26,840 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:26,841 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-11-07 00:37:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:27,806 INFO L93 Difference]: Finished difference Result 632 states and 901 transitions. [2019-11-07 00:37:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:27,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-11-07 00:37:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:27,811 INFO L225 Difference]: With dead ends: 632 [2019-11-07 00:37:27,811 INFO L226 Difference]: Without dead ends: 384 [2019-11-07 00:37:27,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:37:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-07 00:37:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-11-07 00:37:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-07 00:37:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-11-07 00:37:27,842 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 71 [2019-11-07 00:37:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:27,843 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-11-07 00:37:27,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-11-07 00:37:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-07 00:37:27,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:27,844 INFO L410 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] [2019-11-07 00:37:27,845 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-11-07 00:37:27,845 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:27,845 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526328026] [2019-11-07 00:37:27,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:27,981 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526328026] [2019-11-07 00:37:27,981 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:27,981 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:27,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067036281] [2019-11-07 00:37:27,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:27,982 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:27,982 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-11-07 00:37:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:28,456 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2019-11-07 00:37:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:28,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-07 00:37:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:28,460 INFO L225 Difference]: With dead ends: 671 [2019-11-07 00:37:28,461 INFO L226 Difference]: Without dead ends: 407 [2019-11-07 00:37:28,462 INFO L630 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-11-07 00:37:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-07 00:37:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-11-07 00:37:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-07 00:37:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-11-07 00:37:28,493 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-11-07 00:37:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:28,494 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-11-07 00:37:28,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-11-07 00:37:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 00:37:28,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:28,495 INFO L410 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] [2019-11-07 00:37:28,495 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-11-07 00:37:28,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:28,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132981569] [2019-11-07 00:37:28,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:28,567 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132981569] [2019-11-07 00:37:28,567 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:28,567 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:28,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910892109] [2019-11-07 00:37:28,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:28,568 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:28,568 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-11-07 00:37:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:28,620 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2019-11-07 00:37:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:28,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-07 00:37:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:28,624 INFO L225 Difference]: With dead ends: 676 [2019-11-07 00:37:28,624 INFO L226 Difference]: Without dead ends: 369 [2019-11-07 00:37:28,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-07 00:37:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-07 00:37:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-11-07 00:37:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-07 00:37:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-11-07 00:37:28,654 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-11-07 00:37:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:28,655 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-11-07 00:37:28,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-11-07 00:37:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-07 00:37:28,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:28,656 INFO L410 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] [2019-11-07 00:37:28,656 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-11-07 00:37:28,657 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:28,657 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956256924] [2019-11-07 00:37:28,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:28,719 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956256924] [2019-11-07 00:37:28,719 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:28,720 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:28,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797636659] [2019-11-07 00:37:28,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:28,720 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:28,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:28,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:28,721 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-11-07 00:37:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:29,124 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2019-11-07 00:37:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:37:29,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-07 00:37:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:29,128 INFO L225 Difference]: With dead ends: 642 [2019-11-07 00:37:29,129 INFO L226 Difference]: Without dead ends: 337 [2019-11-07 00:37:29,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-07 00:37:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-07 00:37:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-11-07 00:37:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-07 00:37:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-11-07 00:37:29,179 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-11-07 00:37:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:29,183 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-11-07 00:37:29,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-11-07 00:37:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 00:37:29,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:29,186 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:29,186 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-11-07 00:37:29,187 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:29,187 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15455732] [2019-11-07 00:37:29,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:29,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15455732] [2019-11-07 00:37:29,431 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:29,431 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 00:37:29,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750934423] [2019-11-07 00:37:29,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 00:37:29,432 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 00:37:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:29,433 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-11-07 00:37:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:29,655 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2019-11-07 00:37:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:37:29,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-11-07 00:37:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:29,658 INFO L225 Difference]: With dead ends: 357 [2019-11-07 00:37:29,659 INFO L226 Difference]: Without dead ends: 332 [2019-11-07 00:37:29,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-07 00:37:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-11-07 00:37:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-07 00:37:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-11-07 00:37:29,716 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-11-07 00:37:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-11-07 00:37:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 00:37:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-11-07 00:37:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 00:37:29,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:29,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:29,721 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-11-07 00:37:29,722 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:29,722 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384992753] [2019-11-07 00:37:29,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:29,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384992753] [2019-11-07 00:37:29,808 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:29,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:29,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674962894] [2019-11-07 00:37:29,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:29,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:29,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:29,809 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-11-07 00:37:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:30,131 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2019-11-07 00:37:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:30,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-11-07 00:37:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:30,135 INFO L225 Difference]: With dead ends: 726 [2019-11-07 00:37:30,135 INFO L226 Difference]: Without dead ends: 458 [2019-11-07 00:37:30,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11-07 00:37:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-07 00:37:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-11-07 00:37:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-07 00:37:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-11-07 00:37:30,172 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-11-07 00:37:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:30,172 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-11-07 00:37:30,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-11-07 00:37:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 00:37:30,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:30,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:30,175 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-11-07 00:37:30,176 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:30,176 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556312129] [2019-11-07 00:37:30,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:30,358 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556312129] [2019-11-07 00:37:30,359 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:30,359 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 00:37:30,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024412794] [2019-11-07 00:37:30,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 00:37:30,360 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:30,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 00:37:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:37:30,360 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-11-07 00:37:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:32,415 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2019-11-07 00:37:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-07 00:37:32,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-11-07 00:37:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:32,420 INFO L225 Difference]: With dead ends: 816 [2019-11-07 00:37:32,420 INFO L226 Difference]: Without dead ends: 774 [2019-11-07 00:37:32,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-11-07 00:37:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-07 00:37:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-11-07 00:37:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-07 00:37:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-11-07 00:37:32,462 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-11-07 00:37:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:32,462 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-11-07 00:37:32,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 00:37:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-11-07 00:37:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 00:37:32,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:32,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:32,464 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-11-07 00:37:32,465 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:32,465 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319568793] [2019-11-07 00:37:32,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:32,610 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319568793] [2019-11-07 00:37:32,611 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:32,611 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 00:37:32,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438063656] [2019-11-07 00:37:32,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 00:37:32,613 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 00:37:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:37:32,614 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-11-07 00:37:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:35,191 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2019-11-07 00:37:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 00:37:35,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-11-07 00:37:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:35,196 INFO L225 Difference]: With dead ends: 797 [2019-11-07 00:37:35,196 INFO L226 Difference]: Without dead ends: 755 [2019-11-07 00:37:35,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-11-07 00:37:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-07 00:37:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-11-07 00:37:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-07 00:37:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-11-07 00:37:35,234 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-11-07 00:37:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:35,234 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-11-07 00:37:35,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 00:37:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-11-07 00:37:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 00:37:35,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:35,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:35,236 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-11-07 00:37:35,236 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:35,237 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970431943] [2019-11-07 00:37:35,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:35,405 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970431943] [2019-11-07 00:37:35,405 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:35,405 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 00:37:35,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383379545] [2019-11-07 00:37:35,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 00:37:35,406 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:35,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 00:37:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:35,406 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-11-07 00:37:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:35,587 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2019-11-07 00:37:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:37:35,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-11-07 00:37:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:35,596 INFO L225 Difference]: With dead ends: 423 [2019-11-07 00:37:35,597 INFO L226 Difference]: Without dead ends: 396 [2019-11-07 00:37:35,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-11-07 00:37:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-11-07 00:37:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-07 00:37:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-11-07 00:37:35,632 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-11-07 00:37:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:35,633 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-11-07 00:37:35,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 00:37:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-11-07 00:37:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 00:37:35,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:35,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:35,636 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-11-07 00:37:35,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:35,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478737192] [2019-11-07 00:37:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:35,791 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478737192] [2019-11-07 00:37:35,792 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:35,792 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 00:37:35,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960510927] [2019-11-07 00:37:35,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 00:37:35,794 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 00:37:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:37:35,795 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-11-07 00:37:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:37,812 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2019-11-07 00:37:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-07 00:37:37,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-11-07 00:37:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:37,818 INFO L225 Difference]: With dead ends: 781 [2019-11-07 00:37:37,818 INFO L226 Difference]: Without dead ends: 719 [2019-11-07 00:37:37,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-11-07 00:37:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-11-07 00:37:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-11-07 00:37:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-07 00:37:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-11-07 00:37:37,881 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-11-07 00:37:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:37,883 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-11-07 00:37:37,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 00:37:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-11-07 00:37:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 00:37:37,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:37,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:37,886 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-11-07 00:37:37,886 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:37,887 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348871857] [2019-11-07 00:37:37,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:38,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348871857] [2019-11-07 00:37:38,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:38,027 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 00:37:38,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635188142] [2019-11-07 00:37:38,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 00:37:38,030 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 00:37:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:37:38,030 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-11-07 00:37:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:40,715 INFO L93 Difference]: Finished difference Result 681 states and 837 transitions. [2019-11-07 00:37:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 00:37:40,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-11-07 00:37:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:40,720 INFO L225 Difference]: With dead ends: 681 [2019-11-07 00:37:40,720 INFO L226 Difference]: Without dead ends: 617 [2019-11-07 00:37:40,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-11-07 00:37:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-07 00:37:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-11-07 00:37:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-07 00:37:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-11-07 00:37:40,750 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-11-07 00:37:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:40,750 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-11-07 00:37:40,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 00:37:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-11-07 00:37:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-07 00:37:40,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:40,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:40,752 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-11-07 00:37:40,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:40,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120497315] [2019-11-07 00:37:40,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-07 00:37:40,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120497315] [2019-11-07 00:37:40,820 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:40,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:40,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619298767] [2019-11-07 00:37:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:40,821 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:40,822 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-11-07 00:37:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:40,870 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2019-11-07 00:37:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:40,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-11-07 00:37:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:40,885 INFO L225 Difference]: With dead ends: 468 [2019-11-07 00:37:40,886 INFO L226 Difference]: Without dead ends: 322 [2019-11-07 00:37:40,886 INFO L630 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-11-07 00:37:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-07 00:37:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-11-07 00:37:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-07 00:37:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-11-07 00:37:40,912 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-11-07 00:37:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:40,913 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-11-07 00:37:40,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-11-07 00:37:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 00:37:40,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:40,915 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-07 00:37:40,915 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-11-07 00:37:40,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:40,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111732241] [2019-11-07 00:37:40,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-07 00:37:41,008 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111732241] [2019-11-07 00:37:41,008 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239006727] [2019-11-07 00:37:41,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:37:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:41,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:37:41,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:37:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 00:37:41,381 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:37:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-07 00:37:41,582 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:37:41,583 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2019-11-07 00:37:41,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533311495] [2019-11-07 00:37:41,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:41,583 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:41,584 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 6 states. [2019-11-07 00:37:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:41,680 INFO L93 Difference]: Finished difference Result 430 states and 515 transitions. [2019-11-07 00:37:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:41,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-11-07 00:37:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:41,684 INFO L225 Difference]: With dead ends: 430 [2019-11-07 00:37:41,684 INFO L226 Difference]: Without dead ends: 284 [2019-11-07 00:37:41,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-07 00:37:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 279. [2019-11-07 00:37:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-07 00:37:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 327 transitions. [2019-11-07 00:37:41,737 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 327 transitions. Word has length 163 [2019-11-07 00:37:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 327 transitions. [2019-11-07 00:37:41,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 327 transitions. [2019-11-07 00:37:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 00:37:41,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:41,739 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-07 00:37:41,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:37:41,943 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash -713455478, now seen corresponding path program 1 times [2019-11-07 00:37:41,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:41,945 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577382399] [2019-11-07 00:37:41,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-07 00:37:42,099 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577382399] [2019-11-07 00:37:42,100 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:42,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:42,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348654429] [2019-11-07 00:37:42,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:42,100 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:42,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:42,101 INFO L87 Difference]: Start difference. First operand 279 states and 327 transitions. Second operand 6 states. [2019-11-07 00:37:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:42,170 INFO L93 Difference]: Finished difference Result 441 states and 523 transitions. [2019-11-07 00:37:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:42,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-11-07 00:37:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:42,173 INFO L225 Difference]: With dead ends: 441 [2019-11-07 00:37:42,173 INFO L226 Difference]: Without dead ends: 307 [2019-11-07 00:37:42,174 INFO L630 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-11-07 00:37:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-07 00:37:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-11-07 00:37:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 00:37:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 312 transitions. [2019-11-07 00:37:42,210 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 312 transitions. Word has length 164 [2019-11-07 00:37:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:42,211 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 312 transitions. [2019-11-07 00:37:42,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 312 transitions. [2019-11-07 00:37:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-07 00:37:42,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:42,214 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-07 00:37:42,214 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash -469124130, now seen corresponding path program 1 times [2019-11-07 00:37:42,215 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:42,215 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448832896] [2019-11-07 00:37:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-07 00:37:42,324 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448832896] [2019-11-07 00:37:42,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:42,324 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:42,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539427476] [2019-11-07 00:37:42,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:42,325 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:42,325 INFO L87 Difference]: Start difference. First operand 272 states and 312 transitions. Second operand 6 states. [2019-11-07 00:37:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:42,373 INFO L93 Difference]: Finished difference Result 332 states and 379 transitions. [2019-11-07 00:37:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:42,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-11-07 00:37:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:42,375 INFO L225 Difference]: With dead ends: 332 [2019-11-07 00:37:42,375 INFO L226 Difference]: Without dead ends: 259 [2019-11-07 00:37:42,375 INFO L630 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-11-07 00:37:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-07 00:37:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 243. [2019-11-07 00:37:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-07 00:37:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2019-11-07 00:37:42,397 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 204 [2019-11-07 00:37:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:42,397 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2019-11-07 00:37:42,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2019-11-07 00:37:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-07 00:37:42,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:42,400 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-07 00:37:42,400 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 336725440, now seen corresponding path program 1 times [2019-11-07 00:37:42,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:42,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70738622] [2019-11-07 00:37:42,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-07 00:37:42,510 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70738622] [2019-11-07 00:37:42,510 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:42,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:42,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328228347] [2019-11-07 00:37:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:42,512 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:42,512 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand 6 states. [2019-11-07 00:37:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:42,558 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2019-11-07 00:37:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:42,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-11-07 00:37:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:42,560 INFO L225 Difference]: With dead ends: 243 [2019-11-07 00:37:42,560 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:37:42,561 INFO L630 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-11-07 00:37:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:37:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:37:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:37:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:37:42,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-11-07 00:37:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:42,564 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:37:42,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:37:42,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:37:42,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.