java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:37,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:37,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:37,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:37,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:37,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:37,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:37,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:37,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:37,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:37,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:37,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:37,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:37,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:37,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:37,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:37,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:37,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:37,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:37,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:37,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:37,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:37,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:37,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:37,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:37,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:37,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:37,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:37,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:37,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:37,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:37,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:37,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:37,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:37,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:37,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:37,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:37,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:37,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:37,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:37,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:37,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:37,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:37,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:37,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:37,780 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:37,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:37,781 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:37,781 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:37,781 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:37,782 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:37,782 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:37,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:37,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:37,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:37,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:37,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:37,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:37,785 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:37,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:37,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:37,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:37,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:37,786 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:37,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:37,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:37,786 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:37,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:37,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:37,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:37,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:37,830 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:37,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-09-20 13:26:37,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2032318d/ed8594c1e11143cf8eb0b46499ad5ede/FLAG2a4d13d1e [2019-09-20 13:26:38,530 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:38,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-09-20 13:26:38,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2032318d/ed8594c1e11143cf8eb0b46499ad5ede/FLAG2a4d13d1e [2019-09-20 13:26:38,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2032318d/ed8594c1e11143cf8eb0b46499ad5ede [2019-09-20 13:26:38,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:38,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:38,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:38,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:38,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:38,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:38" (1/1) ... [2019-09-20 13:26:38,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb00ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:38, skipping insertion in model container [2019-09-20 13:26:38,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:38" (1/1) ... [2019-09-20 13:26:38,748 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:38,844 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:39,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:39,478 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:39,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:39,717 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:39,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39 WrapperNode [2019-09-20 13:26:39,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:39,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:39,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:39,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:39,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:39,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:39,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:39,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:39,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:39,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:39,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:39,951 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-09-20 13:26:39,952 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-09-20 13:26:39,953 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-09-20 13:26:39,953 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-09-20 13:26:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-09-20 13:26:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-09-20 13:26:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-09-20 13:26:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-09-20 13:26:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-09-20 13:26:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 13:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-09-20 13:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-09-20 13:26:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-09-20 13:26:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:40,510 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:40,630 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 13:26:40,630 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 13:26:40,645 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:40,693 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 13:26:40,693 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 13:26:40,723 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:40,760 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:40,760 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:40,852 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:40,923 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-09-20 13:26:40,924 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 13:26:40,924 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 13:26:40,930 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,119 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-09-20 13:26:41,120 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-09-20 13:26:41,121 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,158 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-20 13:26:41,158 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-20 13:26:41,189 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,211 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 13:26:41,212 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 13:26:41,217 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,434 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-20 13:26:41,434 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-20 13:26:41,454 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,460 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 13:26:41,460 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 13:26:41,475 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:41,475 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:41,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:41 BoogieIcfgContainer [2019-09-20 13:26:41,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:41,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:41,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:41,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:41,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:38" (1/3) ... [2019-09-20 13:26:41,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b28b7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:41, skipping insertion in model container [2019-09-20 13:26:41,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39" (2/3) ... [2019-09-20 13:26:41,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b28b7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:41, skipping insertion in model container [2019-09-20 13:26:41,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:41" (3/3) ... [2019-09-20 13:26:41,485 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-09-20 13:26:41,498 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:41,509 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:41,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:41,555 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:41,556 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:41,556 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:41,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:41,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:41,556 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:41,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:41,557 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2019-09-20 13:26:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:41,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:41,599 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:41,601 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2019-09-20 13:26:41,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:41,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:41,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:41,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-09-20 13:26:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:41,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:41,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:41,960 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2019-09-20 13:26:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,175 INFO L93 Difference]: Finished difference Result 525 states and 768 transitions. [2019-09-20 13:26:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,198 INFO L225 Difference]: With dead ends: 525 [2019-09-20 13:26:42,198 INFO L226 Difference]: Without dead ends: 509 [2019-09-20 13:26:42,202 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-20 13:26:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-09-20 13:26:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-20 13:26:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2019-09-20 13:26:42,315 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2019-09-20 13:26:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:42,316 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2019-09-20 13:26:42,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2019-09-20 13:26:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:42,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,318 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:42,319 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2019-09-20 13:26:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,563 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2019-09-20 13:26:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,876 INFO L93 Difference]: Finished difference Result 675 states and 960 transitions. [2019-09-20 13:26:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,891 INFO L225 Difference]: With dead ends: 675 [2019-09-20 13:26:42,892 INFO L226 Difference]: Without dead ends: 674 [2019-09-20 13:26:42,893 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-20 13:26:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-20 13:26:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2019-09-20 13:26:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-20 13:26:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2019-09-20 13:26:42,960 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2019-09-20 13:26:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:42,961 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2019-09-20 13:26:42,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2019-09-20 13:26:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:42,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,969 INFO L407 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-09-20 13:26:42,970 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -584641203, now seen corresponding path program 1 times [2019-09-20 13:26:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,113 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2019-09-20 13:26:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,162 INFO L93 Difference]: Finished difference Result 823 states and 1156 transitions. [2019-09-20 13:26:43,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,170 INFO L225 Difference]: With dead ends: 823 [2019-09-20 13:26:43,171 INFO L226 Difference]: Without dead ends: 823 [2019-09-20 13:26:43,171 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-09-20 13:26:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2019-09-20 13:26:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-20 13:26:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2019-09-20 13:26:43,224 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2019-09-20 13:26:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,225 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2019-09-20 13:26:43,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2019-09-20 13:26:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:43,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,228 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,228 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1008074, now seen corresponding path program 1 times [2019-09-20 13:26:43,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,303 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2019-09-20 13:26:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,502 INFO L93 Difference]: Finished difference Result 1164 states and 1714 transitions. [2019-09-20 13:26:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,511 INFO L225 Difference]: With dead ends: 1164 [2019-09-20 13:26:43,512 INFO L226 Difference]: Without dead ends: 1164 [2019-09-20 13:26:43,512 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-20 13:26:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2019-09-20 13:26:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-20 13:26:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2019-09-20 13:26:43,558 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2019-09-20 13:26:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,558 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2019-09-20 13:26:43,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2019-09-20 13:26:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:43,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,561 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,561 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash -269643889, now seen corresponding path program 1 times [2019-09-20 13:26:43,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:43,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:43,669 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2019-09-20 13:26:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,777 INFO L93 Difference]: Finished difference Result 990 states and 1440 transitions. [2019-09-20 13:26:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:44,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 13:26:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,788 INFO L225 Difference]: With dead ends: 990 [2019-09-20 13:26:44,788 INFO L226 Difference]: Without dead ends: 990 [2019-09-20 13:26:44,789 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-09-20 13:26:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2019-09-20 13:26:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-20 13:26:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2019-09-20 13:26:44,841 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2019-09-20 13:26:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,844 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2019-09-20 13:26:44,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2019-09-20 13:26:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:26:44,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,849 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,850 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash 428268071, now seen corresponding path program 1 times [2019-09-20 13:26:44,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,952 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2019-09-20 13:26:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,081 INFO L93 Difference]: Finished difference Result 888 states and 1299 transitions. [2019-09-20 13:26:45,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:26:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,089 INFO L225 Difference]: With dead ends: 888 [2019-09-20 13:26:45,089 INFO L226 Difference]: Without dead ends: 888 [2019-09-20 13:26:45,090 INFO L636 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-09-20 13:26:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-20 13:26:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2019-09-20 13:26:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-20 13:26:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2019-09-20 13:26:45,126 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2019-09-20 13:26:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,126 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2019-09-20 13:26:45,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2019-09-20 13:26:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:26:45,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,130 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,130 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1410155750, now seen corresponding path program 1 times [2019-09-20 13:26:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,197 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2019-09-20 13:26:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,230 INFO L93 Difference]: Finished difference Result 1019 states and 1459 transitions. [2019-09-20 13:26:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 13:26:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,238 INFO L225 Difference]: With dead ends: 1019 [2019-09-20 13:26:45,238 INFO L226 Difference]: Without dead ends: 1019 [2019-09-20 13:26:45,239 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-20 13:26:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2019-09-20 13:26:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-20 13:26:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2019-09-20 13:26:45,272 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2019-09-20 13:26:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,273 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2019-09-20 13:26:45,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2019-09-20 13:26:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:26:45,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,276 INFO L407 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-09-20 13:26:45,276 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2019-09-20 13:26:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,353 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2019-09-20 13:26:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,395 INFO L93 Difference]: Finished difference Result 956 states and 1340 transitions. [2019-09-20 13:26:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-20 13:26:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,406 INFO L225 Difference]: With dead ends: 956 [2019-09-20 13:26:45,406 INFO L226 Difference]: Without dead ends: 956 [2019-09-20 13:26:45,407 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-20 13:26:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2019-09-20 13:26:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 13:26:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2019-09-20 13:26:45,437 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2019-09-20 13:26:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,437 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2019-09-20 13:26:45,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2019-09-20 13:26:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:45,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,440 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,441 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -539598420, now seen corresponding path program 1 times [2019-09-20 13:26:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,497 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2019-09-20 13:26:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,523 INFO L93 Difference]: Finished difference Result 933 states and 1312 transitions. [2019-09-20 13:26:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:26:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,529 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:26:45,530 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:26:45,531 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:26:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2019-09-20 13:26:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 13:26:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2019-09-20 13:26:45,562 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2019-09-20 13:26:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,563 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2019-09-20 13:26:45,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2019-09-20 13:26:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:45,567 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,567 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,568 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1793960754, now seen corresponding path program 1 times [2019-09-20 13:26:45,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:45,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:45,644 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2019-09-20 13:26:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,998 INFO L93 Difference]: Finished difference Result 793 states and 1106 transitions. [2019-09-20 13:26:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:45,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 13:26:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,003 INFO L225 Difference]: With dead ends: 793 [2019-09-20 13:26:46,004 INFO L226 Difference]: Without dead ends: 793 [2019-09-20 13:26:46,004 INFO L636 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-09-20 13:26:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-20 13:26:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2019-09-20 13:26:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-20 13:26:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2019-09-20 13:26:46,032 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2019-09-20 13:26:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,032 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2019-09-20 13:26:46,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2019-09-20 13:26:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:46,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,035 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,036 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2019-09-20 13:26:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,089 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2019-09-20 13:26:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,113 INFO L93 Difference]: Finished difference Result 783 states and 1092 transitions. [2019-09-20 13:26:46,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-20 13:26:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,118 INFO L225 Difference]: With dead ends: 783 [2019-09-20 13:26:46,119 INFO L226 Difference]: Without dead ends: 783 [2019-09-20 13:26:46,120 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-20 13:26:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2019-09-20 13:26:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-20 13:26:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2019-09-20 13:26:46,145 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2019-09-20 13:26:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,146 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2019-09-20 13:26:46,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2019-09-20 13:26:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:26:46,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,150 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,152 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2019-09-20 13:26:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,224 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2019-09-20 13:26:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,319 INFO L93 Difference]: Finished difference Result 943 states and 1307 transitions. [2019-09-20 13:26:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-20 13:26:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,324 INFO L225 Difference]: With dead ends: 943 [2019-09-20 13:26:46,325 INFO L226 Difference]: Without dead ends: 943 [2019-09-20 13:26:46,325 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-20 13:26:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2019-09-20 13:26:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:26:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2019-09-20 13:26:46,353 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2019-09-20 13:26:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,353 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2019-09-20 13:26:46,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2019-09-20 13:26:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:26:46,356 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,356 INFO L407 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-09-20 13:26:46,356 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2019-09-20 13:26:46,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:46,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:46,434 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2019-09-20 13:26:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,574 INFO L93 Difference]: Finished difference Result 860 states and 1186 transitions. [2019-09-20 13:26:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:46,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:26:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,579 INFO L225 Difference]: With dead ends: 860 [2019-09-20 13:26:46,579 INFO L226 Difference]: Without dead ends: 859 [2019-09-20 13:26:46,580 INFO L636 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-09-20 13:26:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-20 13:26:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2019-09-20 13:26:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-09-20 13:26:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2019-09-20 13:26:46,603 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2019-09-20 13:26:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,603 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2019-09-20 13:26:46,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2019-09-20 13:26:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:26:46,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,606 INFO L407 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-09-20 13:26:46,607 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2019-09-20 13:26:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:46,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:46,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:46,693 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2019-09-20 13:26:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,794 INFO L93 Difference]: Finished difference Result 895 states and 1231 transitions. [2019-09-20 13:26:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:46,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:26:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,801 INFO L225 Difference]: With dead ends: 895 [2019-09-20 13:26:46,801 INFO L226 Difference]: Without dead ends: 877 [2019-09-20 13:26:46,802 INFO L636 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-09-20 13:26:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-09-20 13:26:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2019-09-20 13:26:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 13:26:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2019-09-20 13:26:46,831 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2019-09-20 13:26:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,832 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2019-09-20 13:26:46,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2019-09-20 13:26:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:46,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,838 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,839 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2019-09-20 13:26:46,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:46,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:46,892 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2019-09-20 13:26:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,931 INFO L93 Difference]: Finished difference Result 879 states and 1208 transitions. [2019-09-20 13:26:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:46,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:26:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,936 INFO L225 Difference]: With dead ends: 879 [2019-09-20 13:26:46,936 INFO L226 Difference]: Without dead ends: 879 [2019-09-20 13:26:46,938 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-20 13:26:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2019-09-20 13:26:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 13:26:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2019-09-20 13:26:46,971 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2019-09-20 13:26:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,971 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2019-09-20 13:26:46,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2019-09-20 13:26:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:46,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,974 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,974 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2019-09-20 13:26:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:26:47,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:26:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:26:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:47,077 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2019-09-20 13:26:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,293 INFO L93 Difference]: Finished difference Result 997 states and 1423 transitions. [2019-09-20 13:26:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:48,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-20 13:26:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,299 INFO L225 Difference]: With dead ends: 997 [2019-09-20 13:26:48,299 INFO L226 Difference]: Without dead ends: 997 [2019-09-20 13:26:48,300 INFO L636 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-09-20 13:26:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-20 13:26:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2019-09-20 13:26:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-09-20 13:26:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2019-09-20 13:26:48,327 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2019-09-20 13:26:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,328 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2019-09-20 13:26:48,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:26:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2019-09-20 13:26:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:48,331 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,331 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,331 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2019-09-20 13:26:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:48,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:48,377 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2019-09-20 13:26:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,450 INFO L93 Difference]: Finished difference Result 1016 states and 1375 transitions. [2019-09-20 13:26:48,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:48,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 13:26:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,456 INFO L225 Difference]: With dead ends: 1016 [2019-09-20 13:26:48,456 INFO L226 Difference]: Without dead ends: 998 [2019-09-20 13:26:48,456 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-20 13:26:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2019-09-20 13:26:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-20 13:26:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2019-09-20 13:26:48,481 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2019-09-20 13:26:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,482 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2019-09-20 13:26:48,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2019-09-20 13:26:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:48,486 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,486 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,486 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2019-09-20 13:26:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:26:48,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:26:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:26:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:26:48,774 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 15 states. [2019-09-20 13:26:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,830 INFO L93 Difference]: Finished difference Result 1074 states and 1498 transitions. [2019-09-20 13:26:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:26:52,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-09-20 13:26:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,836 INFO L225 Difference]: With dead ends: 1074 [2019-09-20 13:26:52,836 INFO L226 Difference]: Without dead ends: 1056 [2019-09-20 13:26:52,837 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:26:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-20 13:26:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 891. [2019-09-20 13:26:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-20 13:26:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1202 transitions. [2019-09-20 13:26:52,864 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1202 transitions. Word has length 50 [2019-09-20 13:26:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,864 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1202 transitions. [2019-09-20 13:26:52,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:26:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1202 transitions. [2019-09-20 13:26:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:52,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,871 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,871 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash -120624203, now seen corresponding path program 1 times [2019-09-20 13:26:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:52,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:53,001 INFO L87 Difference]: Start difference. First operand 891 states and 1202 transitions. Second operand 10 states. [2019-09-20 13:26:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,623 INFO L93 Difference]: Finished difference Result 1161 states and 1616 transitions. [2019-09-20 13:26:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:26:55,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-20 13:26:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,628 INFO L225 Difference]: With dead ends: 1161 [2019-09-20 13:26:55,629 INFO L226 Difference]: Without dead ends: 1144 [2019-09-20 13:26:55,629 INFO L636 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-09-20 13:26:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-20 13:26:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 895. [2019-09-20 13:26:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-20 13:26:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1204 transitions. [2019-09-20 13:26:55,655 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1204 transitions. Word has length 50 [2019-09-20 13:26:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,655 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1204 transitions. [2019-09-20 13:26:55,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1204 transitions. [2019-09-20 13:26:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:26:55,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,665 INFO L407 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-09-20 13:26:55,666 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2019-09-20 13:26:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,722 INFO L87 Difference]: Start difference. First operand 895 states and 1204 transitions. Second operand 3 states. [2019-09-20 13:26:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,773 INFO L93 Difference]: Finished difference Result 918 states and 1230 transitions. [2019-09-20 13:26:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-20 13:26:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,778 INFO L225 Difference]: With dead ends: 918 [2019-09-20 13:26:55,778 INFO L226 Difference]: Without dead ends: 918 [2019-09-20 13:26:55,779 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-20 13:26:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2019-09-20 13:26:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-20 13:26:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1225 transitions. [2019-09-20 13:26:55,803 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1225 transitions. Word has length 52 [2019-09-20 13:26:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,804 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1225 transitions. [2019-09-20 13:26:55,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1225 transitions. [2019-09-20 13:26:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:26:55,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,810 INFO L407 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-09-20 13:26:55,810 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2019-09-20 13:26:55,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,862 INFO L87 Difference]: Start difference. First operand 912 states and 1225 transitions. Second operand 3 states. [2019-09-20 13:26:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,917 INFO L93 Difference]: Finished difference Result 881 states and 1185 transitions. [2019-09-20 13:26:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:26:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,922 INFO L225 Difference]: With dead ends: 881 [2019-09-20 13:26:55,922 INFO L226 Difference]: Without dead ends: 881 [2019-09-20 13:26:55,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-20 13:26:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2019-09-20 13:26:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:26:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1185 transitions. [2019-09-20 13:26:55,950 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1185 transitions. Word has length 54 [2019-09-20 13:26:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,951 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1185 transitions. [2019-09-20 13:26:55,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1185 transitions. [2019-09-20 13:26:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:55,956 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,956 INFO L407 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-09-20 13:26:55,956 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2019-09-20 13:26:55,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:26:56,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:26:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:26:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:26:56,122 INFO L87 Difference]: Start difference. First operand 881 states and 1185 transitions. Second operand 13 states. [2019-09-20 13:26:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,993 INFO L93 Difference]: Finished difference Result 912 states and 1219 transitions. [2019-09-20 13:26:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:26:57,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-20 13:26:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,001 INFO L225 Difference]: With dead ends: 912 [2019-09-20 13:26:58,001 INFO L226 Difference]: Without dead ends: 912 [2019-09-20 13:26:58,001 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:26:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-20 13:26:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 881. [2019-09-20 13:26:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:26:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1184 transitions. [2019-09-20 13:26:58,023 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1184 transitions. Word has length 53 [2019-09-20 13:26:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,023 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1184 transitions. [2019-09-20 13:26:58,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:26:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1184 transitions. [2019-09-20 13:26:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:58,026 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,026 INFO L407 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-09-20 13:26:58,026 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1853675269, now seen corresponding path program 1 times [2019-09-20 13:26:58,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:58,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:58,135 INFO L87 Difference]: Start difference. First operand 881 states and 1184 transitions. Second operand 10 states. [2019-09-20 13:27:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,833 INFO L93 Difference]: Finished difference Result 1132 states and 1578 transitions. [2019-09-20 13:27:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:27:00,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-20 13:27:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,841 INFO L225 Difference]: With dead ends: 1132 [2019-09-20 13:27:00,841 INFO L226 Difference]: Without dead ends: 1132 [2019-09-20 13:27:00,842 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 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-09-20 13:27:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-09-20 13:27:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 881. [2019-09-20 13:27:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:27:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1183 transitions. [2019-09-20 13:27:00,874 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1183 transitions. Word has length 53 [2019-09-20 13:27:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,874 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1183 transitions. [2019-09-20 13:27:00,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1183 transitions. [2019-09-20 13:27:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:27:00,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,877 INFO L407 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-09-20 13:27:00,878 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2019-09-20 13:27:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:01,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:01,008 INFO L87 Difference]: Start difference. First operand 881 states and 1183 transitions. Second operand 11 states. [2019-09-20 13:27:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,316 INFO L93 Difference]: Finished difference Result 901 states and 1204 transitions. [2019-09-20 13:27:02,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:02,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-20 13:27:02,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,321 INFO L225 Difference]: With dead ends: 901 [2019-09-20 13:27:02,321 INFO L226 Difference]: Without dead ends: 880 [2019-09-20 13:27:02,321 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:27:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-09-20 13:27:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2019-09-20 13:27:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-09-20 13:27:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1181 transitions. [2019-09-20 13:27:02,340 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1181 transitions. Word has length 52 [2019-09-20 13:27:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,341 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1181 transitions. [2019-09-20 13:27:02,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1181 transitions. [2019-09-20 13:27:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:27:02,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,344 INFO L407 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-09-20 13:27:02,344 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2080253382, now seen corresponding path program 1 times [2019-09-20 13:27:02,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:02,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:02,400 INFO L87 Difference]: Start difference. First operand 880 states and 1181 transitions. Second operand 5 states. [2019-09-20 13:27:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,975 INFO L93 Difference]: Finished difference Result 891 states and 1191 transitions. [2019-09-20 13:27:02,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:27:02,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-20 13:27:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,980 INFO L225 Difference]: With dead ends: 891 [2019-09-20 13:27:02,980 INFO L226 Difference]: Without dead ends: 860 [2019-09-20 13:27:02,980 INFO L636 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-09-20 13:27:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-09-20 13:27:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 852. [2019-09-20 13:27:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:27:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1151 transitions. [2019-09-20 13:27:03,001 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1151 transitions. Word has length 52 [2019-09-20 13:27:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:03,001 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1151 transitions. [2019-09-20 13:27:03,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1151 transitions. [2019-09-20 13:27:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:03,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:03,004 INFO L407 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-09-20 13:27:03,004 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:03,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2019-09-20 13:27:03,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:03,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:27:03,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:27:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:27:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:03,147 INFO L87 Difference]: Start difference. First operand 852 states and 1151 transitions. Second operand 13 states. [2019-09-20 13:27:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,019 INFO L93 Difference]: Finished difference Result 881 states and 1182 transitions. [2019-09-20 13:27:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:27:05,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-09-20 13:27:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,024 INFO L225 Difference]: With dead ends: 881 [2019-09-20 13:27:05,024 INFO L226 Difference]: Without dead ends: 881 [2019-09-20 13:27:05,024 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:27:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-20 13:27:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 852. [2019-09-20 13:27:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:27:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-09-20 13:27:05,044 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 54 [2019-09-20 13:27:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,044 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-09-20 13:27:05,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:27:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-09-20 13:27:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:05,050 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,051 INFO L407 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-09-20 13:27:05,051 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1485113554, now seen corresponding path program 1 times [2019-09-20 13:27:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:05,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:05,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:05,152 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 9 states. [2019-09-20 13:27:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,311 INFO L93 Difference]: Finished difference Result 1107 states and 1544 transitions. [2019-09-20 13:27:07,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:27:07,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:27:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,317 INFO L225 Difference]: With dead ends: 1107 [2019-09-20 13:27:07,318 INFO L226 Difference]: Without dead ends: 1107 [2019-09-20 13:27:07,318 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:27:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-09-20 13:27:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 861. [2019-09-20 13:27:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-09-20 13:27:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2019-09-20 13:27:07,340 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 55 [2019-09-20 13:27:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,340 INFO L475 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2019-09-20 13:27:07,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2019-09-20 13:27:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:07,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,343 INFO L407 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-09-20 13:27:07,343 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2019-09-20 13:27:07,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:07,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:07,429 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2019-09-20 13:27:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,600 INFO L93 Difference]: Finished difference Result 885 states and 1201 transitions. [2019-09-20 13:27:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:27:07,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:27:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,606 INFO L225 Difference]: With dead ends: 885 [2019-09-20 13:27:07,606 INFO L226 Difference]: Without dead ends: 852 [2019-09-20 13:27:07,607 INFO L636 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-09-20 13:27:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-20 13:27:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2019-09-20 13:27:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:27:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-09-20 13:27:07,624 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2019-09-20 13:27:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,624 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-09-20 13:27:07,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-09-20 13:27:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:27:07,627 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,627 INFO L407 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-09-20 13:27:07,628 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2119637056, now seen corresponding path program 1 times [2019-09-20 13:27:07,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:07,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:27:07,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:27:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:27:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:27:07,771 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2019-09-20 13:27:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,020 INFO L93 Difference]: Finished difference Result 865 states and 1164 transitions. [2019-09-20 13:27:08,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:27:08,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:27:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,025 INFO L225 Difference]: With dead ends: 865 [2019-09-20 13:27:08,025 INFO L226 Difference]: Without dead ends: 850 [2019-09-20 13:27:08,025 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-20 13:27:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2019-09-20 13:27:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-20 13:27:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2019-09-20 13:27:08,042 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2019-09-20 13:27:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,042 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2019-09-20 13:27:08,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2019-09-20 13:27:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:08,045 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,046 INFO L407 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-09-20 13:27:08,046 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 100740086, now seen corresponding path program 1 times [2019-09-20 13:27:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:27:08,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:27:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:27:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:27:08,165 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2019-09-20 13:27:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,399 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2019-09-20 13:27:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:27:08,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-09-20 13:27:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,404 INFO L225 Difference]: With dead ends: 860 [2019-09-20 13:27:08,404 INFO L226 Difference]: Without dead ends: 845 [2019-09-20 13:27:08,405 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-20 13:27:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2019-09-20 13:27:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-09-20 13:27:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2019-09-20 13:27:08,425 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2019-09-20 13:27:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,426 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2019-09-20 13:27:08,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2019-09-20 13:27:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:27:08,429 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,429 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:27:08,430 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash 463394390, now seen corresponding path program 1 times [2019-09-20 13:27:08,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:08,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:08,481 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 3 states. [2019-09-20 13:27:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,497 INFO L93 Difference]: Finished difference Result 935 states and 1252 transitions. [2019-09-20 13:27:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:08,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:27:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,500 INFO L225 Difference]: With dead ends: 935 [2019-09-20 13:27:08,501 INFO L226 Difference]: Without dead ends: 935 [2019-09-20 13:27:08,501 INFO L636 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-09-20 13:27:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-20 13:27:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 904. [2019-09-20 13:27:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:27:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2019-09-20 13:27:08,518 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 74 [2019-09-20 13:27:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,518 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2019-09-20 13:27:08,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2019-09-20 13:27:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:08,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,521 INFO L407 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-09-20 13:27:08,521 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash -534409564, now seen corresponding path program 1 times [2019-09-20 13:27:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:08,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:08,658 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand 12 states. [2019-09-20 13:27:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,957 INFO L93 Difference]: Finished difference Result 927 states and 1240 transitions. [2019-09-20 13:27:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:08,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-09-20 13:27:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,963 INFO L225 Difference]: With dead ends: 927 [2019-09-20 13:27:08,964 INFO L226 Difference]: Without dead ends: 905 [2019-09-20 13:27:08,964 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-20 13:27:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2019-09-20 13:27:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-20 13:27:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1204 transitions. [2019-09-20 13:27:08,982 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1204 transitions. Word has length 59 [2019-09-20 13:27:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,982 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1204 transitions. [2019-09-20 13:27:08,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1204 transitions. [2019-09-20 13:27:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:08,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,985 INFO L407 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-09-20 13:27:08,985 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2019-09-20 13:27:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:09,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:09,128 INFO L87 Difference]: Start difference. First operand 903 states and 1204 transitions. Second operand 11 states. [2019-09-20 13:27:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,407 INFO L93 Difference]: Finished difference Result 917 states and 1219 transitions. [2019-09-20 13:27:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:09,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-20 13:27:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,410 INFO L225 Difference]: With dead ends: 917 [2019-09-20 13:27:09,410 INFO L226 Difference]: Without dead ends: 900 [2019-09-20 13:27:09,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-20 13:27:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2019-09-20 13:27:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 13:27:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1199 transitions. [2019-09-20 13:27:09,429 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1199 transitions. Word has length 58 [2019-09-20 13:27:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,430 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1199 transitions. [2019-09-20 13:27:09,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1199 transitions. [2019-09-20 13:27:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:09,433 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,433 INFO L407 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-09-20 13:27:09,433 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,433 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2019-09-20 13:27:09,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,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-09-20 13:27:09,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:27:09,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:27:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:27:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:27:09,552 INFO L87 Difference]: Start difference. First operand 900 states and 1199 transitions. Second operand 10 states. [2019-09-20 13:27:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,863 INFO L93 Difference]: Finished difference Result 935 states and 1240 transitions. [2019-09-20 13:27:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:09,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-20 13:27:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,867 INFO L225 Difference]: With dead ends: 935 [2019-09-20 13:27:09,867 INFO L226 Difference]: Without dead ends: 858 [2019-09-20 13:27:09,867 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-20 13:27:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 855. [2019-09-20 13:27:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1118 transitions. [2019-09-20 13:27:09,881 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1118 transitions. Word has length 59 [2019-09-20 13:27:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,882 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1118 transitions. [2019-09-20 13:27:09,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1118 transitions. [2019-09-20 13:27:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:09,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,884 INFO L407 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] [2019-09-20 13:27:09,884 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2019-09-20 13:27:09,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,936 INFO L87 Difference]: Start difference. First operand 855 states and 1118 transitions. Second operand 4 states. [2019-09-20 13:27:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,063 INFO L93 Difference]: Finished difference Result 904 states and 1199 transitions. [2019-09-20 13:27:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:27:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,068 INFO L225 Difference]: With dead ends: 904 [2019-09-20 13:27:10,069 INFO L226 Difference]: Without dead ends: 904 [2019-09-20 13:27:10,069 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-20 13:27:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 862. [2019-09-20 13:27:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-09-20 13:27:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1133 transitions. [2019-09-20 13:27:10,092 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1133 transitions. Word has length 60 [2019-09-20 13:27:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,093 INFO L475 AbstractCegarLoop]: Abstraction has 862 states and 1133 transitions. [2019-09-20 13:27:10,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1133 transitions. [2019-09-20 13:27:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:10,097 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,098 INFO L407 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] [2019-09-20 13:27:10,098 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2019-09-20 13:27:10,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:10,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:10,290 INFO L87 Difference]: Start difference. First operand 862 states and 1133 transitions. Second operand 11 states. [2019-09-20 13:27:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,430 INFO L93 Difference]: Finished difference Result 899 states and 1190 transitions. [2019-09-20 13:27:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:10,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-20 13:27:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,438 INFO L225 Difference]: With dead ends: 899 [2019-09-20 13:27:10,438 INFO L226 Difference]: Without dead ends: 876 [2019-09-20 13:27:10,440 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-09-20 13:27:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 866. [2019-09-20 13:27:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-09-20 13:27:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1150 transitions. [2019-09-20 13:27:10,464 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1150 transitions. Word has length 60 [2019-09-20 13:27:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,465 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1150 transitions. [2019-09-20 13:27:10,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1150 transitions. [2019-09-20 13:27:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:10,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,469 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,469 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1325266492, now seen corresponding path program 1 times [2019-09-20 13:27:10,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:10,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:10,601 INFO L87 Difference]: Start difference. First operand 866 states and 1150 transitions. Second operand 12 states. [2019-09-20 13:27:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,832 INFO L93 Difference]: Finished difference Result 887 states and 1172 transitions. [2019-09-20 13:27:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:10,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-09-20 13:27:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,835 INFO L225 Difference]: With dead ends: 887 [2019-09-20 13:27:10,836 INFO L226 Difference]: Without dead ends: 866 [2019-09-20 13:27:10,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-20 13:27:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 864. [2019-09-20 13:27:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-20 13:27:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1146 transitions. [2019-09-20 13:27:10,859 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1146 transitions. Word has length 67 [2019-09-20 13:27:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,860 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1146 transitions. [2019-09-20 13:27:10,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1146 transitions. [2019-09-20 13:27:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:10,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,864 INFO L407 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-09-20 13:27:10,864 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash -640820552, now seen corresponding path program 1 times [2019-09-20 13:27:10,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,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-09-20 13:27:11,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:11,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:11,017 INFO L87 Difference]: Start difference. First operand 864 states and 1146 transitions. Second operand 12 states. [2019-09-20 13:27:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,225 INFO L93 Difference]: Finished difference Result 883 states and 1166 transitions. [2019-09-20 13:27:11,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:11,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-09-20 13:27:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,229 INFO L225 Difference]: With dead ends: 883 [2019-09-20 13:27:11,229 INFO L226 Difference]: Without dead ends: 862 [2019-09-20 13:27:11,230 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-20 13:27:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-09-20 13:27:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-09-20 13:27:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1142 transitions. [2019-09-20 13:27:11,246 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1142 transitions. Word has length 63 [2019-09-20 13:27:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,246 INFO L475 AbstractCegarLoop]: Abstraction has 862 states and 1142 transitions. [2019-09-20 13:27:11,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1142 transitions. [2019-09-20 13:27:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:11,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,250 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,250 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1363000993, now seen corresponding path program 1 times [2019-09-20 13:27:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:11,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:11,376 INFO L87 Difference]: Start difference. First operand 862 states and 1142 transitions. Second operand 12 states. [2019-09-20 13:27:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,639 INFO L93 Difference]: Finished difference Result 883 states and 1164 transitions. [2019-09-20 13:27:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:11,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-09-20 13:27:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,642 INFO L225 Difference]: With dead ends: 883 [2019-09-20 13:27:11,642 INFO L226 Difference]: Without dead ends: 862 [2019-09-20 13:27:11,643 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-20 13:27:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 860. [2019-09-20 13:27:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-20 13:27:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1138 transitions. [2019-09-20 13:27:11,659 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1138 transitions. Word has length 66 [2019-09-20 13:27:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,660 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1138 transitions. [2019-09-20 13:27:11,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1138 transitions. [2019-09-20 13:27:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:11,664 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,664 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,665 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash -897434082, now seen corresponding path program 1 times [2019-09-20 13:27:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,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-09-20 13:27:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:11,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:11,834 INFO L87 Difference]: Start difference. First operand 860 states and 1138 transitions. Second operand 12 states.