java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:43,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:43,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:43,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:43,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:43,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:43,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:43,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:43,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:43,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:43,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:43,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:43,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:43,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:43,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:43,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:43,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:43,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:43,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:43,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:43,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:43,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:43,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:43,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:43,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:43,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:43,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:43,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:43,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:43,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:43,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:43,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:43,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:43,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:43,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:43,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:43,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:43,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:43,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:43,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:43,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:43,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:59:43,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:43,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:43,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:43,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:43,430 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:43,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:43,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:43,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:43,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:43,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:43,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:43,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:43,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:43,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:43,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:43,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:43,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:43,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:43,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:43,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:43,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:43,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:43,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:43,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:43,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:43,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:43,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:43,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:43,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:43,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:43,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:43,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:43,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:43,506 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:43,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-09-20 12:59:43,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e11361/d3939180469c4082a99007f90b31dfaa/FLAG62fdba660 [2019-09-20 12:59:44,256 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:44,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-09-20 12:59:44,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e11361/d3939180469c4082a99007f90b31dfaa/FLAG62fdba660 [2019-09-20 12:59:44,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e11361/d3939180469c4082a99007f90b31dfaa [2019-09-20 12:59:44,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:44,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:44,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:44,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:44,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:44,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:44" (1/1) ... [2019-09-20 12:59:44,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c935a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:44, skipping insertion in model container [2019-09-20 12:59:44,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:44" (1/1) ... [2019-09-20 12:59:44,497 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:44,582 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:45,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:45,156 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:45,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:45,346 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:45,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45 WrapperNode [2019-09-20 12:59:45,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:45,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:45,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:45,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:45,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (1/1) ... [2019-09-20 12:59:45,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:45,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:45,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:45,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:45,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (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 12:59:45,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 12:59:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 12:59:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-09-20 12:59:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-09-20 12:59:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-09-20 12:59:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-09-20 12:59:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-09-20 12:59:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-09-20 12:59:45,568 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-09-20 12:59:45,568 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-09-20 12:59:45,570 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-09-20 12:59:45,570 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-09-20 12:59:45,571 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-09-20 12:59:45,571 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-09-20 12:59:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-09-20 12:59:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 12:59:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-20 12:59:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:59:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 12:59:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 12:59:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-09-20 12:59:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-09-20 12:59:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-09-20 12:59:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-09-20 12:59:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-09-20 12:59:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-09-20 12:59:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-09-20 12:59:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 12:59:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 12:59:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-20 12:59:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 12:59:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 12:59:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 12:59:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:46,214 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,383 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 12:59:46,383 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 12:59:46,392 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,440 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 12:59:46,440 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 12:59:46,464 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,486 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 12:59:46,487 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 12:59:46,570 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,667 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-09-20 12:59:46,668 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 12:59:46,668 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 12:59:46,675 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,868 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-09-20 12:59:46,869 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-09-20 12:59:46,870 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,903 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-20 12:59:46,903 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-20 12:59:46,933 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:46,949 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 12:59:46,949 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 12:59:46,954 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:47,186 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-20 12:59:47,186 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-20 12:59:47,201 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:47,206 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:47,206 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:47,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:47,231 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:59:47,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:47 BoogieIcfgContainer [2019-09-20 12:59:47,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:47,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:47,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:47,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:47,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:44" (1/3) ... [2019-09-20 12:59:47,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb33148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:47, skipping insertion in model container [2019-09-20 12:59:47,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:45" (2/3) ... [2019-09-20 12:59:47,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb33148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:47, skipping insertion in model container [2019-09-20 12:59:47,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:47" (3/3) ... [2019-09-20 12:59:47,244 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-09-20 12:59:47,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:47,264 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:47,281 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:47,319 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:47,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:47,320 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:47,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:47,321 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:47,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:47,321 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:47,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:47,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2019-09-20 12:59:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:47,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:47,362 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 12:59:47,365 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2019-09-20 12:59:47,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:47,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:47,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:47,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:47,637 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 12:59:47,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:47,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:47,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:47,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:47,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:47,664 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2019-09-20 12:59:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:47,878 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2019-09-20 12:59:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:47,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:47,907 INFO L225 Difference]: With dead ends: 891 [2019-09-20 12:59:47,908 INFO L226 Difference]: Without dead ends: 509 [2019-09-20 12:59:47,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-20 12:59:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-09-20 12:59:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-20 12:59:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2019-09-20 12:59:48,080 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2019-09-20 12:59:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:48,081 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2019-09-20 12:59:48,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2019-09-20 12:59:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:59:48,084 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:48,084 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 12:59:48,085 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2019-09-20 12:59:48,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:48,363 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 12:59:48,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:48,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:48,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:48,367 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2019-09-20 12:59:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:48,626 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2019-09-20 12:59:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:48,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 12:59:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:48,636 INFO L225 Difference]: With dead ends: 795 [2019-09-20 12:59:48,637 INFO L226 Difference]: Without dead ends: 674 [2019-09-20 12:59:48,638 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 12:59:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-20 12:59:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2019-09-20 12:59:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-20 12:59:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2019-09-20 12:59:48,684 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2019-09-20 12:59:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:48,685 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2019-09-20 12:59:48,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2019-09-20 12:59:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:59:48,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:48,688 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 12:59:48,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -584641203, now seen corresponding path program 1 times [2019-09-20 12:59:48,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:48,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:48,769 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2019-09-20 12:59:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:48,822 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2019-09-20 12:59:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:48,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 12:59:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:48,829 INFO L225 Difference]: With dead ends: 1001 [2019-09-20 12:59:48,829 INFO L226 Difference]: Without dead ends: 823 [2019-09-20 12:59:48,830 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 12:59:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-09-20 12:59:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2019-09-20 12:59:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-20 12:59:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2019-09-20 12:59:48,874 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2019-09-20 12:59:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:48,874 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2019-09-20 12:59:48,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2019-09-20 12:59:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:48,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:48,877 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:48,877 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1008074, now seen corresponding path program 1 times [2019-09-20 12:59:48,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:48,957 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 12:59:48,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:48,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:48,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:48,959 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2019-09-20 12:59:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:49,172 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2019-09-20 12:59:49,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:49,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 12:59:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:49,183 INFO L225 Difference]: With dead ends: 1430 [2019-09-20 12:59:49,183 INFO L226 Difference]: Without dead ends: 1164 [2019-09-20 12:59:49,185 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 12:59:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-20 12:59:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2019-09-20 12:59:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-20 12:59:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2019-09-20 12:59:49,264 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2019-09-20 12:59:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:49,266 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2019-09-20 12:59:49,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2019-09-20 12:59:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:49,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:49,271 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 12:59:49,272 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -269643889, now seen corresponding path program 1 times [2019-09-20 12:59:49,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:49,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:49,429 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 12:59:49,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:49,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:49,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:49,431 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2019-09-20 12:59:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:50,326 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2019-09-20 12:59:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:50,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 12:59:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:50,334 INFO L225 Difference]: With dead ends: 1570 [2019-09-20 12:59:50,334 INFO L226 Difference]: Without dead ends: 990 [2019-09-20 12:59:50,337 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 12:59:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-09-20 12:59:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2019-09-20 12:59:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-20 12:59:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2019-09-20 12:59:50,428 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2019-09-20 12:59:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:50,429 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2019-09-20 12:59:50,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2019-09-20 12:59:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 12:59:50,431 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:50,432 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 12:59:50,432 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 428268071, now seen corresponding path program 1 times [2019-09-20 12:59:50,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:50,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:50,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:50,489 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 12:59:50,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:50,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:50,490 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2019-09-20 12:59:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:50,580 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2019-09-20 12:59:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:50,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 12:59:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:50,587 INFO L225 Difference]: With dead ends: 892 [2019-09-20 12:59:50,587 INFO L226 Difference]: Without dead ends: 888 [2019-09-20 12:59:50,588 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 12:59:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-20 12:59:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2019-09-20 12:59:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-20 12:59:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2019-09-20 12:59:50,647 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2019-09-20 12:59:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:50,648 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2019-09-20 12:59:50,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2019-09-20 12:59:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:50,650 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:50,651 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 12:59:50,651 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1410155750, now seen corresponding path program 1 times [2019-09-20 12:59:50,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:50,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:50,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:50,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:50,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:50,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:50,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:50,729 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2019-09-20 12:59:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:50,803 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2019-09-20 12:59:50,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:50,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 12:59:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:50,814 INFO L225 Difference]: With dead ends: 1280 [2019-09-20 12:59:50,814 INFO L226 Difference]: Without dead ends: 1019 [2019-09-20 12:59:50,818 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 12:59:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-20 12:59:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2019-09-20 12:59:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-20 12:59:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2019-09-20 12:59:50,889 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2019-09-20 12:59:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:50,890 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2019-09-20 12:59:50,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2019-09-20 12:59:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 12:59:50,893 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:50,893 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 12:59:50,894 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2019-09-20 12:59:50,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:50,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:50,973 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 12:59:50,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:50,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:50,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:50,977 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2019-09-20 12:59:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:51,046 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2019-09-20 12:59:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:51,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-20 12:59:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:51,062 INFO L225 Difference]: With dead ends: 976 [2019-09-20 12:59:51,062 INFO L226 Difference]: Without dead ends: 956 [2019-09-20 12:59:51,064 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 12:59:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-20 12:59:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2019-09-20 12:59:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 12:59:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2019-09-20 12:59:51,125 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2019-09-20 12:59:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:51,127 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2019-09-20 12:59:51,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2019-09-20 12:59:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 12:59:51,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:51,131 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 12:59:51,132 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -539598420, now seen corresponding path program 1 times [2019-09-20 12:59:51,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:51,200 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 12:59:51,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:51,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:51,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:51,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:51,202 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2019-09-20 12:59:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:51,262 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2019-09-20 12:59:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:51,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 12:59:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:51,269 INFO L225 Difference]: With dead ends: 1175 [2019-09-20 12:59:51,269 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 12:59:51,271 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 12:59:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 12:59:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2019-09-20 12:59:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 12:59:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2019-09-20 12:59:51,325 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2019-09-20 12:59:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:51,325 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2019-09-20 12:59:51,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2019-09-20 12:59:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:51,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:51,329 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 12:59:51,329 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1793960754, now seen corresponding path program 1 times [2019-09-20 12:59:51,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:51,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:51,382 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 12:59:51,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:51,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:51,384 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2019-09-20 12:59:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:51,802 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2019-09-20 12:59:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:51,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 12:59:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:51,808 INFO L225 Difference]: With dead ends: 1022 [2019-09-20 12:59:51,808 INFO L226 Difference]: Without dead ends: 793 [2019-09-20 12:59:51,809 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 12:59:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-20 12:59:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2019-09-20 12:59:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-20 12:59:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2019-09-20 12:59:51,850 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2019-09-20 12:59:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:51,851 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2019-09-20 12:59:51,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2019-09-20 12:59:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:51,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:51,854 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 12:59:51,854 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2019-09-20 12:59:51,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:51,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:51,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:51,907 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 12:59:51,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:51,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:51,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:51,910 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2019-09-20 12:59:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:51,957 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2019-09-20 12:59:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:51,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-20 12:59:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:51,963 INFO L225 Difference]: With dead ends: 879 [2019-09-20 12:59:51,963 INFO L226 Difference]: Without dead ends: 783 [2019-09-20 12:59:51,965 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 12:59:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-20 12:59:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2019-09-20 12:59:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-20 12:59:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2019-09-20 12:59:52,016 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2019-09-20 12:59:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:52,016 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2019-09-20 12:59:52,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2019-09-20 12:59:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 12:59:52,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,019 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 12:59:52,019 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2019-09-20 12:59:52,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:52,067 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 12:59:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:52,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:52,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:52,069 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2019-09-20 12:59:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:52,181 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2019-09-20 12:59:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:52,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-20 12:59:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:52,187 INFO L225 Difference]: With dead ends: 957 [2019-09-20 12:59:52,187 INFO L226 Difference]: Without dead ends: 943 [2019-09-20 12:59:52,188 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 12:59:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-20 12:59:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2019-09-20 12:59:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 12:59:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2019-09-20 12:59:52,236 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2019-09-20 12:59:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:52,236 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2019-09-20 12:59:52,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2019-09-20 12:59:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:52,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,239 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 12:59:52,239 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,239 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2019-09-20 12:59:52,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:52,305 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 12:59:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:52,306 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2019-09-20 12:59:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:52,456 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2019-09-20 12:59:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:52,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 12:59:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:52,462 INFO L225 Difference]: With dead ends: 863 [2019-09-20 12:59:52,462 INFO L226 Difference]: Without dead ends: 859 [2019-09-20 12:59:52,463 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 12:59:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-20 12:59:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2019-09-20 12:59:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-09-20 12:59:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2019-09-20 12:59:52,531 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2019-09-20 12:59:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:52,533 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2019-09-20 12:59:52,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2019-09-20 12:59:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:52,537 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,537 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 12:59:52,537 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2019-09-20 12:59:52,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:52,668 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 12:59:52,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:52,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:52,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:52,671 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2019-09-20 12:59:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:52,809 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2019-09-20 12:59:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:52,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 12:59:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:52,817 INFO L225 Difference]: With dead ends: 898 [2019-09-20 12:59:52,817 INFO L226 Difference]: Without dead ends: 877 [2019-09-20 12:59:52,820 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 12:59:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-09-20 12:59:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2019-09-20 12:59:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 12:59:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2019-09-20 12:59:52,881 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2019-09-20 12:59:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:52,881 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2019-09-20 12:59:52,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2019-09-20 12:59:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:52,889 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,889 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 12:59:52,890 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2019-09-20 12:59:52,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:52,951 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 12:59:52,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:52,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:52,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:52,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:52,952 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2019-09-20 12:59:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:53,016 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2019-09-20 12:59:53,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:53,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 12:59:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:53,022 INFO L225 Difference]: With dead ends: 901 [2019-09-20 12:59:53,022 INFO L226 Difference]: Without dead ends: 879 [2019-09-20 12:59:53,025 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 12:59:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-20 12:59:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2019-09-20 12:59:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 12:59:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2019-09-20 12:59:53,073 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2019-09-20 12:59:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:53,074 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2019-09-20 12:59:53,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2019-09-20 12:59:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:53,076 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:53,077 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 12:59:53,077 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2019-09-20 12:59:53,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:53,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:53,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:59:53,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:53,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:53,166 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2019-09-20 12:59:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:54,501 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2019-09-20 12:59:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:54,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-20 12:59:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:54,508 INFO L225 Difference]: With dead ends: 1088 [2019-09-20 12:59:54,508 INFO L226 Difference]: Without dead ends: 997 [2019-09-20 12:59:54,509 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 12:59:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-20 12:59:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2019-09-20 12:59:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-09-20 12:59:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2019-09-20 12:59:54,565 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2019-09-20 12:59:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:54,565 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2019-09-20 12:59:54,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2019-09-20 12:59:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:54,569 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:54,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, 1, 1] [2019-09-20 12:59:54,569 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:54,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2019-09-20 12:59:54,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:54,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:54,619 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 12:59:54,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:54,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:54,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:54,620 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2019-09-20 12:59:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:54,734 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2019-09-20 12:59:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:54,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 12:59:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:54,741 INFO L225 Difference]: With dead ends: 1038 [2019-09-20 12:59:54,741 INFO L226 Difference]: Without dead ends: 998 [2019-09-20 12:59:54,743 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 12:59:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-20 12:59:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2019-09-20 12:59:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-20 12:59:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2019-09-20 12:59:54,798 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2019-09-20 12:59:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:54,798 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2019-09-20 12:59:54,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2019-09-20 12:59:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:54,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:54,801 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 12:59:54,801 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2019-09-20 12:59:54,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:54,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,078 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 12:59:55,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 12:59:55,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:59:55,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:59:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:59:55,080 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 15 states. [2019-09-20 12:59:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,631 INFO L93 Difference]: Finished difference Result 1077 states and 1501 transitions. [2019-09-20 12:59:58,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 12:59:58,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-09-20 12:59:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,638 INFO L225 Difference]: With dead ends: 1077 [2019-09-20 12:59:58,638 INFO L226 Difference]: Without dead ends: 1056 [2019-09-20 12:59:58,640 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-09-20 12:59:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-20 12:59:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 891. [2019-09-20 12:59:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-20 12:59:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1202 transitions. [2019-09-20 12:59:58,713 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1202 transitions. Word has length 50 [2019-09-20 12:59:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,713 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1202 transitions. [2019-09-20 12:59:58,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 12:59:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1202 transitions. [2019-09-20 12:59:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:58,720 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,721 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 12:59:58,721 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash -120624203, now seen corresponding path program 1 times [2019-09-20 12:59:58,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 12:59:58,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:58,944 INFO L87 Difference]: Start difference. First operand 891 states and 1202 transitions. Second operand 10 states. [2019-09-20 13:00:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,478 INFO L93 Difference]: Finished difference Result 1165 states and 1621 transitions. [2019-09-20 13:00:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:01,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-20 13:00:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,487 INFO L225 Difference]: With dead ends: 1165 [2019-09-20 13:00:01,487 INFO L226 Difference]: Without dead ends: 1144 [2019-09-20 13:00:01,488 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-20 13:00:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 895. [2019-09-20 13:00:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-20 13:00:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1204 transitions. [2019-09-20 13:00:01,545 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1204 transitions. Word has length 50 [2019-09-20 13:00:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,545 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1204 transitions. [2019-09-20 13:00:01,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1204 transitions. [2019-09-20 13:00:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:01,548 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,548 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:00:01,549 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2019-09-20 13:00:01,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,590 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:00:01,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:01,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:01,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:01,592 INFO L87 Difference]: Start difference. First operand 895 states and 1204 transitions. Second operand 3 states. [2019-09-20 13:00:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,709 INFO L93 Difference]: Finished difference Result 923 states and 1236 transitions. [2019-09-20 13:00:01,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:01,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-20 13:00:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,715 INFO L225 Difference]: With dead ends: 923 [2019-09-20 13:00:01,715 INFO L226 Difference]: Without dead ends: 918 [2019-09-20 13:00:01,716 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:00:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-20 13:00:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2019-09-20 13:00:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-20 13:00:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1225 transitions. [2019-09-20 13:00:01,767 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1225 transitions. Word has length 52 [2019-09-20 13:00:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,767 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1225 transitions. [2019-09-20 13:00:01,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1225 transitions. [2019-09-20 13:00:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:01,770 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,770 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:00:01,771 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2019-09-20 13:00:01,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:01,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:01,808 INFO L87 Difference]: Start difference. First operand 912 states and 1225 transitions. Second operand 3 states. [2019-09-20 13:00:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,889 INFO L93 Difference]: Finished difference Result 1128 states and 1513 transitions. [2019-09-20 13:00:01,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:01,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:00:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,894 INFO L225 Difference]: With dead ends: 1128 [2019-09-20 13:00:01,895 INFO L226 Difference]: Without dead ends: 881 [2019-09-20 13:00:01,896 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:00:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-20 13:00:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2019-09-20 13:00:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:00:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1185 transitions. [2019-09-20 13:00:01,948 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1185 transitions. Word has length 54 [2019-09-20 13:00:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,949 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1185 transitions. [2019-09-20 13:00:01,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1185 transitions. [2019-09-20 13:00:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:01,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,952 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:00:01,953 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2019-09-20 13:00:01,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:02,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:00:02,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:00:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:00:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:02,116 INFO L87 Difference]: Start difference. First operand 881 states and 1185 transitions. Second operand 13 states. [2019-09-20 13:00:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,984 INFO L93 Difference]: Finished difference Result 918 states and 1226 transitions. [2019-09-20 13:00:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:00:03,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-20 13:00:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,992 INFO L225 Difference]: With dead ends: 918 [2019-09-20 13:00:03,993 INFO L226 Difference]: Without dead ends: 912 [2019-09-20 13:00:03,993 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:00:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-20 13:00:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 881. [2019-09-20 13:00:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:00:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1184 transitions. [2019-09-20 13:00:04,044 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1184 transitions. Word has length 53 [2019-09-20 13:00:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:04,044 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1184 transitions. [2019-09-20 13:00:04,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:00:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1184 transitions. [2019-09-20 13:00:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:04,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:04,048 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:00:04,048 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1853675269, now seen corresponding path program 1 times [2019-09-20 13:00:04,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:04,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:04,152 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:00:04,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:04,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:04,154 INFO L87 Difference]: Start difference. First operand 881 states and 1184 transitions. Second operand 10 states. [2019-09-20 13:00:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,553 INFO L93 Difference]: Finished difference Result 1138 states and 1584 transitions. [2019-09-20 13:00:06,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:06,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-20 13:00:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,559 INFO L225 Difference]: With dead ends: 1138 [2019-09-20 13:00:06,559 INFO L226 Difference]: Without dead ends: 1132 [2019-09-20 13:00:06,560 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-09-20 13:00:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 881. [2019-09-20 13:00:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:00:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1183 transitions. [2019-09-20 13:00:06,616 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1183 transitions. Word has length 53 [2019-09-20 13:00:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,616 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1183 transitions. [2019-09-20 13:00:06,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1183 transitions. [2019-09-20 13:00:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:06,620 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,620 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:00:06,620 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2019-09-20 13:00:06,621 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,755 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:00:06,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:06,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:06,757 INFO L87 Difference]: Start difference. First operand 881 states and 1183 transitions. Second operand 11 states. [2019-09-20 13:00:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:08,058 INFO L93 Difference]: Finished difference Result 904 states and 1207 transitions. [2019-09-20 13:00:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:08,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-20 13:00:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:08,064 INFO L225 Difference]: With dead ends: 904 [2019-09-20 13:00:08,064 INFO L226 Difference]: Without dead ends: 880 [2019-09-20 13:00:08,068 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-09-20 13:00:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2019-09-20 13:00:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-09-20 13:00:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1181 transitions. [2019-09-20 13:00:08,120 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1181 transitions. Word has length 52 [2019-09-20 13:00:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:08,122 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1181 transitions. [2019-09-20 13:00:08,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1181 transitions. [2019-09-20 13:00:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:08,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:08,126 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:00:08,126 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2080253382, now seen corresponding path program 1 times [2019-09-20 13:00:08,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:08,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:08,172 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:00:08,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:08,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:08,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:08,173 INFO L87 Difference]: Start difference. First operand 880 states and 1181 transitions. Second operand 5 states. [2019-09-20 13:00:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:08,773 INFO L93 Difference]: Finished difference Result 895 states and 1196 transitions. [2019-09-20 13:00:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:08,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-20 13:00:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:08,780 INFO L225 Difference]: With dead ends: 895 [2019-09-20 13:00:08,780 INFO L226 Difference]: Without dead ends: 860 [2019-09-20 13:00:08,781 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:00:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-09-20 13:00:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 852. [2019-09-20 13:00:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:00:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1151 transitions. [2019-09-20 13:00:08,835 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1151 transitions. Word has length 52 [2019-09-20 13:00:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:08,835 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1151 transitions. [2019-09-20 13:00:08,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1151 transitions. [2019-09-20 13:00:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:08,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:08,838 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:08,839 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2019-09-20 13:00:08,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:09,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:00:09,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:00:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:00:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:09,017 INFO L87 Difference]: Start difference. First operand 852 states and 1151 transitions. Second operand 13 states. [2019-09-20 13:00:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,898 INFO L93 Difference]: Finished difference Result 887 states and 1189 transitions. [2019-09-20 13:00:10,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:00:10,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-09-20 13:00:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:10,902 INFO L225 Difference]: With dead ends: 887 [2019-09-20 13:00:10,902 INFO L226 Difference]: Without dead ends: 881 [2019-09-20 13:00:10,903 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:00:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-20 13:00:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 852. [2019-09-20 13:00:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:00:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-09-20 13:00:10,955 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 54 [2019-09-20 13:00:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:10,956 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-09-20 13:00:10,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:00:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-09-20 13:00:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:10,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00: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] [2019-09-20 13:00:10,959 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:10,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2025282552, now seen corresponding path program 1 times [2019-09-20 13:00:10,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:10,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,036 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:00:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:11,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:11,037 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 9 states. [2019-09-20 13:00:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,032 INFO L93 Difference]: Finished difference Result 1157 states and 1604 transitions. [2019-09-20 13:00:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:00:13,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-20 13:00:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,038 INFO L225 Difference]: With dead ends: 1157 [2019-09-20 13:00:13,038 INFO L226 Difference]: Without dead ends: 1107 [2019-09-20 13:00:13,039 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:00:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-09-20 13:00:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 861. [2019-09-20 13:00:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-09-20 13:00:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2019-09-20 13:00:13,097 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2019-09-20 13:00:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,097 INFO L475 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2019-09-20 13:00:13,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2019-09-20 13:00:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:00:13,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,100 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:00:13,100 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2019-09-20 13:00:13,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:13,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:13,184 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2019-09-20 13:00:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,385 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2019-09-20 13:00:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:13,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:00:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,391 INFO L225 Difference]: With dead ends: 888 [2019-09-20 13:00:13,391 INFO L226 Difference]: Without dead ends: 852 [2019-09-20 13:00:13,392 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:00:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-20 13:00:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2019-09-20 13:00:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:00:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-09-20 13:00:13,444 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2019-09-20 13:00:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,445 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-09-20 13:00:13,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-09-20 13:00:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:00:13,447 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,448 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:00:13,448 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash 100740086, now seen corresponding path program 1 times [2019-09-20 13:00:13,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:13,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:13,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:13,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:13,552 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2019-09-20 13:00:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,801 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2019-09-20 13:00:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:13,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-09-20 13:00:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,806 INFO L225 Difference]: With dead ends: 868 [2019-09-20 13:00:13,806 INFO L226 Difference]: Without dead ends: 850 [2019-09-20 13:00:13,807 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:00:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-20 13:00:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2019-09-20 13:00:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-20 13:00:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2019-09-20 13:00:13,855 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 55 [2019-09-20 13:00:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,856 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2019-09-20 13:00:13,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2019-09-20 13:00:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:00:13,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,858 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:00:13,859 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2119637056, now seen corresponding path program 1 times [2019-09-20 13:00:13,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,011 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:00:14,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:14,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:14,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:14,013 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2019-09-20 13:00:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,270 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2019-09-20 13:00:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:14,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:00:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,274 INFO L225 Difference]: With dead ends: 863 [2019-09-20 13:00:14,274 INFO L226 Difference]: Without dead ends: 845 [2019-09-20 13:00:14,275 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-20 13:00:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2019-09-20 13:00:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-09-20 13:00:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2019-09-20 13:00:14,330 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 56 [2019-09-20 13:00:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,330 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2019-09-20 13:00:14,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2019-09-20 13:00:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:00:14,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,334 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:14,334 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 463394390, now seen corresponding path program 1 times [2019-09-20 13:00:14,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:14,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:14,380 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 3 states. [2019-09-20 13:00:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,437 INFO L93 Difference]: Finished difference Result 1098 states and 1473 transitions. [2019-09-20 13:00:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:14,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:00:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,444 INFO L225 Difference]: With dead ends: 1098 [2019-09-20 13:00:14,444 INFO L226 Difference]: Without dead ends: 935 [2019-09-20 13:00:14,446 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:00:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-20 13:00:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 904. [2019-09-20 13:00:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:00:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2019-09-20 13:00:14,531 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 74 [2019-09-20 13:00:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,532 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2019-09-20 13:00:14,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2019-09-20 13:00:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:00:14,535 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,535 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:00:14,536 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -534409564, now seen corresponding path program 1 times [2019-09-20 13:00:14,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,728 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:00:14,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:00:14,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:00:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:00:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:00:14,729 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand 12 states. [2019-09-20 13:00:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,112 INFO L93 Difference]: Finished difference Result 930 states and 1243 transitions. [2019-09-20 13:00:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:00:15,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-09-20 13:00:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,116 INFO L225 Difference]: With dead ends: 930 [2019-09-20 13:00:15,117 INFO L226 Difference]: Without dead ends: 905 [2019-09-20 13:00:15,119 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:00:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-20 13:00:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2019-09-20 13:00:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-20 13:00:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1204 transitions. [2019-09-20 13:00:15,218 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1204 transitions. Word has length 59 [2019-09-20 13:00:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,218 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1204 transitions. [2019-09-20 13:00:15,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:00:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1204 transitions. [2019-09-20 13:00:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:00:15,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,221 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:00:15,222 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2019-09-20 13:00:15,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,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:00:15,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:15,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:15,376 INFO L87 Difference]: Start difference. First operand 903 states and 1204 transitions. Second operand 11 states. [2019-09-20 13:00:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,688 INFO L93 Difference]: Finished difference Result 920 states and 1222 transitions. [2019-09-20 13:00:15,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:15,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-20 13:00:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,692 INFO L225 Difference]: With dead ends: 920 [2019-09-20 13:00:15,692 INFO L226 Difference]: Without dead ends: 900 [2019-09-20 13:00:15,693 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:00:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-20 13:00:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2019-09-20 13:00:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-20 13:00:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1199 transitions. [2019-09-20 13:00:15,747 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1199 transitions. Word has length 58 [2019-09-20 13:00:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,747 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1199 transitions. [2019-09-20 13:00:15,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1199 transitions. [2019-09-20 13:00:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:00:15,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,750 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:00:15,751 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2019-09-20 13:00:15,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,872 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:00:15,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:15,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:15,873 INFO L87 Difference]: Start difference. First operand 900 states and 1199 transitions. Second operand 10 states. [2019-09-20 13:00:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,181 INFO L93 Difference]: Finished difference Result 967 states and 1274 transitions. [2019-09-20 13:00:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:16,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-20 13:00:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,185 INFO L225 Difference]: With dead ends: 967 [2019-09-20 13:00:16,186 INFO L226 Difference]: Without dead ends: 858 [2019-09-20 13:00:16,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-20 13:00:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 855. [2019-09-20 13:00:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:00:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1118 transitions. [2019-09-20 13:00:16,236 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1118 transitions. Word has length 59 [2019-09-20 13:00:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,236 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1118 transitions. [2019-09-20 13:00:16,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1118 transitions. [2019-09-20 13:00:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:00:16,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,239 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:00:16,240 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2019-09-20 13:00:16,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,282 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:00:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:16,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:16,283 INFO L87 Difference]: Start difference. First operand 855 states and 1118 transitions. Second operand 4 states. [2019-09-20 13:00:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,428 INFO L93 Difference]: Finished difference Result 1012 states and 1336 transitions. [2019-09-20 13:00:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:16,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:00:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,431 INFO L225 Difference]: With dead ends: 1012 [2019-09-20 13:00:16,431 INFO L226 Difference]: Without dead ends: 904 [2019-09-20 13:00:16,432 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:00:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-20 13:00:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 862. [2019-09-20 13:00:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-09-20 13:00:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1133 transitions. [2019-09-20 13:00:16,487 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1133 transitions. Word has length 60 [2019-09-20 13:00:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,487 INFO L475 AbstractCegarLoop]: Abstraction has 862 states and 1133 transitions. [2019-09-20 13:00:16,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1133 transitions. [2019-09-20 13:00:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:00:16,490 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,490 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:00:16,491 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2019-09-20 13:00:16,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,589 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:00:16,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:16,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:16,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:16,591 INFO L87 Difference]: Start difference. First operand 862 states and 1133 transitions. Second operand 11 states. [2019-09-20 13:00:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,733 INFO L93 Difference]: Finished difference Result 931 states and 1224 transitions. [2019-09-20 13:00:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:16,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-20 13:00:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,736 INFO L225 Difference]: With dead ends: 931 [2019-09-20 13:00:16,736 INFO L226 Difference]: Without dead ends: 876 [2019-09-20 13:00:16,737 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:00:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-09-20 13:00:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 866. [2019-09-20 13:00:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-09-20 13:00:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1150 transitions. [2019-09-20 13:00:16,789 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1150 transitions. Word has length 60 [2019-09-20 13:00:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,789 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1150 transitions. [2019-09-20 13:00:16,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1150 transitions. [2019-09-20 13:00:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:00:16,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,792 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:00:16,793 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -897434082, now seen corresponding path program 1 times [2019-09-20 13:00:16,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY