/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:37:01,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:37:01,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:37:01,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:37:01,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:37:02,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:37:02,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:37:02,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:37:02,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:37:02,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:37:02,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:37:02,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:37:02,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:37:02,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:37:02,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:37:02,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:37:02,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:37:02,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:37:02,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:37:02,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:37:02,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:37:02,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:37:02,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:37:02,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:37:02,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:37:02,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:37:02,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:37:02,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:37:02,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:37:02,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:37:02,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:37:02,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:37:02,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:37:02,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:37:02,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:37:02,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:37:02,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:37:02,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:37:02,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:37:02,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:37:02,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:37:02,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:37:02,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:37:02,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:37:02,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:37:02,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:37:02,068 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:37:02,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:37:02,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:37:02,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:37:02,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:37:02,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:37:02,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:37:02,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:37:02,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:37:02,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:37:02,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:37:02,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:37:02,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:37:02,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:37:02,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:37:02,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:37:02,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:37:02,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:02,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:37:02,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:37:02,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:37:02,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:37:02,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:37:02,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:37:02,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:37:02,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:37:02,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:37:02,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:37:02,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:37:02,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:37:02,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-11-07 00:37:02,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2110d77/fc4b91db61d44c1caa611353b36d4fed/FLAGf33fc20c6 [2019-11-07 00:37:02,981 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:37:02,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-11-07 00:37:03,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2110d77/fc4b91db61d44c1caa611353b36d4fed/FLAGf33fc20c6 [2019-11-07 00:37:03,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2110d77/fc4b91db61d44c1caa611353b36d4fed [2019-11-07 00:37:03,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:37:03,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:37:03,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:03,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:37:03,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:37:03,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:03,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314bd3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03, skipping insertion in model container [2019-11-07 00:37:03,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:03,204 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:37:03,266 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:37:03,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:03,792 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:37:03,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:03,998 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:37:03,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03 WrapperNode [2019-11-07 00:37:03,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:03,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:37:03,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:37:03,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:37:04,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... [2019-11-07 00:37:04,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:37:04,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:37:04,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:37:04,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:37:04,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:37:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:37:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 00:37:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 00:37:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-11-07 00:37:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-11-07 00:37:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-11-07 00:37:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-11-07 00:37:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-11-07 00:37:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-11-07 00:37:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-11-07 00:37:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 00:37:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 00:37:04,198 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-07 00:37:04,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-11-07 00:37:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:37:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 00:37:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:37:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-11-07 00:37:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-11-07 00:37:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 00:37:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-11-07 00:37:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 00:37:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:37:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 00:37:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:37:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:37:04,823 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:04,928 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-11-07 00:37:04,929 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-11-07 00:37:04,935 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:04,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-11-07 00:37:04,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-11-07 00:37:05,034 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,064 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 00:37:05,065 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 00:37:05,156 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,241 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-11-07 00:37:05,242 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-11-07 00:37:05,242 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-11-07 00:37:05,248 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,417 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-11-07 00:37:05,418 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-11-07 00:37:05,420 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,453 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-07 00:37:05,453 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-07 00:37:05,484 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,512 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-07 00:37:05,512 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-07 00:37:05,516 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,705 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-11-07 00:37:05,705 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-11-07 00:37:05,718 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:05,723 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 00:37:05,723 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 00:37:05,747 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:37:05,748 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:37:05,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:05 BoogieIcfgContainer [2019-11-07 00:37:05,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:37:05,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:37:05,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:37:05,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:37:05,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:37:03" (1/3) ... [2019-11-07 00:37:05,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e52a11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:05, skipping insertion in model container [2019-11-07 00:37:05,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:03" (2/3) ... [2019-11-07 00:37:05,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e52a11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:05, skipping insertion in model container [2019-11-07 00:37:05,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:05" (3/3) ... [2019-11-07 00:37:05,766 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-11-07 00:37:05,776 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:37:05,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:37:05,797 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:37:05,833 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:37:05,834 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:37:05,834 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:37:05,834 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:37:05,834 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:37:05,834 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:37:05,834 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:37:05,835 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:37:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-11-07 00:37:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:37:05,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:05,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:05,899 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-11-07 00:37:05,917 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:05,918 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720029897] [2019-11-07 00:37:05,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:06,215 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720029897] [2019-11-07 00:37:06,216 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:06,216 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:06,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848686626] [2019-11-07 00:37:06,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:06,224 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:06,241 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-11-07 00:37:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:06,461 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2019-11-07 00:37:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:06,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:37:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:06,480 INFO L225 Difference]: With dead ends: 887 [2019-11-07 00:37:06,481 INFO L226 Difference]: Without dead ends: 507 [2019-11-07 00:37:06,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-07 00:37:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-11-07 00:37:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-07 00:37:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-11-07 00:37:06,596 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-11-07 00:37:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:06,596 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-11-07 00:37:06,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-11-07 00:37:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:37:06,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:06,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:06,599 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:06,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-11-07 00:37:06,600 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:06,600 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207074165] [2019-11-07 00:37:06,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:06,837 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207074165] [2019-11-07 00:37:06,837 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:06,837 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:06,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215670266] [2019-11-07 00:37:06,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:06,839 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:06,842 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-11-07 00:37:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:07,101 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2019-11-07 00:37:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:07,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:37:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:07,113 INFO L225 Difference]: With dead ends: 789 [2019-11-07 00:37:07,114 INFO L226 Difference]: Without dead ends: 670 [2019-11-07 00:37:07,116 INFO L630 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-11-07 00:37:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-07 00:37:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-11-07 00:37:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-07 00:37:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-11-07 00:37:07,194 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-11-07 00:37:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:07,195 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-11-07 00:37:07,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-11-07 00:37:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:37:07,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:07,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:07,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-11-07 00:37:07,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:07,207 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924006544] [2019-11-07 00:37:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:07,303 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924006544] [2019-11-07 00:37:07,303 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:07,303 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:07,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853403662] [2019-11-07 00:37:07,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:07,304 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:07,305 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-11-07 00:37:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:07,366 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-11-07 00:37:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:07,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:37:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:07,374 INFO L225 Difference]: With dead ends: 995 [2019-11-07 00:37:07,374 INFO L226 Difference]: Without dead ends: 819 [2019-11-07 00:37:07,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-07 00:37:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-11-07 00:37:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-07 00:37:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-11-07 00:37:07,447 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-11-07 00:37:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:07,448 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-11-07 00:37:07,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-11-07 00:37:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:37:07,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:07,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:07,451 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:07,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:07,451 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-11-07 00:37:07,451 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:07,452 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307915649] [2019-11-07 00:37:07,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:07,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307915649] [2019-11-07 00:37:07,556 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:07,556 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:07,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209310420] [2019-11-07 00:37:07,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:07,557 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:07,557 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-11-07 00:37:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:07,794 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2019-11-07 00:37:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:07,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:37:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:07,804 INFO L225 Difference]: With dead ends: 1424 [2019-11-07 00:37:07,804 INFO L226 Difference]: Without dead ends: 1160 [2019-11-07 00:37:07,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-07 00:37:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-11-07 00:37:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-11-07 00:37:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-11-07 00:37:07,866 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-11-07 00:37:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:07,867 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-11-07 00:37:07,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-11-07 00:37:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:37:07,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:07,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:07,872 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-11-07 00:37:07,880 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:07,881 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671935294] [2019-11-07 00:37:07,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:07,961 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671935294] [2019-11-07 00:37:07,961 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:07,962 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:07,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695561567] [2019-11-07 00:37:07,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:07,962 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:07,963 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-11-07 00:37:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:08,800 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2019-11-07 00:37:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:08,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-07 00:37:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:08,806 INFO L225 Difference]: With dead ends: 1562 [2019-11-07 00:37:08,806 INFO L226 Difference]: Without dead ends: 984 [2019-11-07 00:37:08,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-07 00:37:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-11-07 00:37:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-07 00:37:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-11-07 00:37:08,857 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-11-07 00:37:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:08,857 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-11-07 00:37:08,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-11-07 00:37:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 00:37:08,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:08,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:08,860 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-11-07 00:37:08,861 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:08,861 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145663633] [2019-11-07 00:37:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:08,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145663633] [2019-11-07 00:37:08,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:08,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:08,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650595896] [2019-11-07 00:37:08,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:08,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:08,921 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-11-07 00:37:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:09,006 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2019-11-07 00:37:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 00:37:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:09,012 INFO L225 Difference]: With dead ends: 890 [2019-11-07 00:37:09,012 INFO L226 Difference]: Without dead ends: 886 [2019-11-07 00:37:09,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-07 00:37:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-11-07 00:37:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-11-07 00:37:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-11-07 00:37:09,058 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-11-07 00:37:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:09,058 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-11-07 00:37:09,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-11-07 00:37:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 00:37:09,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:09,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:09,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:09,062 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-11-07 00:37:09,062 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:09,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773417931] [2019-11-07 00:37:09,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:09,109 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773417931] [2019-11-07 00:37:09,110 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:09,110 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:09,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117824708] [2019-11-07 00:37:09,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:09,110 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,111 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-11-07 00:37:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:09,162 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2019-11-07 00:37:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:09,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-07 00:37:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:09,168 INFO L225 Difference]: With dead ends: 1274 [2019-11-07 00:37:09,169 INFO L226 Difference]: Without dead ends: 1015 [2019-11-07 00:37:09,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-07 00:37:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-11-07 00:37:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-07 00:37:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-11-07 00:37:09,251 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-11-07 00:37:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:09,251 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-11-07 00:37:09,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-11-07 00:37:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 00:37:09,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:09,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:09,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-11-07 00:37:09,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:09,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981941259] [2019-11-07 00:37:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:09,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981941259] [2019-11-07 00:37:09,309 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:09,309 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:09,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057141155] [2019-11-07 00:37:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:09,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,311 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-11-07 00:37:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:09,368 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2019-11-07 00:37:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:09,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-07 00:37:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:09,374 INFO L225 Difference]: With dead ends: 972 [2019-11-07 00:37:09,374 INFO L226 Difference]: Without dead ends: 954 [2019-11-07 00:37:09,375 INFO L630 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-11-07 00:37:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-11-07 00:37:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-11-07 00:37:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-11-07 00:37:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-11-07 00:37:09,418 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-11-07 00:37:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:09,418 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-11-07 00:37:09,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-11-07 00:37:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:09,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:09,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:09,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:09,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-11-07 00:37:09,422 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:09,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008336672] [2019-11-07 00:37:09,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:09,472 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008336672] [2019-11-07 00:37:09,472 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:09,472 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8940416] [2019-11-07 00:37:09,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:09,473 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,474 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-11-07 00:37:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:09,522 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2019-11-07 00:37:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:09,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-07 00:37:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:09,528 INFO L225 Difference]: With dead ends: 1167 [2019-11-07 00:37:09,528 INFO L226 Difference]: Without dead ends: 925 [2019-11-07 00:37:09,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-11-07 00:37:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-11-07 00:37:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-11-07 00:37:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-11-07 00:37:09,572 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-11-07 00:37:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:09,573 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-11-07 00:37:09,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-11-07 00:37:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 00:37:09,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:09,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:09,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-11-07 00:37:09,577 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:09,577 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390516160] [2019-11-07 00:37:09,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:09,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390516160] [2019-11-07 00:37:09,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:09,627 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:09,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753560278] [2019-11-07 00:37:09,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:09,628 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:09,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:09,629 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-11-07 00:37:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:09,993 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2019-11-07 00:37:09,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:09,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-07 00:37:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:09,998 INFO L225 Difference]: With dead ends: 1014 [2019-11-07 00:37:09,998 INFO L226 Difference]: Without dead ends: 785 [2019-11-07 00:37:09,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-07 00:37:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-11-07 00:37:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-07 00:37:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-11-07 00:37:10,036 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-11-07 00:37:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:10,036 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-11-07 00:37:10,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-11-07 00:37:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 00:37:10,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:10,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:10,039 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-11-07 00:37:10,040 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:10,040 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988496452] [2019-11-07 00:37:10,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:10,077 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988496452] [2019-11-07 00:37:10,078 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:10,078 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:10,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311156990] [2019-11-07 00:37:10,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:10,079 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:10,079 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-11-07 00:37:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:10,120 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2019-11-07 00:37:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:10,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-07 00:37:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:10,124 INFO L225 Difference]: With dead ends: 871 [2019-11-07 00:37:10,124 INFO L226 Difference]: Without dead ends: 775 [2019-11-07 00:37:10,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-07 00:37:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-11-07 00:37:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-11-07 00:37:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-11-07 00:37:10,163 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-11-07 00:37:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:10,163 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-11-07 00:37:10,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-11-07 00:37:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 00:37:10,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:10,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:10,166 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-11-07 00:37:10,167 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:10,167 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873152325] [2019-11-07 00:37:10,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:10,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873152325] [2019-11-07 00:37:10,204 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:10,204 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:10,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810259049] [2019-11-07 00:37:10,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:10,205 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:10,205 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-11-07 00:37:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:10,324 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2019-11-07 00:37:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:10,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-07 00:37:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:10,331 INFO L225 Difference]: With dead ends: 938 [2019-11-07 00:37:10,331 INFO L226 Difference]: Without dead ends: 928 [2019-11-07 00:37:10,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-11-07 00:37:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-11-07 00:37:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-11-07 00:37:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-11-07 00:37:10,373 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-11-07 00:37:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:10,373 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-11-07 00:37:10,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-11-07 00:37:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:37:10,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:10,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:10,376 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-11-07 00:37:10,377 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:10,377 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093576244] [2019-11-07 00:37:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:10,440 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093576244] [2019-11-07 00:37:10,440 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:10,440 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:10,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462953398] [2019-11-07 00:37:10,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:10,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:10,442 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-11-07 00:37:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:10,590 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2019-11-07 00:37:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:10,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-07 00:37:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:10,596 INFO L225 Difference]: With dead ends: 851 [2019-11-07 00:37:10,596 INFO L226 Difference]: Without dead ends: 847 [2019-11-07 00:37:10,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-07 00:37:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-11-07 00:37:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-07 00:37:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-11-07 00:37:10,670 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-11-07 00:37:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:10,670 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-11-07 00:37:10,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-11-07 00:37:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:37:10,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:10,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:10,673 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-11-07 00:37:10,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:10,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114760751] [2019-11-07 00:37:10,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:10,736 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114760751] [2019-11-07 00:37:10,737 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:10,737 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:10,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934102245] [2019-11-07 00:37:10,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:10,738 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:10,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:10,738 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-11-07 00:37:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:10,838 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2019-11-07 00:37:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:10,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-07 00:37:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:10,843 INFO L225 Difference]: With dead ends: 886 [2019-11-07 00:37:10,843 INFO L226 Difference]: Without dead ends: 865 [2019-11-07 00:37:10,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-07 00:37:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-11-07 00:37:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-07 00:37:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-11-07 00:37:10,894 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-11-07 00:37:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:10,895 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-11-07 00:37:10,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-11-07 00:37:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:10,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:10,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:10,899 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-11-07 00:37:10,900 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:10,900 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773643880] [2019-11-07 00:37:10,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:10,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773643880] [2019-11-07 00:37:10,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:10,942 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:10,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319661800] [2019-11-07 00:37:10,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:10,943 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:10,944 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-11-07 00:37:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:11,058 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2019-11-07 00:37:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:11,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-07 00:37:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:11,064 INFO L225 Difference]: With dead ends: 1081 [2019-11-07 00:37:11,065 INFO L226 Difference]: Without dead ends: 1049 [2019-11-07 00:37:11,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-11-07 00:37:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-11-07 00:37:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-11-07 00:37:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-11-07 00:37:11,111 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-11-07 00:37:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:11,111 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-11-07 00:37:11,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-11-07 00:37:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:11,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:11,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:11,115 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-11-07 00:37:11,115 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:11,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203198273] [2019-11-07 00:37:11,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:11,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203198273] [2019-11-07 00:37:11,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:11,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:11,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425548428] [2019-11-07 00:37:11,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:11,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:11,151 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-11-07 00:37:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:11,202 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2019-11-07 00:37:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:11,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-07 00:37:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:11,207 INFO L225 Difference]: With dead ends: 966 [2019-11-07 00:37:11,207 INFO L226 Difference]: Without dead ends: 944 [2019-11-07 00:37:11,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-11-07 00:37:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-11-07 00:37:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-11-07 00:37:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-11-07 00:37:11,252 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-11-07 00:37:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:11,252 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-11-07 00:37:11,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-11-07 00:37:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:11,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:11,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:11,256 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-11-07 00:37:11,256 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:11,256 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535964128] [2019-11-07 00:37:11,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:11,319 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535964128] [2019-11-07 00:37:11,319 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:11,319 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:37:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965676830] [2019-11-07 00:37:11,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:37:11,320 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:37:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:11,321 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-11-07 00:37:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:12,410 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2019-11-07 00:37:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:12,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-07 00:37:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:12,417 INFO L225 Difference]: With dead ends: 1110 [2019-11-07 00:37:12,417 INFO L226 Difference]: Without dead ends: 1016 [2019-11-07 00:37:12,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:37:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-07 00:37:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-11-07 00:37:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-11-07 00:37:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-11-07 00:37:12,502 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-11-07 00:37:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:12,502 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-11-07 00:37:12,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:37:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-11-07 00:37:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:12,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:12,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:12,507 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-11-07 00:37:12,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:12,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733325958] [2019-11-07 00:37:12,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:12,790 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733325958] [2019-11-07 00:37:12,790 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:12,791 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 00:37:12,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411910423] [2019-11-07 00:37:12,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 00:37:12,792 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 00:37:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:12,793 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 15 states. [2019-11-07 00:37:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:16,106 INFO L93 Difference]: Finished difference Result 1054 states and 1469 transitions. [2019-11-07 00:37:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-07 00:37:16,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-07 00:37:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:16,114 INFO L225 Difference]: With dead ends: 1054 [2019-11-07 00:37:16,114 INFO L226 Difference]: Without dead ends: 1033 [2019-11-07 00:37:16,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-11-07 00:37:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-11-07 00:37:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 876. [2019-11-07 00:37:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-11-07 00:37:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1182 transitions. [2019-11-07 00:37:16,162 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1182 transitions. Word has length 50 [2019-11-07 00:37:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:16,163 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1182 transitions. [2019-11-07 00:37:16,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 00:37:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1182 transitions. [2019-11-07 00:37:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 00:37:16,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:16,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:16,166 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash -594952383, now seen corresponding path program 1 times [2019-11-07 00:37:16,167 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:16,167 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261406597] [2019-11-07 00:37:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:16,270 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261406597] [2019-11-07 00:37:16,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:16,270 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:16,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898384829] [2019-11-07 00:37:16,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:16,272 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:16,272 INFO L87 Difference]: Start difference. First operand 876 states and 1182 transitions. Second operand 10 states. [2019-11-07 00:37:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,621 INFO L93 Difference]: Finished difference Result 1142 states and 1589 transitions. [2019-11-07 00:37:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 00:37:18,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-07 00:37:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:18,630 INFO L225 Difference]: With dead ends: 1142 [2019-11-07 00:37:18,630 INFO L226 Difference]: Without dead ends: 1121 [2019-11-07 00:37:18,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-07 00:37:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 880. [2019-11-07 00:37:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-11-07 00:37:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2019-11-07 00:37:18,690 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 50 [2019-11-07 00:37:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:18,691 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2019-11-07 00:37:18,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2019-11-07 00:37:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 00:37:18,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:18,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:18,695 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-11-07 00:37:18,696 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:18,696 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974891825] [2019-11-07 00:37:18,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:18,747 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974891825] [2019-11-07 00:37:18,747 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:18,747 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:18,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296085162] [2019-11-07 00:37:18,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:18,749 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:18,750 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 3 states. [2019-11-07 00:37:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,828 INFO L93 Difference]: Finished difference Result 905 states and 1212 transitions. [2019-11-07 00:37:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-07 00:37:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:18,832 INFO L225 Difference]: With dead ends: 905 [2019-11-07 00:37:18,832 INFO L226 Difference]: Without dead ends: 900 [2019-11-07 00:37:18,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-07 00:37:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-11-07 00:37:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-07 00:37:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2019-11-07 00:37:18,877 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 52 [2019-11-07 00:37:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:18,878 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2019-11-07 00:37:18,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2019-11-07 00:37:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 00:37:18,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:18,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:18,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-11-07 00:37:18,882 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:18,882 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909968949] [2019-11-07 00:37:18,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:18,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909968949] [2019-11-07 00:37:18,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:18,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284809867] [2019-11-07 00:37:18,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:18,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:18,921 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand 3 states. [2019-11-07 00:37:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:18,995 INFO L93 Difference]: Finished difference Result 1109 states and 1487 transitions. [2019-11-07 00:37:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:18,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 00:37:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:19,000 INFO L225 Difference]: With dead ends: 1109 [2019-11-07 00:37:19,000 INFO L226 Difference]: Without dead ends: 868 [2019-11-07 00:37:19,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-11-07 00:37:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-11-07 00:37:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-07 00:37:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1166 transitions. [2019-11-07 00:37:19,046 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1166 transitions. Word has length 54 [2019-11-07 00:37:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:19,047 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1166 transitions. [2019-11-07 00:37:19,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1166 transitions. [2019-11-07 00:37:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:19,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:19,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:19,051 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-11-07 00:37:19,051 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:19,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25901279] [2019-11-07 00:37:19,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:19,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25901279] [2019-11-07 00:37:19,183 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:19,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 00:37:19,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133498533] [2019-11-07 00:37:19,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:37:19,184 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:37:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:19,185 INFO L87 Difference]: Start difference. First operand 868 states and 1166 transitions. Second operand 13 states. [2019-11-07 00:37:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:21,052 INFO L93 Difference]: Finished difference Result 903 states and 1205 transitions. [2019-11-07 00:37:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:37:21,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-11-07 00:37:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:21,058 INFO L225 Difference]: With dead ends: 903 [2019-11-07 00:37:21,058 INFO L226 Difference]: Without dead ends: 897 [2019-11-07 00:37:21,058 INFO L630 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-11-07 00:37:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-07 00:37:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 868. [2019-11-07 00:37:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-07 00:37:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1165 transitions. [2019-11-07 00:37:21,105 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1165 transitions. Word has length 53 [2019-11-07 00:37:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:21,105 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1165 transitions. [2019-11-07 00:37:21,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:37:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1165 transitions. [2019-11-07 00:37:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:21,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:21,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:21,108 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:21,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1608320713, now seen corresponding path program 1 times [2019-11-07 00:37:21,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:21,109 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602840373] [2019-11-07 00:37:21,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:21,235 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602840373] [2019-11-07 00:37:21,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:21,235 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:21,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977379216] [2019-11-07 00:37:21,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:21,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:21,236 INFO L87 Difference]: Start difference. First operand 868 states and 1165 transitions. Second operand 10 states. [2019-11-07 00:37:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:23,747 INFO L93 Difference]: Finished difference Result 1116 states and 1551 transitions. [2019-11-07 00:37:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 00:37:23,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-07 00:37:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:23,753 INFO L225 Difference]: With dead ends: 1116 [2019-11-07 00:37:23,753 INFO L226 Difference]: Without dead ends: 1110 [2019-11-07 00:37:23,754 INFO L630 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-11-07 00:37:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-11-07 00:37:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 868. [2019-11-07 00:37:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-07 00:37:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1164 transitions. [2019-11-07 00:37:23,805 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1164 transitions. Word has length 53 [2019-11-07 00:37:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:23,806 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1164 transitions. [2019-11-07 00:37:23,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1164 transitions. [2019-11-07 00:37:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 00:37:23,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:23,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:23,809 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-11-07 00:37:23,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:23,810 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508281438] [2019-11-07 00:37:23,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:23,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508281438] [2019-11-07 00:37:23,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:23,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:23,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187851319] [2019-11-07 00:37:23,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:23,925 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:23,926 INFO L87 Difference]: Start difference. First operand 868 states and 1164 transitions. Second operand 11 states. [2019-11-07 00:37:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:25,233 INFO L93 Difference]: Finished difference Result 891 states and 1188 transitions. [2019-11-07 00:37:25,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:25,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-07 00:37:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:25,238 INFO L225 Difference]: With dead ends: 891 [2019-11-07 00:37:25,238 INFO L226 Difference]: Without dead ends: 867 [2019-11-07 00:37:25,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-11-07 00:37:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-11-07 00:37:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-07 00:37:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1162 transitions. [2019-11-07 00:37:25,286 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1162 transitions. Word has length 52 [2019-11-07 00:37:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:25,286 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1162 transitions. [2019-11-07 00:37:25,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1162 transitions. [2019-11-07 00:37:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 00:37:25,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:25,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:25,290 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1177776774, now seen corresponding path program 1 times [2019-11-07 00:37:25,290 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:25,291 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007943187] [2019-11-07 00:37:25,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:25,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007943187] [2019-11-07 00:37:25,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:25,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:25,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533394083] [2019-11-07 00:37:25,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:25,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:25,340 INFO L87 Difference]: Start difference. First operand 867 states and 1162 transitions. Second operand 5 states. [2019-11-07 00:37:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:25,877 INFO L93 Difference]: Finished difference Result 879 states and 1173 transitions. [2019-11-07 00:37:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:25,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-07 00:37:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:25,882 INFO L225 Difference]: With dead ends: 879 [2019-11-07 00:37:25,882 INFO L226 Difference]: Without dead ends: 844 [2019-11-07 00:37:25,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-07 00:37:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2019-11-07 00:37:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-07 00:37:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1130 transitions. [2019-11-07 00:37:25,926 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1130 transitions. Word has length 52 [2019-11-07 00:37:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:25,926 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1130 transitions. [2019-11-07 00:37:25,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1130 transitions. [2019-11-07 00:37:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 00:37:25,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:25,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:25,929 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2019-11-07 00:37:25,930 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:25,930 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296233214] [2019-11-07 00:37:25,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:26,085 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296233214] [2019-11-07 00:37:26,085 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:26,085 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 00:37:26,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621677300] [2019-11-07 00:37:26,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:37:26,086 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:37:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:26,087 INFO L87 Difference]: Start difference. First operand 838 states and 1130 transitions. Second operand 13 states. [2019-11-07 00:37:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:27,873 INFO L93 Difference]: Finished difference Result 871 states and 1166 transitions. [2019-11-07 00:37:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:37:27,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-11-07 00:37:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:27,878 INFO L225 Difference]: With dead ends: 871 [2019-11-07 00:37:27,879 INFO L226 Difference]: Without dead ends: 865 [2019-11-07 00:37:27,879 INFO L630 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-11-07 00:37:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-07 00:37:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 838. [2019-11-07 00:37:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-07 00:37:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-11-07 00:37:27,924 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 54 [2019-11-07 00:37:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:27,925 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-11-07 00:37:27,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:37:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-11-07 00:37:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 00:37:27,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:27,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:27,928 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-11-07 00:37:27,928 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:27,928 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848584140] [2019-11-07 00:37:27,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:28,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848584140] [2019-11-07 00:37:28,010 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:28,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:28,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174095514] [2019-11-07 00:37:28,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:28,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:28,011 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 9 states. [2019-11-07 00:37:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:29,900 INFO L93 Difference]: Finished difference Result 1133 states and 1567 transitions. [2019-11-07 00:37:29,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:37:29,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 00:37:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:29,906 INFO L225 Difference]: With dead ends: 1133 [2019-11-07 00:37:29,906 INFO L226 Difference]: Without dead ends: 1083 [2019-11-07 00:37:29,907 INFO L630 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-11-07 00:37:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-07 00:37:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 847. [2019-11-07 00:37:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-11-07 00:37:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2019-11-07 00:37:29,956 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2019-11-07 00:37:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:29,956 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2019-11-07 00:37:29,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2019-11-07 00:37:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 00:37:29,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:29,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:29,959 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2019-11-07 00:37:29,959 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:29,960 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217584264] [2019-11-07 00:37:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:30,035 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217584264] [2019-11-07 00:37:30,035 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:30,035 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634841765] [2019-11-07 00:37:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:30,036 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:30,036 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 9 states. [2019-11-07 00:37:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:30,215 INFO L93 Difference]: Finished difference Result 874 states and 1183 transitions. [2019-11-07 00:37:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:30,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 00:37:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:30,219 INFO L225 Difference]: With dead ends: 874 [2019-11-07 00:37:30,219 INFO L226 Difference]: Without dead ends: 838 [2019-11-07 00:37:30,220 INFO L630 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-11-07 00:37:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-07 00:37:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-07 00:37:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-07 00:37:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-11-07 00:37:30,266 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2019-11-07 00:37:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:30,267 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-11-07 00:37:30,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-11-07 00:37:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 00:37:30,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:30,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:30,270 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-11-07 00:37:30,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:30,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704350679] [2019-11-07 00:37:30,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:30,415 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704350679] [2019-11-07 00:37:30,415 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:30,416 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:30,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410682992] [2019-11-07 00:37:30,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:30,417 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:30,417 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2019-11-07 00:37:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:30,715 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2019-11-07 00:37:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:30,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-11-07 00:37:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:30,720 INFO L225 Difference]: With dead ends: 854 [2019-11-07 00:37:30,720 INFO L226 Difference]: Without dead ends: 836 [2019-11-07 00:37:30,721 INFO L630 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-11-07 00:37:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-11-07 00:37:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-11-07 00:37:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-07 00:37:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-11-07 00:37:30,772 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2019-11-07 00:37:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:30,772 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-11-07 00:37:30,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-11-07 00:37:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 00:37:30,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:30,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:30,778 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-11-07 00:37:30,779 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:30,779 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921780028] [2019-11-07 00:37:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:30,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921780028] [2019-11-07 00:37:30,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:30,921 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:30,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219738262] [2019-11-07 00:37:30,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:30,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:30,922 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-11-07 00:37:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:31,150 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2019-11-07 00:37:31,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:31,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-07 00:37:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:31,155 INFO L225 Difference]: With dead ends: 849 [2019-11-07 00:37:31,155 INFO L226 Difference]: Without dead ends: 831 [2019-11-07 00:37:31,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-11-07 00:37:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-11-07 00:37:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-07 00:37:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2019-11-07 00:37:31,199 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2019-11-07 00:37:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:31,199 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2019-11-07 00:37:31,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2019-11-07 00:37:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-07 00:37:31,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:31,203 INFO L410 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-11-07 00:37:31,203 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash -498198185, now seen corresponding path program 1 times [2019-11-07 00:37:31,204 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:31,204 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342048758] [2019-11-07 00:37:31,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:31,247 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342048758] [2019-11-07 00:37:31,247 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:31,247 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:31,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933809758] [2019-11-07 00:37:31,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:31,248 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:31,248 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 3 states. [2019-11-07 00:37:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:31,303 INFO L93 Difference]: Finished difference Result 1084 states and 1452 transitions. [2019-11-07 00:37:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:31,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-07 00:37:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:31,308 INFO L225 Difference]: With dead ends: 1084 [2019-11-07 00:37:31,308 INFO L226 Difference]: Without dead ends: 921 [2019-11-07 00:37:31,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-11-07 00:37:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 890. [2019-11-07 00:37:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-11-07 00:37:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1194 transitions. [2019-11-07 00:37:31,354 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1194 transitions. Word has length 74 [2019-11-07 00:37:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:31,354 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1194 transitions. [2019-11-07 00:37:31,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1194 transitions. [2019-11-07 00:37:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:31,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:31,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:31,357 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-11-07 00:37:31,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:31,360 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826652704] [2019-11-07 00:37:31,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:31,492 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826652704] [2019-11-07 00:37:31,492 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:31,493 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:31,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270981467] [2019-11-07 00:37:31,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:31,493 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:31,494 INFO L87 Difference]: Start difference. First operand 890 states and 1194 transitions. Second operand 11 states. [2019-11-07 00:37:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:31,860 INFO L93 Difference]: Finished difference Result 907 states and 1212 transitions. [2019-11-07 00:37:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:31,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-11-07 00:37:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:31,865 INFO L225 Difference]: With dead ends: 907 [2019-11-07 00:37:31,866 INFO L226 Difference]: Without dead ends: 887 [2019-11-07 00:37:31,868 INFO L630 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-11-07 00:37:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-11-07 00:37:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2019-11-07 00:37:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-07 00:37:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1189 transitions. [2019-11-07 00:37:31,941 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1189 transitions. Word has length 58 [2019-11-07 00:37:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:31,942 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1189 transitions. [2019-11-07 00:37:31,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1189 transitions. [2019-11-07 00:37:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 00:37:31,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:31,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:31,946 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-11-07 00:37:31,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:31,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730356114] [2019-11-07 00:37:31,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:32,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730356114] [2019-11-07 00:37:32,104 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:32,104 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:37:32,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566060755] [2019-11-07 00:37:32,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:37:32,105 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:37:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:37:32,106 INFO L87 Difference]: Start difference. First operand 887 states and 1189 transitions. Second operand 12 states. [2019-11-07 00:37:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:32,364 INFO L93 Difference]: Finished difference Result 913 states and 1217 transitions. [2019-11-07 00:37:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:37:32,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-07 00:37:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:32,367 INFO L225 Difference]: With dead ends: 913 [2019-11-07 00:37:32,367 INFO L226 Difference]: Without dead ends: 888 [2019-11-07 00:37:32,368 INFO L630 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-11-07 00:37:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-11-07 00:37:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2019-11-07 00:37:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-11-07 00:37:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2019-11-07 00:37:32,416 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 59 [2019-11-07 00:37:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:32,417 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2019-11-07 00:37:32,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:37:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2019-11-07 00:37:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 00:37:32,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:32,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:32,419 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:32,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:32,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-11-07 00:37:32,420 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:32,420 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890004481] [2019-11-07 00:37:32,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:32,504 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890004481] [2019-11-07 00:37:32,504 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:32,504 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:32,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431659615] [2019-11-07 00:37:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:32,505 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:32,505 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand 9 states. [2019-11-07 00:37:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:32,696 INFO L93 Difference]: Finished difference Result 908 states and 1201 transitions. [2019-11-07 00:37:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:32,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-11-07 00:37:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:32,699 INFO L225 Difference]: With dead ends: 908 [2019-11-07 00:37:32,699 INFO L226 Difference]: Without dead ends: 874 [2019-11-07 00:37:32,700 INFO L630 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-11-07 00:37:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-07 00:37:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-11-07 00:37:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-11-07 00:37:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1157 transitions. [2019-11-07 00:37:32,745 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1157 transitions. Word has length 59 [2019-11-07 00:37:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1157 transitions. [2019-11-07 00:37:32,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1157 transitions. [2019-11-07 00:37:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 00:37:32,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:32,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:32,747 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-11-07 00:37:32,748 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:32,748 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823431247] [2019-11-07 00:37:32,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:32,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823431247] [2019-11-07 00:37:32,786 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:32,786 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:32,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766638081] [2019-11-07 00:37:32,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:32,786 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:32,787 INFO L87 Difference]: Start difference. First operand 874 states and 1157 transitions. Second operand 4 states. [2019-11-07 00:37:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:32,928 INFO L93 Difference]: Finished difference Result 1034 states and 1385 transitions. [2019-11-07 00:37:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:32,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-07 00:37:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:32,932 INFO L225 Difference]: With dead ends: 1034 [2019-11-07 00:37:32,932 INFO L226 Difference]: Without dead ends: 923 [2019-11-07 00:37:32,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-07 00:37:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 881. [2019-11-07 00:37:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-11-07 00:37:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1173 transitions. [2019-11-07 00:37:32,994 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1173 transitions. Word has length 60 [2019-11-07 00:37:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:32,996 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1173 transitions. [2019-11-07 00:37:32,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1173 transitions. [2019-11-07 00:37:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 00:37:32,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:32,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:32,999 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-11-07 00:37:33,000 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:33,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301270182] [2019-11-07 00:37:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:33,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301270182] [2019-11-07 00:37:33,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:33,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:33,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821375481] [2019-11-07 00:37:33,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:33,136 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:33,137 INFO L87 Difference]: Start difference. First operand 881 states and 1173 transitions. Second operand 11 states. [2019-11-07 00:37:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:33,281 INFO L93 Difference]: Finished difference Result 950 states and 1266 transitions. [2019-11-07 00:37:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:37:33,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-11-07 00:37:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:33,285 INFO L225 Difference]: With dead ends: 950 [2019-11-07 00:37:33,285 INFO L226 Difference]: Without dead ends: 895 [2019-11-07 00:37:33,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-11-07 00:37:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 885. [2019-11-07 00:37:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-07 00:37:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1191 transitions. [2019-11-07 00:37:33,333 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1191 transitions. Word has length 60 [2019-11-07 00:37:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:33,333 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1191 transitions. [2019-11-07 00:37:33,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1191 transitions. [2019-11-07 00:37:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 00:37:33,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:33,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:33,337 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2019-11-07 00:37:33,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:33,338 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041288573] [2019-11-07 00:37:33,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:33,411 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041288573] [2019-11-07 00:37:33,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:33,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916157666] [2019-11-07 00:37:33,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:33,412 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:33,414 INFO L87 Difference]: Start difference. First operand 885 states and 1191 transitions. Second operand 9 states. [2019-11-07 00:37:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:33,593 INFO L93 Difference]: Finished difference Result 916 states and 1228 transitions. [2019-11-07 00:37:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:33,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-11-07 00:37:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:33,597 INFO L225 Difference]: With dead ends: 916 [2019-11-07 00:37:33,597 INFO L226 Difference]: Without dead ends: 877 [2019-11-07 00:37:33,598 INFO L630 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-11-07 00:37:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-11-07 00:37:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2019-11-07 00:37:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-11-07 00:37:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1175 transitions. [2019-11-07 00:37:33,644 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1175 transitions. Word has length 60 [2019-11-07 00:37:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1175 transitions. [2019-11-07 00:37:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1175 transitions. [2019-11-07 00:37:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 00:37:33,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:33,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:33,647 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:33,648 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2019-11-07 00:37:33,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:33,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275937150] [2019-11-07 00:37:33,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:33,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275937150] [2019-11-07 00:37:33,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:33,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 00:37:33,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827327958] [2019-11-07 00:37:33,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:37:33,817 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:37:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:33,818 INFO L87 Difference]: Start difference. First operand 877 states and 1175 transitions. Second operand 13 states. [2019-11-07 00:37:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:34,139 INFO L93 Difference]: Finished difference Result 894 states and 1193 transitions. [2019-11-07 00:37:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:37:34,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-11-07 00:37:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:34,143 INFO L225 Difference]: With dead ends: 894 [2019-11-07 00:37:34,143 INFO L226 Difference]: Without dead ends: 872 [2019-11-07 00:37:34,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-07 00:37:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-11-07 00:37:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-07 00:37:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1168 transitions. [2019-11-07 00:37:34,188 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1168 transitions. Word has length 62 [2019-11-07 00:37:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:34,188 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1168 transitions. [2019-11-07 00:37:34,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:37:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1168 transitions. [2019-11-07 00:37:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 00:37:34,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:34,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:34,191 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2019-11-07 00:37:34,192 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:34,192 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718741735] [2019-11-07 00:37:34,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:34,227 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718741735] [2019-11-07 00:37:34,227 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:34,227 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:34,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238779825] [2019-11-07 00:37:34,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:34,228 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:34,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:34,228 INFO L87 Difference]: Start difference. First operand 872 states and 1168 transitions. Second operand 3 states. [2019-11-07 00:37:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:34,265 INFO L93 Difference]: Finished difference Result 1158 states and 1551 transitions. [2019-11-07 00:37:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:34,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-07 00:37:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:34,268 INFO L225 Difference]: With dead ends: 1158 [2019-11-07 00:37:34,268 INFO L226 Difference]: Without dead ends: 797 [2019-11-07 00:37:34,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-07 00:37:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 766. [2019-11-07 00:37:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-11-07 00:37:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 995 transitions. [2019-11-07 00:37:34,309 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 995 transitions. Word has length 62 [2019-11-07 00:37:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:34,310 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 995 transitions. [2019-11-07 00:37:34,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 995 transitions. [2019-11-07 00:37:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 00:37:34,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:34,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:34,312 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2077254621, now seen corresponding path program 1 times [2019-11-07 00:37:34,313 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:34,313 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621772555] [2019-11-07 00:37:34,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:34,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621772555] [2019-11-07 00:37:34,460 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:34,460 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:37:34,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832590605] [2019-11-07 00:37:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:37:34,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:37:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:37:34,463 INFO L87 Difference]: Start difference. First operand 766 states and 995 transitions. Second operand 12 states. [2019-11-07 00:37:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:34,704 INFO L93 Difference]: Finished difference Result 790 states and 1020 transitions. [2019-11-07 00:37:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:37:34,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-11-07 00:37:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:34,707 INFO L225 Difference]: With dead ends: 790 [2019-11-07 00:37:34,708 INFO L226 Difference]: Without dead ends: 766 [2019-11-07 00:37:34,708 INFO L630 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-11-07 00:37:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-07 00:37:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 764. [2019-11-07 00:37:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-11-07 00:37:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 991 transitions. [2019-11-07 00:37:34,749 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 991 transitions. Word has length 66 [2019-11-07 00:37:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:34,751 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 991 transitions. [2019-11-07 00:37:34,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:37:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 991 transitions. [2019-11-07 00:37:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 00:37:34,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:34,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:34,753 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 735394788, now seen corresponding path program 1 times [2019-11-07 00:37:34,754 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:34,754 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253297785] [2019-11-07 00:37:34,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:34,874 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253297785] [2019-11-07 00:37:34,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:34,874 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:37:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914243988] [2019-11-07 00:37:34,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:37:34,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:37:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:37:34,876 INFO L87 Difference]: Start difference. First operand 764 states and 991 transitions. Second operand 12 states. [2019-11-07 00:37:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:35,109 INFO L93 Difference]: Finished difference Result 786 states and 1014 transitions. [2019-11-07 00:37:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:37:35,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-11-07 00:37:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:35,112 INFO L225 Difference]: With dead ends: 786 [2019-11-07 00:37:35,112 INFO L226 Difference]: Without dead ends: 762 [2019-11-07 00:37:35,113 INFO L630 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-11-07 00:37:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-11-07 00:37:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-11-07 00:37:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-11-07 00:37:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 987 transitions. [2019-11-07 00:37:35,155 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 987 transitions. Word has length 63 [2019-11-07 00:37:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:35,155 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 987 transitions. [2019-11-07 00:37:35,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:37:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2019-11-07 00:37:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 00:37:35,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:35,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:35,157 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -967621732, now seen corresponding path program 1 times [2019-11-07 00:37:35,158 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:35,160 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137068204] [2019-11-07 00:37:35,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:35,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137068204] [2019-11-07 00:37:35,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:35,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:37:35,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135587793] [2019-11-07 00:37:35,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:37:35,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:37:35,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:37:35,285 INFO L87 Difference]: Start difference. First operand 762 states and 987 transitions. Second operand 12 states. [2019-11-07 00:37:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:35,505 INFO L93 Difference]: Finished difference Result 786 states and 1012 transitions. [2019-11-07 00:37:35,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:37:35,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-11-07 00:37:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:35,508 INFO L225 Difference]: With dead ends: 786 [2019-11-07 00:37:35,509 INFO L226 Difference]: Without dead ends: 762 [2019-11-07 00:37:35,509 INFO L630 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-11-07 00:37:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-11-07 00:37:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2019-11-07 00:37:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-11-07 00:37:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 983 transitions. [2019-11-07 00:37:35,559 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 983 transitions. Word has length 62 [2019-11-07 00:37:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:35,559 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 983 transitions. [2019-11-07 00:37:35,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:37:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 983 transitions. [2019-11-07 00:37:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 00:37:35,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:35,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:35,561 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2019-11-07 00:37:35,562 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:35,562 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996752786] [2019-11-07 00:37:35,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:35,733 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996752786] [2019-11-07 00:37:35,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:35,734 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 00:37:35,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150575612] [2019-11-07 00:37:35,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:37:35,736 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:37:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:35,737 INFO L87 Difference]: Start difference. First operand 760 states and 983 transitions. Second operand 13 states. [2019-11-07 00:37:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:36,043 INFO L93 Difference]: Finished difference Result 777 states and 1001 transitions. [2019-11-07 00:37:36,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:37:36,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-07 00:37:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:36,046 INFO L225 Difference]: With dead ends: 777 [2019-11-07 00:37:36,047 INFO L226 Difference]: Without dead ends: 755 [2019-11-07 00:37:36,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-07 00:37:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-07 00:37:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-07 00:37:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 976 transitions. [2019-11-07 00:37:36,089 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 976 transitions. Word has length 63 [2019-11-07 00:37:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:36,090 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 976 transitions. [2019-11-07 00:37:36,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:37:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 976 transitions. [2019-11-07 00:37:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 00:37:36,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:36,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:36,092 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1698824433, now seen corresponding path program 1 times [2019-11-07 00:37:36,093 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:36,093 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591939968] [2019-11-07 00:37:36,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:36,125 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591939968] [2019-11-07 00:37:36,125 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:36,125 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:36,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137124968] [2019-11-07 00:37:36,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:36,125 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:36,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:36,126 INFO L87 Difference]: Start difference. First operand 755 states and 976 transitions. Second operand 3 states. [2019-11-07 00:37:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:36,167 INFO L93 Difference]: Finished difference Result 885 states and 1149 transitions. [2019-11-07 00:37:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:36,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-07 00:37:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:36,170 INFO L225 Difference]: With dead ends: 885 [2019-11-07 00:37:36,170 INFO L226 Difference]: Without dead ends: 755 [2019-11-07 00:37:36,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-07 00:37:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-07 00:37:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-07 00:37:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 974 transitions. [2019-11-07 00:37:36,221 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 974 transitions. Word has length 66 [2019-11-07 00:37:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:36,222 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 974 transitions. [2019-11-07 00:37:36,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 974 transitions. [2019-11-07 00:37:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:36,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:36,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:36,225 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2019-11-07 00:37:36,226 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:36,226 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969627345] [2019-11-07 00:37:36,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:36,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969627345] [2019-11-07 00:37:36,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:36,402 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 00:37:36,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11881941] [2019-11-07 00:37:36,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 00:37:36,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 00:37:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:37:36,404 INFO L87 Difference]: Start difference. First operand 755 states and 974 transitions. Second operand 15 states. [2019-11-07 00:37:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:36,977 INFO L93 Difference]: Finished difference Result 805 states and 1036 transitions. [2019-11-07 00:37:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-07 00:37:36,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-11-07 00:37:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:36,980 INFO L225 Difference]: With dead ends: 805 [2019-11-07 00:37:36,980 INFO L226 Difference]: Without dead ends: 779 [2019-11-07 00:37:36,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-11-07 00:37:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-07 00:37:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 761. [2019-11-07 00:37:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-07 00:37:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 982 transitions. [2019-11-07 00:37:37,028 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 982 transitions. Word has length 65 [2019-11-07 00:37:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:37,028 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 982 transitions. [2019-11-07 00:37:37,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 00:37:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 982 transitions. [2019-11-07 00:37:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 00:37:37,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:37,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:37,030 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -157011960, now seen corresponding path program 1 times [2019-11-07 00:37:37,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:37,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363622854] [2019-11-07 00:37:37,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat