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/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:52,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:52,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:52,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:52,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:52,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:52,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:52,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:52,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:52,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:52,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:52,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:52,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:52,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:52,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:52,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:52,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:52,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:52,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:52,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:52,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:52,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:52,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:52,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:52,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:52,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:52,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:52,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:52,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:52,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:52,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:52,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:52,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:52,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:52,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:52,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:52,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:52,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:52,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:52,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:52,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:52,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:06:52,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:52,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:53,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:53,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:53,001 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:53,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:53,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:53,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:53,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:53,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:53,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:53,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:53,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:53,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:53,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:53,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:53,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:53,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:53,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:53,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:53,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:53,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:53,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:53,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:53,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:53,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:53,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:53,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:53,008 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-10-15 01:06:53,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:53,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:53,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:53,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:53,322 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:53,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-15 01:06:53,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c523c7ff1/95f76a8709654469bc5d71cc227ea09e/FLAG188d1fc44 [2019-10-15 01:06:53,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:53,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-15 01:06:54,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c523c7ff1/95f76a8709654469bc5d71cc227ea09e/FLAG188d1fc44 [2019-10-15 01:06:54,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c523c7ff1/95f76a8709654469bc5d71cc227ea09e [2019-10-15 01:06:54,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:54,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:54,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:54,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:54,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:54,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef99201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54, skipping insertion in model container [2019-10-15 01:06:54,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:54,342 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:54,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:54,713 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:54,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:54,960 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:54,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54 WrapperNode [2019-10-15 01:06:54,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:54,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:54,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:54,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:54,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:55,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:55,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:55,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:55,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:55,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:55,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:55,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:55,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:06:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:06:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-15 01:06:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-15 01:06:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:06:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:06:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-15 01:06:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-15 01:06:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-15 01:06:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:06:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-15 01:06:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-15 01:06:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 01:06:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-15 01:06:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:06:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:06:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:06:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-15 01:06:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:06:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-15 01:06:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-15 01:06:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:55,392 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,468 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:55,469 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:55,478 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,489 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:55,489 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:55,495 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,757 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 01:06:55,758 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 01:06:55,760 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,836 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-15 01:06:55,836 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-15 01:06:55,853 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,880 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:06:55,880 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:06:55,994 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,010 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,010 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,011 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,028 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,029 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,029 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,040 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,041 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,091 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,139 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 01:06:56,140 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 01:06:56,185 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,191 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,191 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,192 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,208 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,209 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,209 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:56,219 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:56,219 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:56,229 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:56,230 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:06:56,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:56 BoogieIcfgContainer [2019-10-15 01:06:56,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:56,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:56,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:56,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:56,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:54" (1/3) ... [2019-10-15 01:06:56,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49476d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:56, skipping insertion in model container [2019-10-15 01:06:56,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (2/3) ... [2019-10-15 01:06:56,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49476d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:56, skipping insertion in model container [2019-10-15 01:06:56,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:56" (3/3) ... [2019-10-15 01:06:56,241 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-10-15 01:06:56,252 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:56,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:56,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:56,307 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:56,308 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:56,308 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:56,308 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:56,308 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:56,308 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:56,308 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:56,309 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-10-15 01:06:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:06:56,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,348 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash -194924121, now seen corresponding path program 1 times [2019-10-15 01:06:56,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123903736] [2019-10-15 01:06:56,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:56,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123903736] [2019-10-15 01:06:56,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:56,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:56,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087720430] [2019-10-15 01:06:56,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:56,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,650 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-10-15 01:06:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:56,784 INFO L93 Difference]: Finished difference Result 508 states and 727 transitions. [2019-10-15 01:06:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:56,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:06:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:56,815 INFO L225 Difference]: With dead ends: 508 [2019-10-15 01:06:56,815 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 01:06:56,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 01:06:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-15 01:06:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-15 01:06:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2019-10-15 01:06:56,911 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2019-10-15 01:06:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:56,912 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2019-10-15 01:06:56,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2019-10-15 01:06:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:06:56,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,914 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -632063438, now seen corresponding path program 1 times [2019-10-15 01:06:56,915 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892107126] [2019-10-15 01:06:56,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:57,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892107126] [2019-10-15 01:06:57,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:06:57,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834923593] [2019-10-15 01:06:57,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:06:57,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:06:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:57,153 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 4 states. [2019-10-15 01:06:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,550 INFO L93 Difference]: Finished difference Result 766 states and 1005 transitions. [2019-10-15 01:06:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:06:57,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-15 01:06:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:57,556 INFO L225 Difference]: With dead ends: 766 [2019-10-15 01:06:57,556 INFO L226 Difference]: Without dead ends: 495 [2019-10-15 01:06:57,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-15 01:06:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 381. [2019-10-15 01:06:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-15 01:06:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2019-10-15 01:06:57,613 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 28 [2019-10-15 01:06:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:57,613 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2019-10-15 01:06:57,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:06:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2019-10-15 01:06:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:06:57,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:57,615 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:57,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 177283188, now seen corresponding path program 1 times [2019-10-15 01:06:57,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:57,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662453171] [2019-10-15 01:06:57,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:57,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662453171] [2019-10-15 01:06:57,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:57,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076820266] [2019-10-15 01:06:57,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:57,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,731 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand 3 states. [2019-10-15 01:06:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,924 INFO L93 Difference]: Finished difference Result 696 states and 917 transitions. [2019-10-15 01:06:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:57,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:06:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:57,933 INFO L225 Difference]: With dead ends: 696 [2019-10-15 01:06:57,934 INFO L226 Difference]: Without dead ends: 535 [2019-10-15 01:06:57,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-15 01:06:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 518. [2019-10-15 01:06:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-15 01:06:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 676 transitions. [2019-10-15 01:06:57,990 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 676 transitions. Word has length 28 [2019-10-15 01:06:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:57,990 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 676 transitions. [2019-10-15 01:06:57,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 676 transitions. [2019-10-15 01:06:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:06:57,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:57,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:57,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 182749823, now seen corresponding path program 1 times [2019-10-15 01:06:57,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:57,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658872001] [2019-10-15 01:06:57,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658872001] [2019-10-15 01:06:58,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491722876] [2019-10-15 01:06:58,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,141 INFO L87 Difference]: Start difference. First operand 518 states and 676 transitions. Second operand 3 states. [2019-10-15 01:06:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,196 INFO L93 Difference]: Finished difference Result 1030 states and 1358 transitions. [2019-10-15 01:06:58,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:58,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:06:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,203 INFO L225 Difference]: With dead ends: 1030 [2019-10-15 01:06:58,203 INFO L226 Difference]: Without dead ends: 731 [2019-10-15 01:06:58,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-15 01:06:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 700. [2019-10-15 01:06:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-15 01:06:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 926 transitions. [2019-10-15 01:06:58,249 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 926 transitions. Word has length 30 [2019-10-15 01:06:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,249 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 926 transitions. [2019-10-15 01:06:58,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 926 transitions. [2019-10-15 01:06:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:06:58,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,252 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1294168590, now seen corresponding path program 1 times [2019-10-15 01:06:58,253 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369782995] [2019-10-15 01:06:58,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369782995] [2019-10-15 01:06:58,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745467826] [2019-10-15 01:06:58,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,329 INFO L87 Difference]: Start difference. First operand 700 states and 926 transitions. Second operand 3 states. [2019-10-15 01:06:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,391 INFO L93 Difference]: Finished difference Result 846 states and 1109 transitions. [2019-10-15 01:06:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:58,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 01:06:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,398 INFO L225 Difference]: With dead ends: 846 [2019-10-15 01:06:58,399 INFO L226 Difference]: Without dead ends: 828 [2019-10-15 01:06:58,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-15 01:06:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 783. [2019-10-15 01:06:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-15 01:06:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1032 transitions. [2019-10-15 01:06:58,466 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1032 transitions. Word has length 34 [2019-10-15 01:06:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,468 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1032 transitions. [2019-10-15 01:06:58,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1032 transitions. [2019-10-15 01:06:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:06:58,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2013424057, now seen corresponding path program 1 times [2019-10-15 01:06:58,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62151008] [2019-10-15 01:06:58,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62151008] [2019-10-15 01:06:58,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374022478] [2019-10-15 01:06:58,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,554 INFO L87 Difference]: Start difference. First operand 783 states and 1032 transitions. Second operand 3 states. [2019-10-15 01:06:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,717 INFO L93 Difference]: Finished difference Result 1178 states and 1579 transitions. [2019-10-15 01:06:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:58,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 01:06:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,726 INFO L225 Difference]: With dead ends: 1178 [2019-10-15 01:06:58,726 INFO L226 Difference]: Without dead ends: 1175 [2019-10-15 01:06:58,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-15 01:06:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 910. [2019-10-15 01:06:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-10-15 01:06:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1207 transitions. [2019-10-15 01:06:58,794 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1207 transitions. Word has length 41 [2019-10-15 01:06:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,794 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1207 transitions. [2019-10-15 01:06:58,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1207 transitions. [2019-10-15 01:06:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:06:58,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,798 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2127814436, now seen corresponding path program 1 times [2019-10-15 01:06:58,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137895974] [2019-10-15 01:06:58,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137895974] [2019-10-15 01:06:58,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922976771] [2019-10-15 01:06:58,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,879 INFO L87 Difference]: Start difference. First operand 910 states and 1207 transitions. Second operand 3 states. [2019-10-15 01:06:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:59,008 INFO L93 Difference]: Finished difference Result 925 states and 1227 transitions. [2019-10-15 01:06:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:59,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 01:06:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:59,015 INFO L225 Difference]: With dead ends: 925 [2019-10-15 01:06:59,015 INFO L226 Difference]: Without dead ends: 922 [2019-10-15 01:06:59,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-15 01:06:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 921. [2019-10-15 01:06:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-10-15 01:06:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1219 transitions. [2019-10-15 01:06:59,075 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1219 transitions. Word has length 40 [2019-10-15 01:06:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:59,076 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1219 transitions. [2019-10-15 01:06:59,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1219 transitions. [2019-10-15 01:06:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:06:59,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:59,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:59,083 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash -277982875, now seen corresponding path program 1 times [2019-10-15 01:06:59,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:59,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596958718] [2019-10-15 01:06:59,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:59,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596958718] [2019-10-15 01:06:59,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:59,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:59,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988457431] [2019-10-15 01:06:59,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:59,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:59,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:59,155 INFO L87 Difference]: Start difference. First operand 921 states and 1219 transitions. Second operand 3 states. [2019-10-15 01:06:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:59,252 INFO L93 Difference]: Finished difference Result 957 states and 1261 transitions. [2019-10-15 01:06:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:59,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 01:06:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:59,258 INFO L225 Difference]: With dead ends: 957 [2019-10-15 01:06:59,258 INFO L226 Difference]: Without dead ends: 952 [2019-10-15 01:06:59,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-15 01:06:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-15 01:06:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-15 01:06:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1254 transitions. [2019-10-15 01:06:59,317 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1254 transitions. Word has length 41 [2019-10-15 01:06:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:59,318 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1254 transitions. [2019-10-15 01:06:59,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1254 transitions. [2019-10-15 01:06:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:06:59,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:59,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:59,321 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2048774711, now seen corresponding path program 1 times [2019-10-15 01:06:59,321 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:59,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666817331] [2019-10-15 01:06:59,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:59,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666817331] [2019-10-15 01:06:59,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:59,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:06:59,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722936652] [2019-10-15 01:06:59,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:59,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:59,446 INFO L87 Difference]: Start difference. First operand 950 states and 1254 transitions. Second operand 8 states. [2019-10-15 01:07:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:00,298 INFO L93 Difference]: Finished difference Result 1743 states and 2286 transitions. [2019-10-15 01:07:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:07:00,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-15 01:07:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:00,307 INFO L225 Difference]: With dead ends: 1743 [2019-10-15 01:07:00,307 INFO L226 Difference]: Without dead ends: 1120 [2019-10-15 01:07:00,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-10-15 01:07:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 935. [2019-10-15 01:07:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-15 01:07:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1219 transitions. [2019-10-15 01:07:00,418 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1219 transitions. Word has length 42 [2019-10-15 01:07:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:00,418 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1219 transitions. [2019-10-15 01:07:00,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1219 transitions. [2019-10-15 01:07:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:07:00,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:00,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:00,420 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:00,420 INFO L82 PathProgramCache]: Analyzing trace with hash 424343062, now seen corresponding path program 1 times [2019-10-15 01:07:00,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:00,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227052377] [2019-10-15 01:07:00,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:00,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227052377] [2019-10-15 01:07:00,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:00,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:00,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774514507] [2019-10-15 01:07:00,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:00,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:00,546 INFO L87 Difference]: Start difference. First operand 935 states and 1219 transitions. Second operand 8 states. [2019-10-15 01:07:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:01,207 INFO L93 Difference]: Finished difference Result 957 states and 1241 transitions. [2019-10-15 01:07:01,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:01,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-15 01:07:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:01,215 INFO L225 Difference]: With dead ends: 957 [2019-10-15 01:07:01,215 INFO L226 Difference]: Without dead ends: 951 [2019-10-15 01:07:01,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-15 01:07:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 935. [2019-10-15 01:07:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-15 01:07:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1218 transitions. [2019-10-15 01:07:01,291 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1218 transitions. Word has length 42 [2019-10-15 01:07:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:01,292 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1218 transitions. [2019-10-15 01:07:01,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1218 transitions. [2019-10-15 01:07:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:07:01,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:01,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:01,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -590658574, now seen corresponding path program 1 times [2019-10-15 01:07:01,294 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:01,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140869543] [2019-10-15 01:07:01,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:01,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140869543] [2019-10-15 01:07:01,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:01,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:01,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606007378] [2019-10-15 01:07:01,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:01,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:01,387 INFO L87 Difference]: Start difference. First operand 935 states and 1218 transitions. Second operand 8 states. [2019-10-15 01:07:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,010 INFO L93 Difference]: Finished difference Result 957 states and 1239 transitions. [2019-10-15 01:07:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:02,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-15 01:07:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,020 INFO L225 Difference]: With dead ends: 957 [2019-10-15 01:07:02,020 INFO L226 Difference]: Without dead ends: 951 [2019-10-15 01:07:02,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-15 01:07:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 935. [2019-10-15 01:07:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-15 01:07:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1217 transitions. [2019-10-15 01:07:02,073 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1217 transitions. Word has length 43 [2019-10-15 01:07:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,073 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1217 transitions. [2019-10-15 01:07:02,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1217 transitions. [2019-10-15 01:07:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:07:02,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,076 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1046770881, now seen corresponding path program 1 times [2019-10-15 01:07:02,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836300312] [2019-10-15 01:07:02,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836300312] [2019-10-15 01:07:02,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:02,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833121837] [2019-10-15 01:07:02,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:02,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:02,139 INFO L87 Difference]: Start difference. First operand 935 states and 1217 transitions. Second operand 5 states. [2019-10-15 01:07:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,197 INFO L93 Difference]: Finished difference Result 951 states and 1232 transitions. [2019-10-15 01:07:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:02,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 01:07:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,203 INFO L225 Difference]: With dead ends: 951 [2019-10-15 01:07:02,203 INFO L226 Difference]: Without dead ends: 933 [2019-10-15 01:07:02,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-10-15 01:07:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2019-10-15 01:07:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-10-15 01:07:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2019-10-15 01:07:02,269 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 44 [2019-10-15 01:07:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,270 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2019-10-15 01:07:02,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2019-10-15 01:07:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:07:02,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1366251101, now seen corresponding path program 1 times [2019-10-15 01:07:02,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646956448] [2019-10-15 01:07:02,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646956448] [2019-10-15 01:07:02,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:02,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250699637] [2019-10-15 01:07:02,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:02,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:02,339 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand 4 states. [2019-10-15 01:07:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,553 INFO L93 Difference]: Finished difference Result 1017 states and 1294 transitions. [2019-10-15 01:07:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:02,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-15 01:07:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,557 INFO L225 Difference]: With dead ends: 1017 [2019-10-15 01:07:02,558 INFO L226 Difference]: Without dead ends: 684 [2019-10-15 01:07:02,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-15 01:07:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 647. [2019-10-15 01:07:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:07:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 808 transitions. [2019-10-15 01:07:02,599 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 808 transitions. Word has length 49 [2019-10-15 01:07:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,599 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 808 transitions. [2019-10-15 01:07:02,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 808 transitions. [2019-10-15 01:07:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:02,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,603 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1393689715, now seen corresponding path program 1 times [2019-10-15 01:07:02,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450078323] [2019-10-15 01:07:02,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450078323] [2019-10-15 01:07:02,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:02,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741533341] [2019-10-15 01:07:02,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:02,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,664 INFO L87 Difference]: Start difference. First operand 647 states and 808 transitions. Second operand 3 states. [2019-10-15 01:07:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,742 INFO L93 Difference]: Finished difference Result 916 states and 1156 transitions. [2019-10-15 01:07:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 01:07:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,747 INFO L225 Difference]: With dead ends: 916 [2019-10-15 01:07:02,747 INFO L226 Difference]: Without dead ends: 655 [2019-10-15 01:07:02,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-15 01:07:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-15 01:07:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-15 01:07:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 819 transitions. [2019-10-15 01:07:02,785 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 819 transitions. Word has length 55 [2019-10-15 01:07:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,785 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 819 transitions. [2019-10-15 01:07:02,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 819 transitions. [2019-10-15 01:07:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:02,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,788 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1429960054, now seen corresponding path program 1 times [2019-10-15 01:07:02,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688719878] [2019-10-15 01:07:02,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688719878] [2019-10-15 01:07:02,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:02,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537170458] [2019-10-15 01:07:02,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:02,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,833 INFO L87 Difference]: Start difference. First operand 655 states and 819 transitions. Second operand 3 states. [2019-10-15 01:07:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,958 INFO L93 Difference]: Finished difference Result 859 states and 1089 transitions. [2019-10-15 01:07:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:02,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 01:07:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,963 INFO L225 Difference]: With dead ends: 859 [2019-10-15 01:07:02,963 INFO L226 Difference]: Without dead ends: 851 [2019-10-15 01:07:02,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-10-15 01:07:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 721. [2019-10-15 01:07:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-10-15 01:07:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 899 transitions. [2019-10-15 01:07:03,013 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 899 transitions. Word has length 52 [2019-10-15 01:07:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,014 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 899 transitions. [2019-10-15 01:07:03,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 899 transitions. [2019-10-15 01:07:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:03,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -927211119, now seen corresponding path program 1 times [2019-10-15 01:07:03,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990431091] [2019-10-15 01:07:03,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990431091] [2019-10-15 01:07:03,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:03,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165794046] [2019-10-15 01:07:03,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:03,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:03,101 INFO L87 Difference]: Start difference. First operand 721 states and 899 transitions. Second operand 8 states. [2019-10-15 01:07:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,203 INFO L93 Difference]: Finished difference Result 1151 states and 1462 transitions. [2019-10-15 01:07:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:03,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-15 01:07:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,209 INFO L225 Difference]: With dead ends: 1151 [2019-10-15 01:07:03,209 INFO L226 Difference]: Without dead ends: 807 [2019-10-15 01:07:03,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-15 01:07:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 768. [2019-10-15 01:07:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-15 01:07:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 970 transitions. [2019-10-15 01:07:03,297 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 970 transitions. Word has length 53 [2019-10-15 01:07:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,297 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 970 transitions. [2019-10-15 01:07:03,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 970 transitions. [2019-10-15 01:07:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:03,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,300 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash -926934289, now seen corresponding path program 1 times [2019-10-15 01:07:03,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965647351] [2019-10-15 01:07:03,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965647351] [2019-10-15 01:07:03,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:03,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630824478] [2019-10-15 01:07:03,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:03,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:03,391 INFO L87 Difference]: Start difference. First operand 768 states and 970 transitions. Second operand 8 states. [2019-10-15 01:07:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,560 INFO L93 Difference]: Finished difference Result 798 states and 1004 transitions. [2019-10-15 01:07:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:03,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-15 01:07:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,565 INFO L225 Difference]: With dead ends: 798 [2019-10-15 01:07:03,565 INFO L226 Difference]: Without dead ends: 782 [2019-10-15 01:07:03,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-15 01:07:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 774. [2019-10-15 01:07:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-15 01:07:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 975 transitions. [2019-10-15 01:07:03,615 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 975 transitions. Word has length 53 [2019-10-15 01:07:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,615 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 975 transitions. [2019-10-15 01:07:03,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 975 transitions. [2019-10-15 01:07:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:07:03,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,621 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2047432327, now seen corresponding path program 1 times [2019-10-15 01:07:03,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472065254] [2019-10-15 01:07:03,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472065254] [2019-10-15 01:07:03,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:03,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941330780] [2019-10-15 01:07:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:03,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:03,830 INFO L87 Difference]: Start difference. First operand 774 states and 975 transitions. Second operand 5 states. [2019-10-15 01:07:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,890 INFO L93 Difference]: Finished difference Result 1029 states and 1303 transitions. [2019-10-15 01:07:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:03,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 01:07:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,897 INFO L225 Difference]: With dead ends: 1029 [2019-10-15 01:07:03,898 INFO L226 Difference]: Without dead ends: 755 [2019-10-15 01:07:03,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-15 01:07:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-10-15 01:07:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-15 01:07:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 945 transitions. [2019-10-15 01:07:03,954 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 945 transitions. Word has length 61 [2019-10-15 01:07:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,954 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 945 transitions. [2019-10-15 01:07:03,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 945 transitions. [2019-10-15 01:07:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:03,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,959 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash -465967953, now seen corresponding path program 1 times [2019-10-15 01:07:03,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280555099] [2019-10-15 01:07:03,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280555099] [2019-10-15 01:07:04,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:04,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414282511] [2019-10-15 01:07:04,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:04,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:04,011 INFO L87 Difference]: Start difference. First operand 755 states and 945 transitions. Second operand 3 states. [2019-10-15 01:07:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,098 INFO L93 Difference]: Finished difference Result 866 states and 1079 transitions. [2019-10-15 01:07:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:04,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:07:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,103 INFO L225 Difference]: With dead ends: 866 [2019-10-15 01:07:04,104 INFO L226 Difference]: Without dead ends: 841 [2019-10-15 01:07:04,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-15 01:07:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 831. [2019-10-15 01:07:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-15 01:07:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1038 transitions. [2019-10-15 01:07:04,159 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1038 transitions. Word has length 54 [2019-10-15 01:07:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,159 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1038 transitions. [2019-10-15 01:07:04,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1038 transitions. [2019-10-15 01:07:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:04,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,161 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash -609247311, now seen corresponding path program 1 times [2019-10-15 01:07:04,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531304827] [2019-10-15 01:07:04,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531304827] [2019-10-15 01:07:04,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:04,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854055325] [2019-10-15 01:07:04,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:04,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:04,237 INFO L87 Difference]: Start difference. First operand 831 states and 1038 transitions. Second operand 7 states. [2019-10-15 01:07:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,943 INFO L93 Difference]: Finished difference Result 885 states and 1100 transitions. [2019-10-15 01:07:04,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:04,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-15 01:07:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,948 INFO L225 Difference]: With dead ends: 885 [2019-10-15 01:07:04,948 INFO L226 Difference]: Without dead ends: 759 [2019-10-15 01:07:04,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-10-15 01:07:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 713. [2019-10-15 01:07:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-15 01:07:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 881 transitions. [2019-10-15 01:07:04,989 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 881 transitions. Word has length 54 [2019-10-15 01:07:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,990 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 881 transitions. [2019-10-15 01:07:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 881 transitions. [2019-10-15 01:07:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:04,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,992 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1238038488, now seen corresponding path program 1 times [2019-10-15 01:07:04,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181422305] [2019-10-15 01:07:04,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:05,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181422305] [2019-10-15 01:07:05,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:05,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:05,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536624541] [2019-10-15 01:07:05,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:05,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:05,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:05,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:05,208 INFO L87 Difference]: Start difference. First operand 713 states and 881 transitions. Second operand 15 states. [2019-10-15 01:07:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:07,797 INFO L93 Difference]: Finished difference Result 801 states and 1000 transitions. [2019-10-15 01:07:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:07:07,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-10-15 01:07:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:07,803 INFO L225 Difference]: With dead ends: 801 [2019-10-15 01:07:07,803 INFO L226 Difference]: Without dead ends: 785 [2019-10-15 01:07:07,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:07:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-15 01:07:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 714. [2019-10-15 01:07:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-15 01:07:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 883 transitions. [2019-10-15 01:07:07,852 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 883 transitions. Word has length 54 [2019-10-15 01:07:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,852 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 883 transitions. [2019-10-15 01:07:07,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 883 transitions. [2019-10-15 01:07:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:07,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,855 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:07,855 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1268553704, now seen corresponding path program 1 times [2019-10-15 01:07:07,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584050526] [2019-10-15 01:07:07,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:07,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584050526] [2019-10-15 01:07:07,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:07,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:07,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161481697] [2019-10-15 01:07:07,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:07,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:07,994 INFO L87 Difference]: Start difference. First operand 714 states and 883 transitions. Second operand 10 states. [2019-10-15 01:07:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,628 INFO L93 Difference]: Finished difference Result 804 states and 995 transitions. [2019-10-15 01:07:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:09,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-15 01:07:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,634 INFO L225 Difference]: With dead ends: 804 [2019-10-15 01:07:09,635 INFO L226 Difference]: Without dead ends: 788 [2019-10-15 01:07:09,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-15 01:07:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 780. [2019-10-15 01:07:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-10-15 01:07:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 964 transitions. [2019-10-15 01:07:09,684 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 964 transitions. Word has length 54 [2019-10-15 01:07:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,684 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 964 transitions. [2019-10-15 01:07:09,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 964 transitions. [2019-10-15 01:07:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:07:09,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:09,687 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash 329035060, now seen corresponding path program 1 times [2019-10-15 01:07:09,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940669956] [2019-10-15 01:07:09,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:09,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940669956] [2019-10-15 01:07:09,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:09,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899354277] [2019-10-15 01:07:09,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:09,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:09,751 INFO L87 Difference]: Start difference. First operand 780 states and 964 transitions. Second operand 6 states. [2019-10-15 01:07:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,846 INFO L93 Difference]: Finished difference Result 799 states and 982 transitions. [2019-10-15 01:07:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:09,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-15 01:07:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,850 INFO L225 Difference]: With dead ends: 799 [2019-10-15 01:07:09,851 INFO L226 Difference]: Without dead ends: 746 [2019-10-15 01:07:09,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-15 01:07:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2019-10-15 01:07:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-15 01:07:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 922 transitions. [2019-10-15 01:07:09,895 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 922 transitions. Word has length 57 [2019-10-15 01:07:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,895 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 922 transitions. [2019-10-15 01:07:09,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 922 transitions. [2019-10-15 01:07:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:09,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:09,900 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,900 INFO L82 PathProgramCache]: Analyzing trace with hash 932474003, now seen corresponding path program 1 times [2019-10-15 01:07:09,901 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412685830] [2019-10-15 01:07:09,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412685830] [2019-10-15 01:07:10,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:10,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869811677] [2019-10-15 01:07:10,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:10,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:10,045 INFO L87 Difference]: Start difference. First operand 746 states and 922 transitions. Second operand 11 states. [2019-10-15 01:07:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,927 INFO L93 Difference]: Finished difference Result 1062 states and 1337 transitions. [2019-10-15 01:07:10,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:07:10,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-15 01:07:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,932 INFO L225 Difference]: With dead ends: 1062 [2019-10-15 01:07:10,932 INFO L226 Difference]: Without dead ends: 791 [2019-10-15 01:07:10,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-15 01:07:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 746. [2019-10-15 01:07:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-15 01:07:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 922 transitions. [2019-10-15 01:07:10,986 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 922 transitions. Word has length 56 [2019-10-15 01:07:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 922 transitions. [2019-10-15 01:07:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 922 transitions. [2019-10-15 01:07:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:10,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:10,989 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1574030547, now seen corresponding path program 1 times [2019-10-15 01:07:10,989 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100845163] [2019-10-15 01:07:10,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:11,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100845163] [2019-10-15 01:07:11,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:11,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:11,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094224891] [2019-10-15 01:07:11,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:11,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:11,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:11,047 INFO L87 Difference]: Start difference. First operand 746 states and 922 transitions. Second operand 5 states. [2019-10-15 01:07:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:11,363 INFO L93 Difference]: Finished difference Result 760 states and 935 transitions. [2019-10-15 01:07:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:11,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-15 01:07:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:11,366 INFO L225 Difference]: With dead ends: 760 [2019-10-15 01:07:11,367 INFO L226 Difference]: Without dead ends: 742 [2019-10-15 01:07:11,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-15 01:07:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 728. [2019-10-15 01:07:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-15 01:07:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 896 transitions. [2019-10-15 01:07:11,410 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 896 transitions. Word has length 56 [2019-10-15 01:07:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:11,412 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 896 transitions. [2019-10-15 01:07:11,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 896 transitions. [2019-10-15 01:07:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:07:11,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:11,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:11,414 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash -386931168, now seen corresponding path program 1 times [2019-10-15 01:07:11,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:11,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838460619] [2019-10-15 01:07:11,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:11,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838460619] [2019-10-15 01:07:11,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:11,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:11,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026105831] [2019-10-15 01:07:11,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:11,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:11,487 INFO L87 Difference]: Start difference. First operand 728 states and 896 transitions. Second operand 5 states. [2019-10-15 01:07:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:11,785 INFO L93 Difference]: Finished difference Result 987 states and 1225 transitions. [2019-10-15 01:07:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:11,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-15 01:07:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:11,788 INFO L225 Difference]: With dead ends: 987 [2019-10-15 01:07:11,788 INFO L226 Difference]: Without dead ends: 728 [2019-10-15 01:07:11,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-15 01:07:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-10-15 01:07:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-15 01:07:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 894 transitions. [2019-10-15 01:07:11,831 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 894 transitions. Word has length 65 [2019-10-15 01:07:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:11,831 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 894 transitions. [2019-10-15 01:07:11,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 894 transitions. [2019-10-15 01:07:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:07:11,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:11,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:11,833 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash -976640211, now seen corresponding path program 1 times [2019-10-15 01:07:11,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:11,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781253023] [2019-10-15 01:07:11,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:11,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781253023] [2019-10-15 01:07:11,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:11,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:11,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672744598] [2019-10-15 01:07:11,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:11,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:11,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:11,910 INFO L87 Difference]: Start difference. First operand 728 states and 894 transitions. Second operand 9 states. [2019-10-15 01:07:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,090 INFO L93 Difference]: Finished difference Result 757 states and 923 transitions. [2019-10-15 01:07:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:12,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:07:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,099 INFO L225 Difference]: With dead ends: 757 [2019-10-15 01:07:12,099 INFO L226 Difference]: Without dead ends: 723 [2019-10-15 01:07:12,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-15 01:07:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-10-15 01:07:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-15 01:07:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 886 transitions. [2019-10-15 01:07:12,151 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 886 transitions. Word has length 58 [2019-10-15 01:07:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,151 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 886 transitions. [2019-10-15 01:07:12,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 886 transitions. [2019-10-15 01:07:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:12,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,153 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1616889087, now seen corresponding path program 1 times [2019-10-15 01:07:12,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61410115] [2019-10-15 01:07:12,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61410115] [2019-10-15 01:07:12,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:12,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766234544] [2019-10-15 01:07:12,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:12,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:12,250 INFO L87 Difference]: Start difference. First operand 723 states and 886 transitions. Second operand 9 states. [2019-10-15 01:07:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,451 INFO L93 Difference]: Finished difference Result 752 states and 915 transitions. [2019-10-15 01:07:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:12,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:07:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,454 INFO L225 Difference]: With dead ends: 752 [2019-10-15 01:07:12,455 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:07:12,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:07:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-15 01:07:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:07:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 877 transitions. [2019-10-15 01:07:12,500 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 877 transitions. Word has length 59 [2019-10-15 01:07:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,501 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 877 transitions. [2019-10-15 01:07:12,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 877 transitions. [2019-10-15 01:07:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:12,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,504 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash -631338351, now seen corresponding path program 1 times [2019-10-15 01:07:12,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032203925] [2019-10-15 01:07:12,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032203925] [2019-10-15 01:07:12,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:12,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926361802] [2019-10-15 01:07:12,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:12,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:12,577 INFO L87 Difference]: Start difference. First operand 717 states and 877 transitions. Second operand 9 states. [2019-10-15 01:07:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,768 INFO L93 Difference]: Finished difference Result 746 states and 906 transitions. [2019-10-15 01:07:12,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:12,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:07:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,772 INFO L225 Difference]: With dead ends: 746 [2019-10-15 01:07:12,772 INFO L226 Difference]: Without dead ends: 712 [2019-10-15 01:07:12,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-10-15 01:07:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2019-10-15 01:07:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-15 01:07:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 869 transitions. [2019-10-15 01:07:12,831 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 869 transitions. Word has length 59 [2019-10-15 01:07:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,832 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 869 transitions. [2019-10-15 01:07:12,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 869 transitions. [2019-10-15 01:07:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 01:07:12,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,834 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1272366496, now seen corresponding path program 1 times [2019-10-15 01:07:12,835 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928255663] [2019-10-15 01:07:12,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928255663] [2019-10-15 01:07:12,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:12,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47790285] [2019-10-15 01:07:12,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:12,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:12,937 INFO L87 Difference]: Start difference. First operand 712 states and 869 transitions. Second operand 6 states. [2019-10-15 01:07:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,054 INFO L93 Difference]: Finished difference Result 981 states and 1211 transitions. [2019-10-15 01:07:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:13,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-15 01:07:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,058 INFO L225 Difference]: With dead ends: 981 [2019-10-15 01:07:13,059 INFO L226 Difference]: Without dead ends: 755 [2019-10-15 01:07:13,060 INFO L600 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-10-15 01:07:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-15 01:07:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 712. [2019-10-15 01:07:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-15 01:07:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 867 transitions. [2019-10-15 01:07:13,105 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 867 transitions. Word has length 68 [2019-10-15 01:07:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,105 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 867 transitions. [2019-10-15 01:07:13,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 867 transitions. [2019-10-15 01:07:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:07:13,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:13,108 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1938247885, now seen corresponding path program 1 times [2019-10-15 01:07:13,109 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502141403] [2019-10-15 01:07:13,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502141403] [2019-10-15 01:07:13,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:13,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617359254] [2019-10-15 01:07:13,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:13,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:13,156 INFO L87 Difference]: Start difference. First operand 712 states and 867 transitions. Second operand 3 states. [2019-10-15 01:07:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,207 INFO L93 Difference]: Finished difference Result 1069 states and 1313 transitions. [2019-10-15 01:07:13,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:13,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-15 01:07:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,212 INFO L225 Difference]: With dead ends: 1069 [2019-10-15 01:07:13,212 INFO L226 Difference]: Without dead ends: 816 [2019-10-15 01:07:13,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-10-15 01:07:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 786. [2019-10-15 01:07:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-10-15 01:07:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 961 transitions. [2019-10-15 01:07:13,266 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 961 transitions. Word has length 70 [2019-10-15 01:07:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,266 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 961 transitions. [2019-10-15 01:07:13,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 961 transitions. [2019-10-15 01:07:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:13,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:13,270 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1248598314, now seen corresponding path program 1 times [2019-10-15 01:07:13,271 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739380230] [2019-10-15 01:07:13,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739380230] [2019-10-15 01:07:13,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:13,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238279629] [2019-10-15 01:07:13,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:13,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:13,358 INFO L87 Difference]: Start difference. First operand 786 states and 961 transitions. Second operand 9 states. [2019-10-15 01:07:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,548 INFO L93 Difference]: Finished difference Result 815 states and 990 transitions. [2019-10-15 01:07:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:13,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-15 01:07:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,551 INFO L225 Difference]: With dead ends: 815 [2019-10-15 01:07:13,552 INFO L226 Difference]: Without dead ends: 740 [2019-10-15 01:07:13,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-10-15 01:07:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2019-10-15 01:07:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-15 01:07:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 904 transitions. [2019-10-15 01:07:13,606 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 904 transitions. Word has length 63 [2019-10-15 01:07:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,606 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 904 transitions. [2019-10-15 01:07:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 904 transitions. [2019-10-15 01:07:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:07:13,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:13,612 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 258674534, now seen corresponding path program 1 times [2019-10-15 01:07:13,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536237327] [2019-10-15 01:07:13,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536237327] [2019-10-15 01:07:13,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:13,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436379430] [2019-10-15 01:07:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:13,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:13,707 INFO L87 Difference]: Start difference. First operand 740 states and 904 transitions. Second operand 6 states. [2019-10-15 01:07:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,377 INFO L93 Difference]: Finished difference Result 1044 states and 1279 transitions. [2019-10-15 01:07:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:14,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-15 01:07:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,381 INFO L225 Difference]: With dead ends: 1044 [2019-10-15 01:07:14,381 INFO L226 Difference]: Without dead ends: 735 [2019-10-15 01:07:14,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-15 01:07:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2019-10-15 01:07:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-15 01:07:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 876 transitions. [2019-10-15 01:07:14,437 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 876 transitions. Word has length 79 [2019-10-15 01:07:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,437 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 876 transitions. [2019-10-15 01:07:14,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 876 transitions. [2019-10-15 01:07:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:07:14,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,440 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:14,440 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash 58561833, now seen corresponding path program 1 times [2019-10-15 01:07:14,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286803790] [2019-10-15 01:07:14,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286803790] [2019-10-15 01:07:14,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:14,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376202693] [2019-10-15 01:07:14,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:14,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:14,585 INFO L87 Difference]: Start difference. First operand 724 states and 876 transitions. Second operand 6 states. [2019-10-15 01:07:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,663 INFO L93 Difference]: Finished difference Result 1057 states and 1311 transitions. [2019-10-15 01:07:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:14,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-15 01:07:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,681 INFO L225 Difference]: With dead ends: 1057 [2019-10-15 01:07:14,681 INFO L226 Difference]: Without dead ends: 803 [2019-10-15 01:07:14,685 INFO L600 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-10-15 01:07:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-10-15 01:07:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 690. [2019-10-15 01:07:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-15 01:07:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 832 transitions. [2019-10-15 01:07:14,750 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 832 transitions. Word has length 80 [2019-10-15 01:07:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,751 INFO L462 AbstractCegarLoop]: Abstraction has 690 states and 832 transitions. [2019-10-15 01:07:14,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 832 transitions. [2019-10-15 01:07:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-15 01:07:14,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:14,755 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 436175383, now seen corresponding path program 1 times [2019-10-15 01:07:14,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709162198] [2019-10-15 01:07:14,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709162198] [2019-10-15 01:07:14,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:14,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295680974] [2019-10-15 01:07:14,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:14,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:14,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:14,839 INFO L87 Difference]: Start difference. First operand 690 states and 832 transitions. Second operand 5 states. [2019-10-15 01:07:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,345 INFO L93 Difference]: Finished difference Result 1190 states and 1406 transitions. [2019-10-15 01:07:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:15,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-15 01:07:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,348 INFO L225 Difference]: With dead ends: 1190 [2019-10-15 01:07:15,348 INFO L226 Difference]: Without dead ends: 750 [2019-10-15 01:07:15,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-10-15 01:07:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 727. [2019-10-15 01:07:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:07:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 857 transitions. [2019-10-15 01:07:15,400 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 857 transitions. Word has length 75 [2019-10-15 01:07:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,400 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 857 transitions. [2019-10-15 01:07:15,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 857 transitions. [2019-10-15 01:07:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:07:15,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,402 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1450993742, now seen corresponding path program 1 times [2019-10-15 01:07:15,403 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705151572] [2019-10-15 01:07:15,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705151572] [2019-10-15 01:07:15,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:15,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040616823] [2019-10-15 01:07:15,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:15,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:15,495 INFO L87 Difference]: Start difference. First operand 727 states and 857 transitions. Second operand 9 states. [2019-10-15 01:07:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,660 INFO L93 Difference]: Finished difference Result 729 states and 858 transitions. [2019-10-15 01:07:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:15,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-15 01:07:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,662 INFO L225 Difference]: With dead ends: 729 [2019-10-15 01:07:15,662 INFO L226 Difference]: Without dead ends: 446 [2019-10-15 01:07:15,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-15 01:07:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-15 01:07:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-15 01:07:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 530 transitions. [2019-10-15 01:07:15,692 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 530 transitions. Word has length 76 [2019-10-15 01:07:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,693 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 530 transitions. [2019-10-15 01:07:15,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 530 transitions. [2019-10-15 01:07:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:07:15,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,697 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1637607580, now seen corresponding path program 1 times [2019-10-15 01:07:15,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973403954] [2019-10-15 01:07:15,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973403954] [2019-10-15 01:07:15,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:15,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204145780] [2019-10-15 01:07:15,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:15,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:15,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:15,781 INFO L87 Difference]: Start difference. First operand 446 states and 530 transitions. Second operand 9 states. [2019-10-15 01:07:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,895 INFO L93 Difference]: Finished difference Result 467 states and 551 transitions. [2019-10-15 01:07:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:15,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-15 01:07:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,897 INFO L225 Difference]: With dead ends: 467 [2019-10-15 01:07:15,897 INFO L226 Difference]: Without dead ends: 446 [2019-10-15 01:07:15,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-15 01:07:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-15 01:07:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-15 01:07:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 529 transitions. [2019-10-15 01:07:15,929 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 529 transitions. Word has length 85 [2019-10-15 01:07:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,930 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 529 transitions. [2019-10-15 01:07:15,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 529 transitions. [2019-10-15 01:07:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:07:15,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,932 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash -274697648, now seen corresponding path program 1 times [2019-10-15 01:07:15,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934639356] [2019-10-15 01:07:15,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934639356] [2019-10-15 01:07:16,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:16,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496601966] [2019-10-15 01:07:16,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:16,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:16,016 INFO L87 Difference]: Start difference. First operand 446 states and 529 transitions. Second operand 6 states. [2019-10-15 01:07:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,066 INFO L93 Difference]: Finished difference Result 479 states and 560 transitions. [2019-10-15 01:07:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:16,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:07:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,068 INFO L225 Difference]: With dead ends: 479 [2019-10-15 01:07:16,068 INFO L226 Difference]: Without dead ends: 440 [2019-10-15 01:07:16,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-15 01:07:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2019-10-15 01:07:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-15 01:07:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2019-10-15 01:07:16,096 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 96 [2019-10-15 01:07:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,096 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2019-10-15 01:07:16,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2019-10-15 01:07:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:07:16,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,098 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash -742138889, now seen corresponding path program 1 times [2019-10-15 01:07:16,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156711425] [2019-10-15 01:07:16,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156711425] [2019-10-15 01:07:16,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:16,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807673119] [2019-10-15 01:07:16,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:16,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,166 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand 7 states. [2019-10-15 01:07:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,344 INFO L93 Difference]: Finished difference Result 730 states and 860 transitions. [2019-10-15 01:07:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:16,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:07:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,347 INFO L225 Difference]: With dead ends: 730 [2019-10-15 01:07:16,348 INFO L226 Difference]: Without dead ends: 685 [2019-10-15 01:07:16,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-15 01:07:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2019-10-15 01:07:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:07:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 428 transitions. [2019-10-15 01:07:16,390 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 428 transitions. Word has length 96 [2019-10-15 01:07:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,390 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 428 transitions. [2019-10-15 01:07:16,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 428 transitions. [2019-10-15 01:07:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:07:16,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,393 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1608566912, now seen corresponding path program 1 times [2019-10-15 01:07:16,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915751598] [2019-10-15 01:07:16,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915751598] [2019-10-15 01:07:16,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:16,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702724635] [2019-10-15 01:07:16,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:16,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:16,525 INFO L87 Difference]: Start difference. First operand 367 states and 428 transitions. Second operand 11 states. [2019-10-15 01:07:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,651 INFO L93 Difference]: Finished difference Result 512 states and 600 transitions. [2019-10-15 01:07:16,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:16,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2019-10-15 01:07:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,653 INFO L225 Difference]: With dead ends: 512 [2019-10-15 01:07:16,654 INFO L226 Difference]: Without dead ends: 363 [2019-10-15 01:07:16,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-15 01:07:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2019-10-15 01:07:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-15 01:07:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2019-10-15 01:07:16,681 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 101 [2019-10-15 01:07:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,682 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2019-10-15 01:07:16,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2019-10-15 01:07:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:07:16,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,684 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,684 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash -18483681, now seen corresponding path program 1 times [2019-10-15 01:07:16,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840749520] [2019-10-15 01:07:16,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:07:16,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840749520] [2019-10-15 01:07:16,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:16,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950905142] [2019-10-15 01:07:16,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:16,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:16,765 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand 6 states. [2019-10-15 01:07:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,816 INFO L93 Difference]: Finished difference Result 378 states and 431 transitions. [2019-10-15 01:07:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:16,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-10-15 01:07:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,818 INFO L225 Difference]: With dead ends: 378 [2019-10-15 01:07:16,818 INFO L226 Difference]: Without dead ends: 302 [2019-10-15 01:07:16,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-15 01:07:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-10-15 01:07:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-15 01:07:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 265 transitions. [2019-10-15 01:07:16,842 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 265 transitions. Word has length 110 [2019-10-15 01:07:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,842 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 265 transitions. [2019-10-15 01:07:16,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 265 transitions. [2019-10-15 01:07:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:07:16,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,844 INFO L380 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, 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] [2019-10-15 01:07:16,844 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1525235784, now seen corresponding path program 1 times [2019-10-15 01:07:16,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399590314] [2019-10-15 01:07:16,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:07:16,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399590314] [2019-10-15 01:07:16,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:16,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766011815] [2019-10-15 01:07:16,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:16,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:16,980 INFO L87 Difference]: Start difference. First operand 240 states and 265 transitions. Second operand 9 states. [2019-10-15 01:07:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,117 INFO L93 Difference]: Finished difference Result 313 states and 352 transitions. [2019-10-15 01:07:17,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:17,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-15 01:07:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,120 INFO L225 Difference]: With dead ends: 313 [2019-10-15 01:07:17,120 INFO L226 Difference]: Without dead ends: 284 [2019-10-15 01:07:17,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-15 01:07:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-10-15 01:07:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 01:07:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 290 transitions. [2019-10-15 01:07:17,145 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 290 transitions. Word has length 131 [2019-10-15 01:07:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,145 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 290 transitions. [2019-10-15 01:07:17,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 290 transitions. [2019-10-15 01:07:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:07:17,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,149 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:17,149 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2109636131, now seen corresponding path program 1 times [2019-10-15 01:07:17,150 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98845927] [2019-10-15 01:07:17,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:07:17,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98845927] [2019-10-15 01:07:17,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:07:17,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715832003] [2019-10-15 01:07:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:07:17,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:07:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:17,349 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand 13 states. [2019-10-15 01:07:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,635 INFO L93 Difference]: Finished difference Result 308 states and 350 transitions. [2019-10-15 01:07:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:07:17,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-10-15 01:07:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,637 INFO L225 Difference]: With dead ends: 308 [2019-10-15 01:07:17,637 INFO L226 Difference]: Without dead ends: 274 [2019-10-15 01:07:17,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-15 01:07:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 251. [2019-10-15 01:07:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-15 01:07:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2019-10-15 01:07:17,658 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 132 [2019-10-15 01:07:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,658 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2019-10-15 01:07:17,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:07:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2019-10-15 01:07:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:07:17,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,660 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:17,660 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 144838378, now seen corresponding path program 1 times [2019-10-15 01:07:17,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635596311] [2019-10-15 01:07:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:17,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635596311] [2019-10-15 01:07:17,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:17,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179037593] [2019-10-15 01:07:17,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:17,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:17,740 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 5 states. [2019-10-15 01:07:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,774 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2019-10-15 01:07:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:17,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:07:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,777 INFO L225 Difference]: With dead ends: 287 [2019-10-15 01:07:17,777 INFO L226 Difference]: Without dead ends: 257 [2019-10-15 01:07:17,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-15 01:07:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-10-15 01:07:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-15 01:07:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 281 transitions. [2019-10-15 01:07:17,805 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 281 transitions. Word has length 150 [2019-10-15 01:07:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,806 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 281 transitions. [2019-10-15 01:07:17,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 281 transitions. [2019-10-15 01:07:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:07:17,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,808 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:17,808 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 326324875, now seen corresponding path program 1 times [2019-10-15 01:07:17,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696068532] [2019-10-15 01:07:17,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:17,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696068532] [2019-10-15 01:07:17,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812992332] [2019-10-15 01:07:17,978 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-10-15 01:07:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:18,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:07:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:07:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:18,408 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:07:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:18,858 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:07:18,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [12] total 30 [2019-10-15 01:07:18,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944365009] [2019-10-15 01:07:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-15 01:07:18,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-15 01:07:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:07:18,860 INFO L87 Difference]: Start difference. First operand 255 states and 281 transitions. Second operand 20 states. [2019-10-15 01:07:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,090 INFO L93 Difference]: Finished difference Result 294 states and 326 transitions. [2019-10-15 01:07:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:19,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 150 [2019-10-15 01:07:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,092 INFO L225 Difference]: With dead ends: 294 [2019-10-15 01:07:19,093 INFO L226 Difference]: Without dead ends: 253 [2019-10-15 01:07:19,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 01:07:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-15 01:07:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-10-15 01:07:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-15 01:07:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 272 transitions. [2019-10-15 01:07:19,118 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 272 transitions. Word has length 150 [2019-10-15 01:07:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,118 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 272 transitions. [2019-10-15 01:07:19,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-15 01:07:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 272 transitions. [2019-10-15 01:07:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:07:19,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,120 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:19,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:19,328 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2073819428, now seen corresponding path program 1 times [2019-10-15 01:07:19,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018739580] [2019-10-15 01:07:19,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:19,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018739580] [2019-10-15 01:07:19,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621620861] [2019-10-15 01:07:19,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:07:19,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:07:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:20,006 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:07:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:20,309 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:07:20,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [12] total 16 [2019-10-15 01:07:20,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999211811] [2019-10-15 01:07:20,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:20,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:07:20,311 INFO L87 Difference]: Start difference. First operand 249 states and 272 transitions. Second operand 6 states. [2019-10-15 01:07:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,446 INFO L93 Difference]: Finished difference Result 304 states and 330 transitions. [2019-10-15 01:07:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:20,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-10-15 01:07:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,448 INFO L225 Difference]: With dead ends: 304 [2019-10-15 01:07:20,448 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 01:07:20,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:07:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 01:07:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-10-15 01:07:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-15 01:07:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 246 transitions. [2019-10-15 01:07:20,469 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 246 transitions. Word has length 155 [2019-10-15 01:07:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,470 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 246 transitions. [2019-10-15 01:07:20,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 246 transitions. [2019-10-15 01:07:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:07:20,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,471 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:20,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:20,677 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash -225753573, now seen corresponding path program 1 times [2019-10-15 01:07:20,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083791960] [2019-10-15 01:07:20,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:20,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083791960] [2019-10-15 01:07:20,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:20,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:20,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300078492] [2019-10-15 01:07:20,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:20,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:20,777 INFO L87 Difference]: Start difference. First operand 229 states and 246 transitions. Second operand 6 states. [2019-10-15 01:07:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,821 INFO L93 Difference]: Finished difference Result 319 states and 343 transitions. [2019-10-15 01:07:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:20,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-15 01:07:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,823 INFO L225 Difference]: With dead ends: 319 [2019-10-15 01:07:20,823 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:07:20,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:07:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2019-10-15 01:07:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-15 01:07:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 244 transitions. [2019-10-15 01:07:20,855 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 244 transitions. Word has length 157 [2019-10-15 01:07:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,856 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 244 transitions. [2019-10-15 01:07:20,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 244 transitions. [2019-10-15 01:07:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:07:20,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,858 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:20,859 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash 223545200, now seen corresponding path program 1 times [2019-10-15 01:07:20,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560184707] [2019-10-15 01:07:20,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:07:21,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560184707] [2019-10-15 01:07:21,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:21,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:21,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607194388] [2019-10-15 01:07:21,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:21,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:21,086 INFO L87 Difference]: Start difference. First operand 228 states and 244 transitions. Second operand 10 states. [2019-10-15 01:07:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,013 INFO L93 Difference]: Finished difference Result 450 states and 483 transitions. [2019-10-15 01:07:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:07:22,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-10-15 01:07:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:22,016 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:07:22,016 INFO L226 Difference]: Without dead ends: 231 [2019-10-15 01:07:22,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:07:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-15 01:07:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-10-15 01:07:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-15 01:07:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2019-10-15 01:07:22,036 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 158 [2019-10-15 01:07:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:22,037 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2019-10-15 01:07:22,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2019-10-15 01:07:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:07:22,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:22,038 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:22,038 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:22,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:22,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2140296462, now seen corresponding path program 1 times [2019-10-15 01:07:22,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:22,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959780096] [2019-10-15 01:07:22,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:07:22,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959780096] [2019-10-15 01:07:22,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278542270] [2019-10-15 01:07:22,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:07:22,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:07:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:07:22,613 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:07:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:07:22,911 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:07:22,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [15] total 23 [2019-10-15 01:07:22,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685417635] [2019-10-15 01:07:22,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:22,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:07:22,912 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand 10 states. [2019-10-15 01:07:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,998 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2019-10-15 01:07:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:22,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-10-15 01:07:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:23,000 INFO L225 Difference]: With dead ends: 299 [2019-10-15 01:07:23,000 INFO L226 Difference]: Without dead ends: 214 [2019-10-15 01:07:23,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:07:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-15 01:07:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-10-15 01:07:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 01:07:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 220 transitions. [2019-10-15 01:07:23,019 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 220 transitions. Word has length 158 [2019-10-15 01:07:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:23,019 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 220 transitions. [2019-10-15 01:07:23,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 220 transitions. [2019-10-15 01:07:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:07:23,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:23,021 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:23,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:23,233 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash -924540719, now seen corresponding path program 1 times [2019-10-15 01:07:23,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:23,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375978690] [2019-10-15 01:07:23,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:23,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:23,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:07:23,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375978690] [2019-10-15 01:07:23,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84473911] [2019-10-15 01:07:23,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:07:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:23,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-15 01:07:23,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:07:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:07:24,185 INFO L321 TraceCheckSpWp]: Computing backward predicates...