java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:38,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:38,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:38,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:38,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:38,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:38,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:38,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:38,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:38,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:38,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:38,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:38,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:38,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:38,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:38,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:38,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:38,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:38,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:38,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:38,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:38,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:38,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:38,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:38,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:38,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:38,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:38,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:38,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:38,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:38,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:38,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:38,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:38,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:38,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:38,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:38,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:38,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:38,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:38,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:38,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:38,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:38,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:38,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:38,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:38,400 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:38,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:38,401 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:38,401 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:38,401 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:38,401 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:38,402 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:38,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:38,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:38,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:38,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:38,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:38,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:38,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:38,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:38,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:38,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:38,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:38,406 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:38,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:38,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:38,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:38,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:38,407 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:38,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:38,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:38,408 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:38,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:38,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:38,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:38,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:38,473 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:38,474 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-09-20 13:26:38,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91103b4e/92c3cc64d66448ae8cfdb2be5411c4e7/FLAG3df461e44 [2019-09-20 13:26:39,163 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:39,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-09-20 13:26:39,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91103b4e/92c3cc64d66448ae8cfdb2be5411c4e7/FLAG3df461e44 [2019-09-20 13:26:39,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91103b4e/92c3cc64d66448ae8cfdb2be5411c4e7 [2019-09-20 13:26:39,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:39,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:39,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:39,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:39,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:39,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af82b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:39, skipping insertion in model container [2019-09-20 13:26:39,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:39" (1/1) ... [2019-09-20 13:26:39,423 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:39,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:40,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:40,072 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:40,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:40,274 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:40,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40 WrapperNode [2019-09-20 13:26:40,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:40,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:40,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:40,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:40,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:40,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:40,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:40,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:40,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-09-20 13:26:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-09-20 13:26:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-09-20 13:26:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-09-20 13:26:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-09-20 13:26:40,494 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-09-20 13:26:40,494 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-09-20 13:26:40,494 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-09-20 13:26:40,495 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-09-20 13:26:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-09-20 13:26:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-09-20 13:26:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-09-20 13:26:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-09-20 13:26:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-09-20 13:26:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-09-20 13:26:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-09-20 13:26:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-09-20 13:26:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:40,499 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:40,499 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:40,500 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:40,500 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:40,500 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 13:26:40,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-20 13:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-09-20 13:26:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-09-20 13:26:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-09-20 13:26:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-09-20 13:26:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-09-20 13:26:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-09-20 13:26:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-09-20 13:26:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-09-20 13:26:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-09-20 13:26:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-09-20 13:26:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-09-20 13:26:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-09-20 13:26:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-09-20 13:26:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-09-20 13:26:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-09-20 13:26:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-09-20 13:26:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-09-20 13:26:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:41,057 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,262 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 13:26:41,263 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 13:26:41,275 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,354 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 13:26:41,354 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 13:26:41,385 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,421 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:41,421 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:41,513 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,589 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-09-20 13:26:41,590 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 13:26:41,590 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 13:26:41,598 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,815 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-09-20 13:26:41,815 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-09-20 13:26:41,816 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,851 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-20 13:26:41,851 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-20 13:26:41,882 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,901 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 13:26:41,902 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 13:26:41,907 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,130 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-20 13:26:42,130 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-20 13:26:42,146 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,152 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 13:26:42,153 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 13:26:42,174 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:42,174 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:42,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42 BoogieIcfgContainer [2019-09-20 13:26:42,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:42,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:42,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:42,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:42,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:39" (1/3) ... [2019-09-20 13:26:42,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a585c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (2/3) ... [2019-09-20 13:26:42,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a585c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42" (3/3) ... [2019-09-20 13:26:42,188 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-09-20 13:26:42,198 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:42,212 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:42,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:42,256 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:42,257 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:42,257 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:42,257 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:42,257 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:42,257 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:42,257 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:42,258 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-09-20 13:26:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:42,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,315 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:42,317 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-09-20 13:26:42,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:42,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,694 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-09-20 13:26:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,883 INFO L93 Difference]: Finished difference Result 523 states and 765 transitions. [2019-09-20 13:26:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,909 INFO L225 Difference]: With dead ends: 523 [2019-09-20 13:26:42,909 INFO L226 Difference]: Without dead ends: 507 [2019-09-20 13:26:42,912 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-20 13:26:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-09-20 13:26:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-20 13:26:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-09-20 13:26:43,001 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-09-20 13:26:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,002 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-09-20 13:26:43,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-09-20 13:26:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:43,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,004 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,004 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-09-20 13:26:43,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,203 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-09-20 13:26:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,522 INFO L93 Difference]: Finished difference Result 671 states and 954 transitions. [2019-09-20 13:26:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,536 INFO L225 Difference]: With dead ends: 671 [2019-09-20 13:26:43,537 INFO L226 Difference]: Without dead ends: 670 [2019-09-20 13:26:43,538 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-20 13:26:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-09-20 13:26:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-20 13:26:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-09-20 13:26:43,609 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-09-20 13:26:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,610 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-09-20 13:26:43,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-09-20 13:26:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:43,621 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,621 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,621 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-09-20 13:26:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,768 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-09-20 13:26:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,808 INFO L93 Difference]: Finished difference Result 819 states and 1150 transitions. [2019-09-20 13:26:43,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,816 INFO L225 Difference]: With dead ends: 819 [2019-09-20 13:26:43,816 INFO L226 Difference]: Without dead ends: 819 [2019-09-20 13:26:43,816 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-20 13:26:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-09-20 13:26:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-09-20 13:26:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-09-20 13:26:43,860 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-09-20 13:26:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,861 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-09-20 13:26:43,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-09-20 13:26:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:43,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,864 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,865 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-09-20 13:26:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,938 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-09-20 13:26:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,130 INFO L93 Difference]: Finished difference Result 1160 states and 1708 transitions. [2019-09-20 13:26:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,141 INFO L225 Difference]: With dead ends: 1160 [2019-09-20 13:26:44,141 INFO L226 Difference]: Without dead ends: 1160 [2019-09-20 13:26:44,142 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-09-20 13:26:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-09-20 13:26:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-20 13:26:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-09-20 13:26:44,202 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-09-20 13:26:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,202 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-09-20 13:26:44,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-09-20 13:26:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:44,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,208 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,209 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-09-20 13:26:44,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:44,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,345 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-09-20 13:26:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,408 INFO L93 Difference]: Finished difference Result 984 states and 1431 transitions. [2019-09-20 13:26:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:45,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 13:26:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,416 INFO L225 Difference]: With dead ends: 984 [2019-09-20 13:26:45,417 INFO L226 Difference]: Without dead ends: 984 [2019-09-20 13:26:45,417 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-20 13:26:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-09-20 13:26:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-20 13:26:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-09-20 13:26:45,450 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-09-20 13:26:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,451 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-09-20 13:26:45,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-09-20 13:26:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:26:45,454 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,454 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,454 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-09-20 13:26:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,518 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-09-20 13:26:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,585 INFO L93 Difference]: Finished difference Result 886 states and 1296 transitions. [2019-09-20 13:26:45,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:26:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,591 INFO L225 Difference]: With dead ends: 886 [2019-09-20 13:26:45,592 INFO L226 Difference]: Without dead ends: 886 [2019-09-20 13:26:45,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-09-20 13:26:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-09-20 13:26:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-09-20 13:26:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-09-20 13:26:45,623 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-09-20 13:26:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,623 INFO L475 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-09-20 13:26:45,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-09-20 13:26:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:26:45,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,626 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,626 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-09-20 13:26:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,679 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-09-20 13:26:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,703 INFO L93 Difference]: Finished difference Result 1015 states and 1453 transitions. [2019-09-20 13:26:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 13:26:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,710 INFO L225 Difference]: With dead ends: 1015 [2019-09-20 13:26:45,710 INFO L226 Difference]: Without dead ends: 1015 [2019-09-20 13:26:45,711 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-20 13:26:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-09-20 13:26:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-20 13:26:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-09-20 13:26:45,739 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-09-20 13:26:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,739 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-09-20 13:26:45,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-09-20 13:26:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:26:45,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,742 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,743 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-09-20 13:26:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,833 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-09-20 13:26:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,869 INFO L93 Difference]: Finished difference Result 954 states and 1337 transitions. [2019-09-20 13:26:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-20 13:26:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,878 INFO L225 Difference]: With dead ends: 954 [2019-09-20 13:26:45,879 INFO L226 Difference]: Without dead ends: 954 [2019-09-20 13:26:45,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-20 13:26:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-09-20 13:26:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-20 13:26:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-09-20 13:26:45,910 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-09-20 13:26:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,911 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-09-20 13:26:45,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-09-20 13:26:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:45,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,916 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,916 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-09-20 13:26:45,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,991 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-09-20 13:26:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,014 INFO L93 Difference]: Finished difference Result 925 states and 1300 transitions. [2019-09-20 13:26:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:26:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,019 INFO L225 Difference]: With dead ends: 925 [2019-09-20 13:26:46,020 INFO L226 Difference]: Without dead ends: 925 [2019-09-20 13:26:46,020 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-20 13:26:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-09-20 13:26:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-20 13:26:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-09-20 13:26:46,046 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-09-20 13:26:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,046 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-09-20 13:26:46,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-09-20 13:26:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:46,049 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,050 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,050 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-09-20 13:26:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,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-09-20 13:26:46,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:46,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:46,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:46,111 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-09-20 13:26:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,438 INFO L93 Difference]: Finished difference Result 785 states and 1094 transitions. [2019-09-20 13:26:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:46,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 13:26:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,443 INFO L225 Difference]: With dead ends: 785 [2019-09-20 13:26:46,443 INFO L226 Difference]: Without dead ends: 785 [2019-09-20 13:26:46,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-09-20 13:26:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-09-20 13:26:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-20 13:26:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-09-20 13:26:46,464 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-09-20 13:26:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,464 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-09-20 13:26:46,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-09-20 13:26:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:46,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,467 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,467 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-09-20 13:26:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,508 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-09-20 13:26:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,527 INFO L93 Difference]: Finished difference Result 775 states and 1080 transitions. [2019-09-20 13:26:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-20 13:26:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,533 INFO L225 Difference]: With dead ends: 775 [2019-09-20 13:26:46,533 INFO L226 Difference]: Without dead ends: 775 [2019-09-20 13:26:46,534 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-20 13:26:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-09-20 13:26:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-20 13:26:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-09-20 13:26:46,564 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-09-20 13:26:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,564 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-09-20 13:26:46,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-09-20 13:26:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:26:46,568 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,569 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,569 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-09-20 13:26:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,623 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-09-20 13:26:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,730 INFO L93 Difference]: Finished difference Result 928 states and 1286 transitions. [2019-09-20 13:26:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-20 13:26:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,737 INFO L225 Difference]: With dead ends: 928 [2019-09-20 13:26:46,737 INFO L226 Difference]: Without dead ends: 928 [2019-09-20 13:26:46,738 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-20 13:26:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-09-20 13:26:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-20 13:26:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-09-20 13:26:46,772 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-09-20 13:26:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,773 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-09-20 13:26:46,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-09-20 13:26:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:26:46,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,777 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,778 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-09-20 13:26:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:46,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:46,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:46,885 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-09-20 13:26:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,047 INFO L93 Difference]: Finished difference Result 848 states and 1169 transitions. [2019-09-20 13:26:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:47,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:26:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,052 INFO L225 Difference]: With dead ends: 848 [2019-09-20 13:26:47,052 INFO L226 Difference]: Without dead ends: 847 [2019-09-20 13:26:47,053 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-20 13:26:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-09-20 13:26:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-20 13:26:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-09-20 13:26:47,081 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-09-20 13:26:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,084 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-09-20 13:26:47,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-09-20 13:26:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:26:47,088 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,088 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,089 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-09-20 13:26:47,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,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-09-20 13:26:47,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:47,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:47,217 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-09-20 13:26:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,298 INFO L93 Difference]: Finished difference Result 883 states and 1214 transitions. [2019-09-20 13:26:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:47,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:26:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,303 INFO L225 Difference]: With dead ends: 883 [2019-09-20 13:26:47,303 INFO L226 Difference]: Without dead ends: 865 [2019-09-20 13:26:47,304 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-20 13:26:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-09-20 13:26:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-20 13:26:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-09-20 13:26:47,329 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-09-20 13:26:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,329 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-09-20 13:26:47,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-09-20 13:26:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:47,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,332 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,333 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-09-20 13:26:47,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:47,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:47,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:47,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,373 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-09-20 13:26:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,463 INFO L93 Difference]: Finished difference Result 1064 states and 1448 transitions. [2019-09-20 13:26:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:47,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 13:26:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,470 INFO L225 Difference]: With dead ends: 1064 [2019-09-20 13:26:47,470 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:26:47,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:26:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-09-20 13:26:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-20 13:26:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-09-20 13:26:47,503 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-09-20 13:26:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,504 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-09-20 13:26:47,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-09-20 13:26:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:47,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,509 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,509 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-09-20 13:26:47,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:47,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:47,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:47,565 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-09-20 13:26:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,608 INFO L93 Difference]: Finished difference Result 944 states and 1280 transitions. [2019-09-20 13:26:47,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:47,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:26:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,615 INFO L225 Difference]: With dead ends: 944 [2019-09-20 13:26:47,615 INFO L226 Difference]: Without dead ends: 944 [2019-09-20 13:26:47,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-20 13:26:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-09-20 13:26:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-20 13:26:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-09-20 13:26:47,660 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-09-20 13:26:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,661 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-09-20 13:26:47,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-09-20 13:26:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:47,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,666 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,666 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-09-20 13:26:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:26:47,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:26:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:26:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:47,766 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-09-20 13:26:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,906 INFO L93 Difference]: Finished difference Result 1019 states and 1438 transitions. [2019-09-20 13:26:48,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:48,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-20 13:26:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,913 INFO L225 Difference]: With dead ends: 1019 [2019-09-20 13:26:48,913 INFO L226 Difference]: Without dead ends: 1016 [2019-09-20 13:26:48,914 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:26:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-20 13:26:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-09-20 13:26:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-09-20 13:26:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-09-20 13:26:48,942 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-09-20 13:26:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,942 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-09-20 13:26:48,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:26:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-09-20 13:26:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:48,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,945 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,946 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-09-20 13:26:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:49,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:26:49,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:26:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:26:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:26:49,162 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 15 states. [2019-09-20 13:26:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,573 INFO L93 Difference]: Finished difference Result 1051 states and 1466 transitions. [2019-09-20 13:26:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:26:52,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-09-20 13:26:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,581 INFO L225 Difference]: With dead ends: 1051 [2019-09-20 13:26:52,582 INFO L226 Difference]: Without dead ends: 1033 [2019-09-20 13:26:52,582 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:26:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-09-20 13:26:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 876. [2019-09-20 13:26:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 13:26:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1182 transitions. [2019-09-20 13:26:52,607 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1182 transitions. Word has length 50 [2019-09-20 13:26:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,607 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1182 transitions. [2019-09-20 13:26:52,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:26:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1182 transitions. [2019-09-20 13:26:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:52,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,611 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,611 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash -594952383, now seen corresponding path program 1 times [2019-09-20 13:26:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:52,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:52,717 INFO L87 Difference]: Start difference. First operand 876 states and 1182 transitions. Second operand 10 states. [2019-09-20 13:26:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,321 INFO L93 Difference]: Finished difference Result 1138 states and 1584 transitions. [2019-09-20 13:26:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:26:55,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-20 13:26:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,327 INFO L225 Difference]: With dead ends: 1138 [2019-09-20 13:26:55,327 INFO L226 Difference]: Without dead ends: 1121 [2019-09-20 13:26:55,327 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:26:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-09-20 13:26:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 880. [2019-09-20 13:26:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-09-20 13:26:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2019-09-20 13:26:55,352 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 50 [2019-09-20 13:26:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,352 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2019-09-20 13:26:55,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2019-09-20 13:26:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:26:55,355 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,355 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,355 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-09-20 13:26:55,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,398 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 3 states. [2019-09-20 13:26:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,447 INFO L93 Difference]: Finished difference Result 900 states and 1206 transitions. [2019-09-20 13:26:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-20 13:26:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,453 INFO L225 Difference]: With dead ends: 900 [2019-09-20 13:26:55,453 INFO L226 Difference]: Without dead ends: 900 [2019-09-20 13:26:55,454 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-20 13:26:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-09-20 13:26:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-20 13:26:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2019-09-20 13:26:55,479 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 52 [2019-09-20 13:26:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,480 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2019-09-20 13:26:55,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2019-09-20 13:26:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:26:55,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,483 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,483 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-09-20 13:26:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,536 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand 3 states. [2019-09-20 13:26:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,586 INFO L93 Difference]: Finished difference Result 868 states and 1166 transitions. [2019-09-20 13:26:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:26:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,591 INFO L225 Difference]: With dead ends: 868 [2019-09-20 13:26:55,591 INFO L226 Difference]: Without dead ends: 868 [2019-09-20 13:26:55,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-20 13:26:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-09-20 13:26:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:26:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1166 transitions. [2019-09-20 13:26:55,612 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1166 transitions. Word has length 54 [2019-09-20 13:26:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,612 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1166 transitions. [2019-09-20 13:26:55,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1166 transitions. [2019-09-20 13:26:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:55,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,617 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,617 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-09-20 13:26:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:26:55,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:26:55,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:26:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:26:55,789 INFO L87 Difference]: Start difference. First operand 868 states and 1166 transitions. Second operand 13 states. [2019-09-20 13:26:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,803 INFO L93 Difference]: Finished difference Result 897 states and 1198 transitions. [2019-09-20 13:26:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:26:57,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-20 13:26:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,810 INFO L225 Difference]: With dead ends: 897 [2019-09-20 13:26:57,811 INFO L226 Difference]: Without dead ends: 897 [2019-09-20 13:26:57,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:26:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-20 13:26:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 868. [2019-09-20 13:26:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:26:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1165 transitions. [2019-09-20 13:26:57,832 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1165 transitions. Word has length 53 [2019-09-20 13:26:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,833 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1165 transitions. [2019-09-20 13:26:57,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:26:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1165 transitions. [2019-09-20 13:26:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:26:57,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,836 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,836 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -424471605, now seen corresponding path program 1 times [2019-09-20 13:26:57,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:57,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:57,952 INFO L87 Difference]: Start difference. First operand 868 states and 1165 transitions. Second operand 10 states. [2019-09-20 13:27:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,588 INFO L93 Difference]: Finished difference Result 1110 states and 1545 transitions. [2019-09-20 13:27:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:27:00,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-09-20 13:27:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,594 INFO L225 Difference]: With dead ends: 1110 [2019-09-20 13:27:00,594 INFO L226 Difference]: Without dead ends: 1110 [2019-09-20 13:27:00,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 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-09-20 13:27:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-20 13:27:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 868. [2019-09-20 13:27:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:27:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1164 transitions. [2019-09-20 13:27:00,620 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1164 transitions. Word has length 54 [2019-09-20 13:27:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,621 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1164 transitions. [2019-09-20 13:27:00,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1164 transitions. [2019-09-20 13:27:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:27:00,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,624 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,624 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-09-20 13:27:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,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-09-20 13:27:00,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:00,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:00,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:00,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:00,749 INFO L87 Difference]: Start difference. First operand 868 states and 1164 transitions. Second operand 11 states. [2019-09-20 13:27:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,161 INFO L93 Difference]: Finished difference Result 888 states and 1185 transitions. [2019-09-20 13:27:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:02,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-20 13:27:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,167 INFO L225 Difference]: With dead ends: 888 [2019-09-20 13:27:02,168 INFO L226 Difference]: Without dead ends: 867 [2019-09-20 13:27:02,168 INFO L636 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-09-20 13:27:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-09-20 13:27:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-09-20 13:27:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-09-20 13:27:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1162 transitions. [2019-09-20 13:27:02,193 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1162 transitions. Word has length 52 [2019-09-20 13:27:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,194 INFO L475 AbstractCegarLoop]: Abstraction has 867 states and 1162 transitions. [2019-09-20 13:27:02,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1162 transitions. [2019-09-20 13:27:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:27:02,198 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,198 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:02,198 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1177776774, now seen corresponding path program 1 times [2019-09-20 13:27:02,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:02,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:02,302 INFO L87 Difference]: Start difference. First operand 867 states and 1162 transitions. Second operand 5 states. [2019-09-20 13:27:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,851 INFO L93 Difference]: Finished difference Result 875 states and 1168 transitions. [2019-09-20 13:27:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:27:02,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-20 13:27:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,855 INFO L225 Difference]: With dead ends: 875 [2019-09-20 13:27:02,856 INFO L226 Difference]: Without dead ends: 844 [2019-09-20 13:27:02,856 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-09-20 13:27:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2019-09-20 13:27:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:27:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1130 transitions. [2019-09-20 13:27:02,875 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1130 transitions. Word has length 52 [2019-09-20 13:27:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,876 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1130 transitions. [2019-09-20 13:27:02,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1130 transitions. [2019-09-20 13:27:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:02,879 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,879 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:02,879 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2019-09-20 13:27:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:03,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:27:03,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:27:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:27:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:03,029 INFO L87 Difference]: Start difference. First operand 838 states and 1130 transitions. Second operand 13 states. [2019-09-20 13:27:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:04,934 INFO L93 Difference]: Finished difference Result 865 states and 1159 transitions. [2019-09-20 13:27:04,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:27:04,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-09-20 13:27:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:04,939 INFO L225 Difference]: With dead ends: 865 [2019-09-20 13:27:04,939 INFO L226 Difference]: Without dead ends: 865 [2019-09-20 13:27:04,940 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:27:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-20 13:27:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 838. [2019-09-20 13:27:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:27:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-09-20 13:27:04,962 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 54 [2019-09-20 13:27:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:04,962 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-09-20 13:27:04,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:27:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-09-20 13:27:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:04,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,965 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:04,965 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-09-20 13:27:04,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:05,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:05,081 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 9 states. [2019-09-20 13:27:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,231 INFO L93 Difference]: Finished difference Result 1083 states and 1507 transitions. [2019-09-20 13:27:07,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:27:07,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-20 13:27:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,236 INFO L225 Difference]: With dead ends: 1083 [2019-09-20 13:27:07,236 INFO L226 Difference]: Without dead ends: 1083 [2019-09-20 13:27:07,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:27:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-09-20 13:27:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 847. [2019-09-20 13:27:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-20 13:27:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2019-09-20 13:27:07,258 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2019-09-20 13:27:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,258 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2019-09-20 13:27:07,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2019-09-20 13:27:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:07,261 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,262 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,262 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2019-09-20 13:27:07,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:07,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:07,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:07,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:07,347 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 9 states. [2019-09-20 13:27:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,556 INFO L93 Difference]: Finished difference Result 871 states and 1180 transitions. [2019-09-20 13:27:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:27:07,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:27:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,569 INFO L225 Difference]: With dead ends: 871 [2019-09-20 13:27:07,569 INFO L226 Difference]: Without dead ends: 838 [2019-09-20 13:27:07,570 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-20 13:27:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-20 13:27:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:27:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-09-20 13:27:07,614 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2019-09-20 13:27:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,614 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-09-20 13:27:07,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-09-20 13:27:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:07,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,619 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,619 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-09-20 13:27:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:07,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:27:07,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:27:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:27:07,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:27:07,774 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2019-09-20 13:27:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,967 INFO L93 Difference]: Finished difference Result 851 states and 1143 transitions. [2019-09-20 13:27:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:27:07,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-09-20 13:27:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,971 INFO L225 Difference]: With dead ends: 851 [2019-09-20 13:27:07,971 INFO L226 Difference]: Without dead ends: 836 [2019-09-20 13:27:07,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-09-20 13:27:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-09-20 13:27:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-09-20 13:27:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-09-20 13:27:07,990 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 55 [2019-09-20 13:27:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,991 INFO L475 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-09-20 13:27:07,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-09-20 13:27:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:27:07,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,994 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,994 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-09-20 13:27:07,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:27:08,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:27:08,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:27:08,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:27:08,117 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-09-20 13:27:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,349 INFO L93 Difference]: Finished difference Result 846 states and 1136 transitions. [2019-09-20 13:27:08,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:27:08,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:27:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,354 INFO L225 Difference]: With dead ends: 846 [2019-09-20 13:27:08,354 INFO L226 Difference]: Without dead ends: 831 [2019-09-20 13:27:08,355 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-20 13:27:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-09-20 13:27:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-20 13:27:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2019-09-20 13:27:08,370 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 56 [2019-09-20 13:27:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,370 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2019-09-20 13:27:08,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:27:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2019-09-20 13:27:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:08,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,373 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:08,374 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2026975246, now seen corresponding path program 1 times [2019-09-20 13:27:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:08,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:08,448 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2019-09-20 13:27:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,428 INFO L93 Difference]: Finished difference Result 1214 states and 1702 transitions. [2019-09-20 13:27:09,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:09,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-20 13:27:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,434 INFO L225 Difference]: With dead ends: 1214 [2019-09-20 13:27:09,434 INFO L226 Difference]: Without dead ends: 1214 [2019-09-20 13:27:09,434 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-09-20 13:27:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2019-09-20 13:27:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-09-20 13:27:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2019-09-20 13:27:09,455 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2019-09-20 13:27:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,455 INFO L475 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2019-09-20 13:27:09,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2019-09-20 13:27:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:09,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,458 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,459 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-09-20 13:27:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:09,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:09,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:09,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:09,599 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2019-09-20 13:27:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,844 INFO L93 Difference]: Finished difference Result 883 states and 1188 transitions. [2019-09-20 13:27:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:09,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-20 13:27:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,848 INFO L225 Difference]: With dead ends: 883 [2019-09-20 13:27:09,848 INFO L226 Difference]: Without dead ends: 866 [2019-09-20 13:27:09,848 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-20 13:27:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2019-09-20 13:27:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-09-20 13:27:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2019-09-20 13:27:09,864 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2019-09-20 13:27:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,865 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2019-09-20 13:27:09,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2019-09-20 13:27:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:09,868 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,868 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,868 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,869 INFO L82 PathProgramCache]: Analyzing trace with hash -967621732, now seen corresponding path program 1 times [2019-09-20 13:27:09,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:09,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:09,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:09,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:09,989 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2019-09-20 13:27:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,251 INFO L93 Difference]: Finished difference Result 889 states and 1193 transitions. [2019-09-20 13:27:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:10,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-09-20 13:27:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,256 INFO L225 Difference]: With dead ends: 889 [2019-09-20 13:27:10,256 INFO L226 Difference]: Without dead ends: 868 [2019-09-20 13:27:10,257 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-20 13:27:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 864. [2019-09-20 13:27:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-20 13:27:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1164 transitions. [2019-09-20 13:27:10,274 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1164 transitions. Word has length 62 [2019-09-20 13:27:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,274 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1164 transitions. [2019-09-20 13:27:10,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1164 transitions. [2019-09-20 13:27:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:10,277 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,278 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,278 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-09-20 13:27:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:27:10,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:27:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:27:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:27:10,399 INFO L87 Difference]: Start difference. First operand 864 states and 1164 transitions. Second operand 12 states. [2019-09-20 13:27:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,653 INFO L93 Difference]: Finished difference Result 887 states and 1189 transitions. [2019-09-20 13:27:10,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:27:10,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-09-20 13:27:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,658 INFO L225 Difference]: With dead ends: 887 [2019-09-20 13:27:10,658 INFO L226 Difference]: Without dead ends: 865 [2019-09-20 13:27:10,658 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:27:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-20 13:27:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2019-09-20 13:27:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-20 13:27:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1153 transitions. [2019-09-20 13:27:10,673 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1153 transitions. Word has length 59 [2019-09-20 13:27:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,673 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1153 transitions. [2019-09-20 13:27:10,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:27:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1153 transitions. [2019-09-20 13:27:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:10,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,677 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,677 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-09-20 13:27:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:10,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:10,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:10,775 INFO L87 Difference]: Start difference. First operand 863 states and 1153 transitions. Second operand 9 states. [2019-09-20 13:27:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,931 INFO L93 Difference]: Finished difference Result 882 states and 1173 transitions. [2019-09-20 13:27:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:27:10,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-20 13:27:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,939 INFO L225 Difference]: With dead ends: 882 [2019-09-20 13:27:10,939 INFO L226 Difference]: Without dead ends: 851 [2019-09-20 13:27:10,940 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-09-20 13:27:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2019-09-20 13:27:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-09-20 13:27:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1132 transitions. [2019-09-20 13:27:10,956 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1132 transitions. Word has length 59 [2019-09-20 13:27:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,956 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1132 transitions. [2019-09-20 13:27:10,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1132 transitions. [2019-09-20 13:27:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:10,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,959 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,959 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-09-20 13:27:10,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,999 INFO L87 Difference]: Start difference. First operand 851 states and 1132 transitions. Second operand 4 states. [2019-09-20 13:27:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,127 INFO L93 Difference]: Finished difference Result 896 states and 1209 transitions. [2019-09-20 13:27:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:27:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,130 INFO L225 Difference]: With dead ends: 896 [2019-09-20 13:27:11,131 INFO L226 Difference]: Without dead ends: 896 [2019-09-20 13:27:11,131 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-09-20 13:27:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 858. [2019-09-20 13:27:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-20 13:27:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1148 transitions. [2019-09-20 13:27:11,147 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1148 transitions. Word has length 60 [2019-09-20 13:27:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,148 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1148 transitions. [2019-09-20 13:27:11,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1148 transitions. [2019-09-20 13:27:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:11,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,151 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,151 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-09-20 13:27:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:27:11,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:27:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:27:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:11,257 INFO L87 Difference]: Start difference. First operand 858 states and 1148 transitions. Second operand 11 states. [2019-09-20 13:27:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,392 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2019-09-20 13:27:11,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:27:11,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-20 13:27:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,397 INFO L225 Difference]: With dead ends: 895 [2019-09-20 13:27:11,397 INFO L226 Difference]: Without dead ends: 872 [2019-09-20 13:27:11,398 INFO L636 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-09-20 13:27:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-20 13:27:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 862. [2019-09-20 13:27:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-09-20 13:27:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1166 transitions. [2019-09-20 13:27:11,424 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1166 transitions. Word has length 60 [2019-09-20 13:27:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,425 INFO L475 AbstractCegarLoop]: Abstraction has 862 states and 1166 transitions. [2019-09-20 13:27:11,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:27:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1166 transitions. [2019-09-20 13:27:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:11,429 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,429 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,429 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2019-09-20 13:27:11,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:27:11,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:27:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:27:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:27:11,538 INFO L87 Difference]: Start difference. First operand 862 states and 1166 transitions. Second operand 9 states. [2019-09-20 13:27:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,732 INFO L93 Difference]: Finished difference Result 890 states and 1200 transitions. [2019-09-20 13:27:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:27:11,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-09-20 13:27:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,737 INFO L225 Difference]: With dead ends: 890 [2019-09-20 13:27:11,738 INFO L226 Difference]: Without dead ends: 854 [2019-09-20 13:27:11,738 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-09-20 13:27:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-09-20 13:27:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-20 13:27:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2019-09-20 13:27:11,763 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 60 [2019-09-20 13:27:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,764 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2019-09-20 13:27:11,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:27:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2019-09-20 13:27:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:11,768 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,769 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,769 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2019-09-20 13:27:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:27:12,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:27:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:27:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:12,039 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 13 states. [2019-09-20 13:27:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,359 INFO L93 Difference]: Finished difference Result 868 states and 1165 transitions. [2019-09-20 13:27:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:27:12,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-09-20 13:27:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,362 INFO L225 Difference]: With dead ends: 868 [2019-09-20 13:27:12,362 INFO L226 Difference]: Without dead ends: 843 [2019-09-20 13:27:12,363 INFO L636 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-09-20 13:27:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-20 13:27:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2019-09-20 13:27:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-09-20 13:27:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1135 transitions. [2019-09-20 13:27:12,380 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1135 transitions. Word has length 69 [2019-09-20 13:27:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,380 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 1135 transitions. [2019-09-20 13:27:12,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:27:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1135 transitions. [2019-09-20 13:27:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:12,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,383 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,383 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2019-09-20 13:27:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:12,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:27:12,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:27:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:27:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:12,529 INFO L87 Difference]: Start difference. First operand 843 states and 1135 transitions. Second operand 13 states. [2019-09-20 13:27:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,830 INFO L93 Difference]: Finished difference Result 857 states and 1150 transitions. [2019-09-20 13:27:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:27:12,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-09-20 13:27:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,836 INFO L225 Difference]: With dead ends: 857 [2019-09-20 13:27:12,836 INFO L226 Difference]: Without dead ends: 838 [2019-09-20 13:27:12,837 INFO L636 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-09-20 13:27:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-20 13:27:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-20 13:27:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:27:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1128 transitions. [2019-09-20 13:27:12,858 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1128 transitions. Word has length 63 [2019-09-20 13:27:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,860 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1128 transitions. [2019-09-20 13:27:12,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:27:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1128 transitions. [2019-09-20 13:27:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:12,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,863 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,863 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2019-09-20 13:27:12,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:13,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:27:13,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:27:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:27:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:27:13,099 INFO L87 Difference]: Start difference. First operand 838 states and 1128 transitions. Second operand 13 states.