java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:37:57,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:37:57,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:37:57,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:37:57,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:37:57,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:37:57,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:37:57,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:37:57,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:37:57,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:37:57,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:37:57,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:37:57,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:37:57,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:37:57,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:37:57,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:37:57,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:37:57,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:37:57,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:37:57,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:37:57,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:37:57,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:37:57,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:37:57,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:37:57,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:37:57,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:37:57,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:37:57,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:37:57,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:37:57,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:37:57,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:37:57,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:37:57,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:37:57,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:37:57,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:37:57,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:37:57,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:37:57,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:37:57,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:37:57,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:37:57,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:37:57,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:37:57,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:37:57,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:37:57,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:37:57,645 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:37:57,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:37:57,645 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:37:57,646 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:37:57,646 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:37:57,646 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:37:57,646 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:37:57,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:37:57,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:37:57,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:37:57,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:37:57,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:37:57,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:37:57,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:37:57,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:37:57,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:37:57,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:37:57,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:37:57,651 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:37:57,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:37:57,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:57,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:37:57,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:37:57,652 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:37:57,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:37:57,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:37:57,652 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:37:57,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:37:57,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:37:57,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:37:57,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:37:57,709 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:37:57,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-03 02:37:57,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7f57ab/6a7b53fb1c94427f9ade08f22f8974f4/FLAG9dfa961ef [2019-10-03 02:37:58,308 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:37:58,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-03 02:37:58,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7f57ab/6a7b53fb1c94427f9ade08f22f8974f4/FLAG9dfa961ef [2019-10-03 02:37:58,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b7f57ab/6a7b53fb1c94427f9ade08f22f8974f4 [2019-10-03 02:37:58,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:37:58,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:37:58,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:58,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:37:58,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:37:58,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:58" (1/1) ... [2019-10-03 02:37:58,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e605b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:58, skipping insertion in model container [2019-10-03 02:37:58,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:58" (1/1) ... [2019-10-03 02:37:58,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:37:58,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:37:59,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:59,217 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:37:59,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:59,362 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:37:59,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59 WrapperNode [2019-10-03 02:37:59,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:59,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:37:59,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:37:59,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:37:59,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... [2019-10-03 02:37:59,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:37:59,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:37:59,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:37:59,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:37:59,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-03 02:37:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-03 02:37:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:37:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-03 02:37:59,534 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-03 02:37:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-03 02:37:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-03 02:37:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:37:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:37:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:37:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:37:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-03 02:37:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:37:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-03 02:37:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:37:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:37:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:37:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:37:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:37:59,850 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:59,917 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:59,917 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:59,930 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:59,947 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:59,947 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:59,955 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,179 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-03 02:38:00,179 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-03 02:38:00,183 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,296 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-03 02:38:00,297 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-03 02:38:00,320 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,347 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:38:00,348 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:38:00,447 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,462 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,462 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,463 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,472 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,473 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,474 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,517 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,518 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,555 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,583 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-03 02:38:00,584 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-03 02:38:00,587 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,694 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-03 02:38:00,695 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-03 02:38:00,743 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,751 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,751 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,752 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,761 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,761 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,761 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:00,767 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:00,767 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:00,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:38:00,779 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:38:00,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:00 BoogieIcfgContainer [2019-10-03 02:38:00,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:38:00,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:38:00,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:38:00,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:38:00,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:37:58" (1/3) ... [2019-10-03 02:38:00,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fde69a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:00, skipping insertion in model container [2019-10-03 02:38:00,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:59" (2/3) ... [2019-10-03 02:38:00,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fde69a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:00, skipping insertion in model container [2019-10-03 02:38:00,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:00" (3/3) ... [2019-10-03 02:38:00,788 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-03 02:38:00,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:38:00,806 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:38:00,823 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:38:00,850 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:38:00,851 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:38:00,851 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:38:00,851 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:38:00,851 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:38:00,851 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:38:00,851 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:38:00,852 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:38:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-10-03 02:38:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:38:00,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:00,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:00,891 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-10-03 02:38:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:00,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:00,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:01,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:01,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:01,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:01,159 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-10-03 02:38:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:01,250 INFO L93 Difference]: Finished difference Result 388 states and 539 transitions. [2019-10-03 02:38:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:01,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:38:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:01,270 INFO L225 Difference]: With dead ends: 388 [2019-10-03 02:38:01,270 INFO L226 Difference]: Without dead ends: 380 [2019-10-03 02:38:01,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-03 02:38:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-03 02:38:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-03 02:38:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-10-03 02:38:01,400 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-10-03 02:38:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:01,401 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-10-03 02:38:01,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-10-03 02:38:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:38:01,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:01,404 INFO L411 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-10-03 02:38:01,404 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-10-03 02:38:01,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:01,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:01,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:01,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:01,597 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-10-03 02:38:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:01,815 INFO L93 Difference]: Finished difference Result 537 states and 728 transitions. [2019-10-03 02:38:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:01,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:38:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:01,822 INFO L225 Difference]: With dead ends: 537 [2019-10-03 02:38:01,822 INFO L226 Difference]: Without dead ends: 536 [2019-10-03 02:38:01,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-03 02:38:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-10-03 02:38:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-03 02:38:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-10-03 02:38:01,860 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-10-03 02:38:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:01,860 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-10-03 02:38:01,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-10-03 02:38:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:38:01,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:01,863 INFO L411 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-10-03 02:38:01,863 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-10-03 02:38:01,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:01,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:01,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:01,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:02,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:02,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:02,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,003 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-10-03 02:38:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,044 INFO L93 Difference]: Finished difference Result 623 states and 832 transitions. [2019-10-03 02:38:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:02,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:38:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,050 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:38:02,050 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:38:02,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:38:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-10-03 02:38:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:38:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-10-03 02:38:02,079 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-10-03 02:38:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:02,079 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-10-03 02:38:02,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-10-03 02:38:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:38:02,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:02,082 INFO L411 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] [2019-10-03 02:38:02,082 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:02,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-10-03 02:38:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:02,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:02,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,210 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-10-03 02:38:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,250 INFO L93 Difference]: Finished difference Result 788 states and 1063 transitions. [2019-10-03 02:38:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:02,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:38:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,258 INFO L225 Difference]: With dead ends: 788 [2019-10-03 02:38:02,258 INFO L226 Difference]: Without dead ends: 788 [2019-10-03 02:38:02,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-03 02:38:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-10-03 02:38:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-03 02:38:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-10-03 02:38:02,306 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-10-03 02:38:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:02,306 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-10-03 02:38:02,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-10-03 02:38:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:38:02,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:02,309 INFO L411 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] [2019-10-03 02:38:02,309 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -535412243, now seen corresponding path program 1 times [2019-10-03 02:38:02,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:02,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:02,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:02,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,351 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-10-03 02:38:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,427 INFO L93 Difference]: Finished difference Result 790 states and 1066 transitions. [2019-10-03 02:38:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:02,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:38:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,433 INFO L225 Difference]: With dead ends: 790 [2019-10-03 02:38:02,433 INFO L226 Difference]: Without dead ends: 790 [2019-10-03 02:38:02,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-03 02:38:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-10-03 02:38:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-03 02:38:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-10-03 02:38:02,462 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 38 [2019-10-03 02:38:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:02,462 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-10-03 02:38:02,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-10-03 02:38:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:38:02,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:02,465 INFO L411 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] [2019-10-03 02:38:02,465 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:02,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-10-03 02:38:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:02,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,529 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-10-03 02:38:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,615 INFO L93 Difference]: Finished difference Result 800 states and 1081 transitions. [2019-10-03 02:38:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:02,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:38:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,621 INFO L225 Difference]: With dead ends: 800 [2019-10-03 02:38:02,621 INFO L226 Difference]: Without dead ends: 800 [2019-10-03 02:38:02,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-03 02:38:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-10-03 02:38:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-03 02:38:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-10-03 02:38:02,646 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-10-03 02:38:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:02,646 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-10-03 02:38:02,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-10-03 02:38:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:38:02,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:02,649 INFO L411 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-10-03 02:38:02,649 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-10-03 02:38:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:02,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:02,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:02,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:02,694 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-10-03 02:38:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,747 INFO L93 Difference]: Finished difference Result 809 states and 1090 transitions. [2019-10-03 02:38:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:02,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-03 02:38:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,753 INFO L225 Difference]: With dead ends: 809 [2019-10-03 02:38:02,754 INFO L226 Difference]: Without dead ends: 797 [2019-10-03 02:38:02,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-03 02:38:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-03 02:38:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-03 02:38:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-10-03 02:38:02,786 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-10-03 02:38:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:02,786 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-10-03 02:38:02,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-10-03 02:38:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:38:02,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:02,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:02,789 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-10-03 02:38:02,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:02,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:02,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:02,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:02,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:02,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:02,921 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-10-03 02:38:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:02,969 INFO L93 Difference]: Finished difference Result 807 states and 1086 transitions. [2019-10-03 02:38:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:02,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-03 02:38:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:02,974 INFO L225 Difference]: With dead ends: 807 [2019-10-03 02:38:02,974 INFO L226 Difference]: Without dead ends: 790 [2019-10-03 02:38:02,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-03 02:38:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-03 02:38:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-03 02:38:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-10-03 02:38:03,002 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-10-03 02:38:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:03,003 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-10-03 02:38:03,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-10-03 02:38:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:38:03,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:03,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:03,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:03,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-10-03 02:38:03,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:03,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:03,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:03,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:03,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:03,057 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-10-03 02:38:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:03,168 INFO L93 Difference]: Finished difference Result 1165 states and 1583 transitions. [2019-10-03 02:38:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:03,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-03 02:38:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:03,177 INFO L225 Difference]: With dead ends: 1165 [2019-10-03 02:38:03,178 INFO L226 Difference]: Without dead ends: 1165 [2019-10-03 02:38:03,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-03 02:38:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-10-03 02:38:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-03 02:38:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-10-03 02:38:03,212 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-10-03 02:38:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:03,212 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-10-03 02:38:03,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-10-03 02:38:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:38:03,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:03,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:03,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-10-03 02:38:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:03,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:03,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:03,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:03,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:03,327 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 8 states. [2019-10-03 02:38:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:03,997 INFO L93 Difference]: Finished difference Result 929 states and 1250 transitions. [2019-10-03 02:38:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:03,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-03 02:38:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:04,003 INFO L225 Difference]: With dead ends: 929 [2019-10-03 02:38:04,003 INFO L226 Difference]: Without dead ends: 929 [2019-10-03 02:38:04,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:38:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-03 02:38:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 913. [2019-10-03 02:38:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-03 02:38:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-10-03 02:38:04,029 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-10-03 02:38:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:04,029 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-10-03 02:38:04,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-10-03 02:38:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:38:04,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:04,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:04,031 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-10-03 02:38:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:04,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:04,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:04,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:04,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:04,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:04,073 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-10-03 02:38:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:04,133 INFO L93 Difference]: Finished difference Result 919 states and 1241 transitions. [2019-10-03 02:38:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:04,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-03 02:38:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:04,138 INFO L225 Difference]: With dead ends: 919 [2019-10-03 02:38:04,139 INFO L226 Difference]: Without dead ends: 919 [2019-10-03 02:38:04,139 INFO L640 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-10-03 02:38:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-03 02:38:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-10-03 02:38:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-03 02:38:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-10-03 02:38:04,164 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-10-03 02:38:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:04,164 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-10-03 02:38:04,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-10-03 02:38:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:38:04,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:04,166 INFO L411 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] [2019-10-03 02:38:04,166 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-10-03 02:38:04,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:04,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:04,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:04,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:04,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:04,288 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 8 states. [2019-10-03 02:38:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,140 INFO L93 Difference]: Finished difference Result 1090 states and 1462 transitions. [2019-10-03 02:38:05,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:38:05,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-03 02:38:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,147 INFO L225 Difference]: With dead ends: 1090 [2019-10-03 02:38:05,147 INFO L226 Difference]: Without dead ends: 1090 [2019-10-03 02:38:05,147 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-03 02:38:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 906. [2019-10-03 02:38:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-03 02:38:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-10-03 02:38:05,174 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-10-03 02:38:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,174 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-10-03 02:38:05,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-10-03 02:38:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:38:05,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,176 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-10-03 02:38:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:05,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:05,253 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 8 states. [2019-10-03 02:38:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,945 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2019-10-03 02:38:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:05,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-03 02:38:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,951 INFO L225 Difference]: With dead ends: 922 [2019-10-03 02:38:05,951 INFO L226 Difference]: Without dead ends: 922 [2019-10-03 02:38:05,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:38:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-03 02:38:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 906. [2019-10-03 02:38:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-03 02:38:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-03 02:38:05,974 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-10-03 02:38:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,975 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-03 02:38:05,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-03 02:38:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:38:05,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,977 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-10-03 02:38:05,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:06,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:06,019 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-10-03 02:38:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,066 INFO L93 Difference]: Finished difference Result 912 states and 1221 transitions. [2019-10-03 02:38:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:06,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-03 02:38:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,072 INFO L225 Difference]: With dead ends: 912 [2019-10-03 02:38:06,072 INFO L226 Difference]: Without dead ends: 912 [2019-10-03 02:38:06,072 INFO L640 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-10-03 02:38:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-10-03 02:38:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-10-03 02:38:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-03 02:38:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-03 02:38:06,097 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-10-03 02:38:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,097 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-03 02:38:06,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-03 02:38:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:38:06,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,099 INFO L411 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] [2019-10-03 02:38:06,099 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-10-03 02:38:06,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:06,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:06,193 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-10-03 02:38:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,227 INFO L93 Difference]: Finished difference Result 919 states and 1226 transitions. [2019-10-03 02:38:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:06,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-03 02:38:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,236 INFO L225 Difference]: With dead ends: 919 [2019-10-03 02:38:06,263 INFO L226 Difference]: Without dead ends: 904 [2019-10-03 02:38:06,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-03 02:38:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-10-03 02:38:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-03 02:38:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-10-03 02:38:06,292 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-10-03 02:38:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,292 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-10-03 02:38:06,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-10-03 02:38:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:38:06,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,295 INFO L411 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-10-03 02:38:06,295 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-10-03 02:38:06,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:06,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:06,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,351 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-10-03 02:38:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,381 INFO L93 Difference]: Finished difference Result 919 states and 1220 transitions. [2019-10-03 02:38:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:06,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-03 02:38:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,386 INFO L225 Difference]: With dead ends: 919 [2019-10-03 02:38:06,387 INFO L226 Difference]: Without dead ends: 868 [2019-10-03 02:38:06,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-03 02:38:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-10-03 02:38:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-03 02:38:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-10-03 02:38:06,412 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-10-03 02:38:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,413 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-10-03 02:38:06,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-10-03 02:38:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:38:06,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,415 INFO L411 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-10-03 02:38:06,415 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-10-03 02:38:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:06,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:06,468 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-10-03 02:38:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,491 INFO L93 Difference]: Finished difference Result 878 states and 1171 transitions. [2019-10-03 02:38:06,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:06,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-03 02:38:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,496 INFO L225 Difference]: With dead ends: 878 [2019-10-03 02:38:06,496 INFO L226 Difference]: Without dead ends: 863 [2019-10-03 02:38:06,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-03 02:38:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-03 02:38:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-03 02:38:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-10-03 02:38:06,517 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-10-03 02:38:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,517 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-10-03 02:38:06,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-10-03 02:38:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:38:06,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,519 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-10-03 02:38:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:06,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:06,567 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-10-03 02:38:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,738 INFO L93 Difference]: Finished difference Result 614 states and 795 transitions. [2019-10-03 02:38:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:06,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-03 02:38:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,747 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:38:06,747 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 02:38:06,747 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 02:38:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-10-03 02:38:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:38:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-10-03 02:38:06,761 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-10-03 02:38:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,761 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-10-03 02:38:06,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-10-03 02:38:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:38:06,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,763 INFO L411 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-10-03 02:38:06,763 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-10-03 02:38:06,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:06,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:06,821 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-10-03 02:38:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,881 INFO L93 Difference]: Finished difference Result 594 states and 765 transitions. [2019-10-03 02:38:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:06,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-03 02:38:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,884 INFO L225 Difference]: With dead ends: 594 [2019-10-03 02:38:06,884 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:38:06,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:38:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:38:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:38:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-10-03 02:38:06,896 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-10-03 02:38:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,897 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-10-03 02:38:06,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-10-03 02:38:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:38:06,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,898 INFO L411 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-10-03 02:38:06,898 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-10-03 02:38:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:06,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,943 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-10-03 02:38:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,041 INFO L93 Difference]: Finished difference Result 770 states and 993 transitions. [2019-10-03 02:38:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:07,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-03 02:38:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,047 INFO L225 Difference]: With dead ends: 770 [2019-10-03 02:38:07,048 INFO L226 Difference]: Without dead ends: 752 [2019-10-03 02:38:07,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-03 02:38:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-10-03 02:38:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-03 02:38:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-10-03 02:38:07,071 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-10-03 02:38:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,071 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-10-03 02:38:07,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-10-03 02:38:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:38:07,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,074 INFO L411 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] [2019-10-03 02:38:07,074 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-10-03 02:38:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:07,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:07,159 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-10-03 02:38:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,274 INFO L93 Difference]: Finished difference Result 639 states and 809 transitions. [2019-10-03 02:38:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:07,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-03 02:38:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,278 INFO L225 Difference]: With dead ends: 639 [2019-10-03 02:38:07,278 INFO L226 Difference]: Without dead ends: 612 [2019-10-03 02:38:07,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:38:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-03 02:38:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-03 02:38:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-03 02:38:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-10-03 02:38:07,293 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-10-03 02:38:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,293 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-10-03 02:38:07,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-10-03 02:38:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:38:07,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,296 INFO L411 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] [2019-10-03 02:38:07,296 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-10-03 02:38:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:07,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:07,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:07,355 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-10-03 02:38:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,393 INFO L93 Difference]: Finished difference Result 615 states and 779 transitions. [2019-10-03 02:38:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:07,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-03 02:38:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,397 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:38:07,397 INFO L226 Difference]: Without dead ends: 612 [2019-10-03 02:38:07,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-03 02:38:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-03 02:38:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-03 02:38:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-03 02:38:07,434 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-10-03 02:38:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,435 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-03 02:38:07,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-03 02:38:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:38:07,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,436 INFO L411 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] [2019-10-03 02:38:07,437 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-10-03 02:38:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:07,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:07,525 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-10-03 02:38:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,680 INFO L93 Difference]: Finished difference Result 639 states and 807 transitions. [2019-10-03 02:38:07,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:07,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-03 02:38:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,683 INFO L225 Difference]: With dead ends: 639 [2019-10-03 02:38:07,683 INFO L226 Difference]: Without dead ends: 638 [2019-10-03 02:38:07,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-03 02:38:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-10-03 02:38:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:38:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-10-03 02:38:07,699 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-10-03 02:38:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,699 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-10-03 02:38:07,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-10-03 02:38:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:38:07,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,703 INFO L411 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] [2019-10-03 02:38:07,704 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-10-03 02:38:07,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:07,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:07,776 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-10-03 02:38:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,872 INFO L93 Difference]: Finished difference Result 684 states and 879 transitions. [2019-10-03 02:38:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:07,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-03 02:38:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,876 INFO L225 Difference]: With dead ends: 684 [2019-10-03 02:38:07,877 INFO L226 Difference]: Without dead ends: 670 [2019-10-03 02:38:07,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:38:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-03 02:38:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-10-03 02:38:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:38:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-10-03 02:38:07,893 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-10-03 02:38:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,893 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-10-03 02:38:07,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-10-03 02:38:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:38:07,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:07,896 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-10-03 02:38:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:08,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:08,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:38:08,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:08,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:38:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:38:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:38:08,106 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 15 states. [2019-10-03 02:38:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:11,553 INFO L93 Difference]: Finished difference Result 808 states and 1051 transitions. [2019-10-03 02:38:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 02:38:11,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-10-03 02:38:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:11,560 INFO L225 Difference]: With dead ends: 808 [2019-10-03 02:38:11,560 INFO L226 Difference]: Without dead ends: 794 [2019-10-03 02:38:11,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:38:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-03 02:38:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 662. [2019-10-03 02:38:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-03 02:38:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 850 transitions. [2019-10-03 02:38:11,581 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 850 transitions. Word has length 52 [2019-10-03 02:38:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:11,582 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 850 transitions. [2019-10-03 02:38:11,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:38:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 850 transitions. [2019-10-03 02:38:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:38:11,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:11,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:11,585 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 472130064, now seen corresponding path program 1 times [2019-10-03 02:38:11,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:11,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:11,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:11,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:38:11,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:11,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:38:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:38:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:38:11,718 INFO L87 Difference]: Start difference. First operand 662 states and 850 transitions. Second operand 10 states. [2019-10-03 02:38:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:13,721 INFO L93 Difference]: Finished difference Result 845 states and 1107 transitions. [2019-10-03 02:38:13,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:38:13,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-03 02:38:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:13,727 INFO L225 Difference]: With dead ends: 845 [2019-10-03 02:38:13,727 INFO L226 Difference]: Without dead ends: 833 [2019-10-03 02:38:13,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:38:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-10-03 02:38:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 676. [2019-10-03 02:38:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-03 02:38:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 863 transitions. [2019-10-03 02:38:13,745 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 863 transitions. Word has length 52 [2019-10-03 02:38:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:13,746 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 863 transitions. [2019-10-03 02:38:13,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:38:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 863 transitions. [2019-10-03 02:38:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:38:13,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:13,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:13,748 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-10-03 02:38:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:13,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:13,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:13,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:13,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:13,860 INFO L87 Difference]: Start difference. First operand 676 states and 863 transitions. Second operand 7 states. [2019-10-03 02:38:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,697 INFO L93 Difference]: Finished difference Result 714 states and 910 transitions. [2019-10-03 02:38:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:38:14,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-03 02:38:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,703 INFO L225 Difference]: With dead ends: 714 [2019-10-03 02:38:14,703 INFO L226 Difference]: Without dead ends: 714 [2019-10-03 02:38:14,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:38:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-03 02:38:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 694. [2019-10-03 02:38:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-03 02:38:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 886 transitions. [2019-10-03 02:38:14,718 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 886 transitions. Word has length 52 [2019-10-03 02:38:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,718 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 886 transitions. [2019-10-03 02:38:14,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 886 transitions. [2019-10-03 02:38:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:38:14,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:14,720 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-10-03 02:38:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:14,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,761 INFO L87 Difference]: Start difference. First operand 694 states and 886 transitions. Second operand 3 states. [2019-10-03 02:38:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,851 INFO L93 Difference]: Finished difference Result 838 states and 1084 transitions. [2019-10-03 02:38:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-03 02:38:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,855 INFO L225 Difference]: With dead ends: 838 [2019-10-03 02:38:14,855 INFO L226 Difference]: Without dead ends: 781 [2019-10-03 02:38:14,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-03 02:38:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 667. [2019-10-03 02:38:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-03 02:38:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 865 transitions. [2019-10-03 02:38:14,872 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 865 transitions. Word has length 52 [2019-10-03 02:38:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,872 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 865 transitions. [2019-10-03 02:38:14,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 865 transitions. [2019-10-03 02:38:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:38:14,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:14,874 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 53035812, now seen corresponding path program 1 times [2019-10-03 02:38:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:14,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,930 INFO L87 Difference]: Start difference. First operand 667 states and 865 transitions. Second operand 3 states. [2019-10-03 02:38:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,972 INFO L93 Difference]: Finished difference Result 661 states and 848 transitions. [2019-10-03 02:38:14,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-03 02:38:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,977 INFO L225 Difference]: With dead ends: 661 [2019-10-03 02:38:14,977 INFO L226 Difference]: Without dead ends: 661 [2019-10-03 02:38:14,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-03 02:38:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-10-03 02:38:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-03 02:38:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-03 02:38:14,992 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 61 [2019-10-03 02:38:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,992 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-03 02:38:14,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-03 02:38:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:38:14,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:14,994 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-10-03 02:38:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:38:15,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:38:15,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:38:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:15,147 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 11 states. [2019-10-03 02:38:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,277 INFO L93 Difference]: Finished difference Result 703 states and 915 transitions. [2019-10-03 02:38:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:38:16,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-03 02:38:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,281 INFO L225 Difference]: With dead ends: 703 [2019-10-03 02:38:16,281 INFO L226 Difference]: Without dead ends: 691 [2019-10-03 02:38:16,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:38:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-03 02:38:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 661. [2019-10-03 02:38:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-03 02:38:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-03 02:38:16,296 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 54 [2019-10-03 02:38:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,296 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-03 02:38:16,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:38:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-03 02:38:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:38:16,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:16,299 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 837184011, now seen corresponding path program 1 times [2019-10-03 02:38:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:16,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:16,362 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 5 states. [2019-10-03 02:38:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,751 INFO L93 Difference]: Finished difference Result 724 states and 924 transitions. [2019-10-03 02:38:16,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:16,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-03 02:38:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,755 INFO L225 Difference]: With dead ends: 724 [2019-10-03 02:38:16,755 INFO L226 Difference]: Without dead ends: 710 [2019-10-03 02:38:16,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-03 02:38:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 643. [2019-10-03 02:38:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-03 02:38:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 820 transitions. [2019-10-03 02:38:16,770 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 820 transitions. Word has length 54 [2019-10-03 02:38:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,770 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 820 transitions. [2019-10-03 02:38:16,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 820 transitions. [2019-10-03 02:38:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:38:16,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:16,772 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-10-03 02:38:16,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:16,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:16,851 INFO L87 Difference]: Start difference. First operand 643 states and 820 transitions. Second operand 8 states. [2019-10-03 02:38:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,900 INFO L93 Difference]: Finished difference Result 653 states and 829 transitions. [2019-10-03 02:38:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:16,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-03 02:38:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,904 INFO L225 Difference]: With dead ends: 653 [2019-10-03 02:38:16,904 INFO L226 Difference]: Without dead ends: 628 [2019-10-03 02:38:16,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-03 02:38:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-10-03 02:38:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-03 02:38:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 801 transitions. [2019-10-03 02:38:16,919 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 801 transitions. Word has length 55 [2019-10-03 02:38:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,919 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 801 transitions. [2019-10-03 02:38:16,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 801 transitions. [2019-10-03 02:38:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:38:16,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:16,921 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 682290104, now seen corresponding path program 1 times [2019-10-03 02:38:16,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:17,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:17,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:17,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:17,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:17,001 INFO L87 Difference]: Start difference. First operand 628 states and 801 transitions. Second operand 8 states. [2019-10-03 02:38:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,131 INFO L93 Difference]: Finished difference Result 648 states and 821 transitions. [2019-10-03 02:38:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:17,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-03 02:38:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,135 INFO L225 Difference]: With dead ends: 648 [2019-10-03 02:38:17,135 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:38:17,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:38:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:38:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:38:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 793 transitions. [2019-10-03 02:38:17,147 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 793 transitions. Word has length 56 [2019-10-03 02:38:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,147 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 793 transitions. [2019-10-03 02:38:17,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 793 transitions. [2019-10-03 02:38:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:38:17,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:17,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:17,149 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-10-03 02:38:17,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:17,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:17,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:17,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:17,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:17,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:17,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:17,264 INFO L87 Difference]: Start difference. First operand 623 states and 793 transitions. Second operand 5 states. [2019-10-03 02:38:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,278 INFO L93 Difference]: Finished difference Result 565 states and 709 transitions. [2019-10-03 02:38:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:17,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-03 02:38:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,282 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:38:17,283 INFO L226 Difference]: Without dead ends: 565 [2019-10-03 02:38:17,283 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-03 02:38:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-10-03 02:38:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-03 02:38:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 709 transitions. [2019-10-03 02:38:17,298 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 709 transitions. Word has length 64 [2019-10-03 02:38:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,299 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 709 transitions. [2019-10-03 02:38:17,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 709 transitions. [2019-10-03 02:38:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:38:17,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:17,305 INFO L411 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-10-03 02:38:17,305 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash 315715581, now seen corresponding path program 1 times [2019-10-03 02:38:17,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:17,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:17,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:17,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:17,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:17,399 INFO L87 Difference]: Start difference. First operand 565 states and 709 transitions. Second operand 6 states. [2019-10-03 02:38:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,456 INFO L93 Difference]: Finished difference Result 581 states and 725 transitions. [2019-10-03 02:38:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:17,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-03 02:38:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,460 INFO L225 Difference]: With dead ends: 581 [2019-10-03 02:38:17,460 INFO L226 Difference]: Without dead ends: 560 [2019-10-03 02:38:17,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-03 02:38:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-03 02:38:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-03 02:38:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 703 transitions. [2019-10-03 02:38:17,470 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 703 transitions. Word has length 60 [2019-10-03 02:38:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,470 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 703 transitions. [2019-10-03 02:38:17,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 703 transitions. [2019-10-03 02:38:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 02:38:17,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:17,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:17,474 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-10-03 02:38:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:17,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:17,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:17,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:17,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:17,555 INFO L87 Difference]: Start difference. First operand 560 states and 703 transitions. Second operand 5 states. [2019-10-03 02:38:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,892 INFO L93 Difference]: Finished difference Result 560 states and 701 transitions. [2019-10-03 02:38:17,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:17,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-03 02:38:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,903 INFO L225 Difference]: With dead ends: 560 [2019-10-03 02:38:17,904 INFO L226 Difference]: Without dead ends: 560 [2019-10-03 02:38:17,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-03 02:38:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-03 02:38:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-03 02:38:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 701 transitions. [2019-10-03 02:38:17,922 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 701 transitions. Word has length 68 [2019-10-03 02:38:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,923 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 701 transitions. [2019-10-03 02:38:17,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 701 transitions. [2019-10-03 02:38:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:38:17,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:17,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:17,927 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash -701574740, now seen corresponding path program 1 times [2019-10-03 02:38:17,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:17,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:18,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:18,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:18,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:18,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:18,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:18,007 INFO L87 Difference]: Start difference. First operand 560 states and 701 transitions. Second operand 9 states. [2019-10-03 02:38:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:18,183 INFO L93 Difference]: Finished difference Result 586 states and 729 transitions. [2019-10-03 02:38:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:18,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-03 02:38:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:18,186 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:38:18,186 INFO L226 Difference]: Without dead ends: 555 [2019-10-03 02:38:18,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-03 02:38:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-03 02:38:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:38:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 693 transitions. [2019-10-03 02:38:18,197 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 693 transitions. Word has length 61 [2019-10-03 02:38:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:18,199 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 693 transitions. [2019-10-03 02:38:18,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 693 transitions. [2019-10-03 02:38:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:38:18,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:18,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:18,201 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-10-03 02:38:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:18,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:18,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:18,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:18,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:18,271 INFO L87 Difference]: Start difference. First operand 555 states and 693 transitions. Second operand 5 states. [2019-10-03 02:38:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:18,292 INFO L93 Difference]: Finished difference Result 561 states and 700 transitions. [2019-10-03 02:38:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:18,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-03 02:38:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:18,295 INFO L225 Difference]: With dead ends: 561 [2019-10-03 02:38:18,295 INFO L226 Difference]: Without dead ends: 561 [2019-10-03 02:38:18,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-03 02:38:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-03 02:38:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-03 02:38:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-03 02:38:18,304 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 63 [2019-10-03 02:38:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:18,305 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-03 02:38:18,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-03 02:38:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:38:18,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:18,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:18,307 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-10-03 02:38:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:18,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:18,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:18,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:18,408 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 9 states. [2019-10-03 02:38:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:18,466 INFO L93 Difference]: Finished difference Result 564 states and 701 transitions. [2019-10-03 02:38:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:18,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-03 02:38:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:18,469 INFO L225 Difference]: With dead ends: 564 [2019-10-03 02:38:18,469 INFO L226 Difference]: Without dead ends: 561 [2019-10-03 02:38:18,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-03 02:38:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-03 02:38:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-03 02:38:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 696 transitions. [2019-10-03 02:38:18,478 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 696 transitions. Word has length 63 [2019-10-03 02:38:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:18,479 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 696 transitions. [2019-10-03 02:38:18,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 696 transitions. [2019-10-03 02:38:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:18,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:18,482 INFO L411 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-10-03 02:38:18,482 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:18,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2118524936, now seen corresponding path program 1 times [2019-10-03 02:38:18,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:18,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:18,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:18,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:18,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:18,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:18,559 INFO L87 Difference]: Start difference. First operand 559 states and 696 transitions. Second operand 9 states. [2019-10-03 02:38:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:18,721 INFO L93 Difference]: Finished difference Result 585 states and 724 transitions. [2019-10-03 02:38:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:18,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-03 02:38:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:18,724 INFO L225 Difference]: With dead ends: 585 [2019-10-03 02:38:18,724 INFO L226 Difference]: Without dead ends: 553 [2019-10-03 02:38:18,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-03 02:38:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-03 02:38:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:38:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 687 transitions. [2019-10-03 02:38:18,734 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 687 transitions. Word has length 62 [2019-10-03 02:38:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:18,734 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 687 transitions. [2019-10-03 02:38:18,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 687 transitions. [2019-10-03 02:38:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:18,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:18,736 INFO L411 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-10-03 02:38:18,736 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash -129702502, now seen corresponding path program 1 times [2019-10-03 02:38:18,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:18,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:18,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:18,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:18,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:18,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:18,819 INFO L87 Difference]: Start difference. First operand 553 states and 687 transitions. Second operand 9 states. [2019-10-03 02:38:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:19,000 INFO L93 Difference]: Finished difference Result 579 states and 715 transitions. [2019-10-03 02:38:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:19,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-03 02:38:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:19,003 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:38:19,003 INFO L226 Difference]: Without dead ends: 548 [2019-10-03 02:38:19,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-03 02:38:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-03 02:38:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-03 02:38:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 679 transitions. [2019-10-03 02:38:19,011 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 679 transitions. Word has length 62 [2019-10-03 02:38:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:19,012 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 679 transitions. [2019-10-03 02:38:19,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 679 transitions. [2019-10-03 02:38:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:19,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:19,013 INFO L411 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-10-03 02:38:19,014 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -905491201, now seen corresponding path program 1 times [2019-10-03 02:38:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:19,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:19,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:38:19,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:19,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:38:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:38:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:19,107 INFO L87 Difference]: Start difference. First operand 548 states and 679 transitions. Second operand 8 states. [2019-10-03 02:38:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:19,213 INFO L93 Difference]: Finished difference Result 562 states and 693 transitions. [2019-10-03 02:38:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:38:19,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-10-03 02:38:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:19,216 INFO L225 Difference]: With dead ends: 562 [2019-10-03 02:38:19,216 INFO L226 Difference]: Without dead ends: 533 [2019-10-03 02:38:19,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-03 02:38:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2019-10-03 02:38:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-03 02:38:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 659 transitions. [2019-10-03 02:38:19,224 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 659 transitions. Word has length 62 [2019-10-03 02:38:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:19,225 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 659 transitions. [2019-10-03 02:38:19,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:38:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 659 transitions. [2019-10-03 02:38:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:38:19,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:19,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:19,227 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-10-03 02:38:19,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:19,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:19,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:19,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:19,301 INFO L87 Difference]: Start difference. First operand 533 states and 659 transitions. Second operand 6 states. [2019-10-03 02:38:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:19,355 INFO L93 Difference]: Finished difference Result 549 states and 680 transitions. [2019-10-03 02:38:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:19,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-10-03 02:38:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:19,358 INFO L225 Difference]: With dead ends: 549 [2019-10-03 02:38:19,358 INFO L226 Difference]: Without dead ends: 549 [2019-10-03 02:38:19,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-03 02:38:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2019-10-03 02:38:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-03 02:38:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 657 transitions. [2019-10-03 02:38:19,371 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 657 transitions. Word has length 71 [2019-10-03 02:38:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:19,372 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 657 transitions. [2019-10-03 02:38:19,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 657 transitions. [2019-10-03 02:38:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 02:38:19,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:19,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:19,374 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:19,374 INFO L82 PathProgramCache]: Analyzing trace with hash -981702428, now seen corresponding path program 1 times [2019-10-03 02:38:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:19,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:19,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:19,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:19,438 INFO L87 Difference]: Start difference. First operand 533 states and 657 transitions. Second operand 3 states. [2019-10-03 02:38:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:19,455 INFO L93 Difference]: Finished difference Result 637 states and 785 transitions. [2019-10-03 02:38:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:19,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-03 02:38:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:19,459 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:38:19,459 INFO L226 Difference]: Without dead ends: 637 [2019-10-03 02:38:19,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-03 02:38:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 607. [2019-10-03 02:38:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:38:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 751 transitions. [2019-10-03 02:38:19,471 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 751 transitions. Word has length 73 [2019-10-03 02:38:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:19,473 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 751 transitions. [2019-10-03 02:38:19,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 751 transitions. [2019-10-03 02:38:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 02:38:19,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:19,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:19,475 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -573109325, now seen corresponding path program 1 times [2019-10-03 02:38:19,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:19,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:19,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:19,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:19,590 INFO L87 Difference]: Start difference. First operand 607 states and 751 transitions. Second operand 9 states. [2019-10-03 02:38:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:19,770 INFO L93 Difference]: Finished difference Result 633 states and 779 transitions. [2019-10-03 02:38:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:19,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-03 02:38:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:19,773 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:38:19,773 INFO L226 Difference]: Without dead ends: 561 [2019-10-03 02:38:19,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-03 02:38:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-03 02:38:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-03 02:38:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 694 transitions. [2019-10-03 02:38:19,782 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 694 transitions. Word has length 66 [2019-10-03 02:38:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:19,782 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 694 transitions. [2019-10-03 02:38:19,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 694 transitions. [2019-10-03 02:38:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 02:38:19,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:19,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:19,785 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1657933026, now seen corresponding path program 1 times [2019-10-03 02:38:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:19,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:19,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:19,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:19,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:19,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:19,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:19,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:19,859 INFO L87 Difference]: Start difference. First operand 561 states and 694 transitions. Second operand 4 states. [2019-10-03 02:38:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:20,008 INFO L93 Difference]: Finished difference Result 765 states and 922 transitions. [2019-10-03 02:38:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:20,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-03 02:38:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:20,011 INFO L225 Difference]: With dead ends: 765 [2019-10-03 02:38:20,011 INFO L226 Difference]: Without dead ends: 765 [2019-10-03 02:38:20,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-03 02:38:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 655. [2019-10-03 02:38:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-03 02:38:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 800 transitions. [2019-10-03 02:38:20,024 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 800 transitions. Word has length 82 [2019-10-03 02:38:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:20,024 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 800 transitions. [2019-10-03 02:38:20,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 800 transitions. [2019-10-03 02:38:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 02:38:20,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:20,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:20,027 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-10-03 02:38:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:20,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:20,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:20,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:20,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:20,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:20,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:20,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:20,192 INFO L87 Difference]: Start difference. First operand 655 states and 800 transitions. Second operand 7 states. [2019-10-03 02:38:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:20,992 INFO L93 Difference]: Finished difference Result 650 states and 786 transitions. [2019-10-03 02:38:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:38:20,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-03 02:38:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:20,995 INFO L225 Difference]: With dead ends: 650 [2019-10-03 02:38:20,995 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:38:20,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:38:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:38:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 639. [2019-10-03 02:38:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:38:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 772 transitions. [2019-10-03 02:38:21,007 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 772 transitions. Word has length 82 [2019-10-03 02:38:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:21,007 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 772 transitions. [2019-10-03 02:38:21,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 772 transitions. [2019-10-03 02:38:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:38:21,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:21,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:21,010 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-10-03 02:38:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:21,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:21,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:21,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:21,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:21,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:21,092 INFO L87 Difference]: Start difference. First operand 639 states and 772 transitions. Second operand 5 states. [2019-10-03 02:38:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:21,117 INFO L93 Difference]: Finished difference Result 651 states and 784 transitions. [2019-10-03 02:38:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:21,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-03 02:38:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:21,119 INFO L225 Difference]: With dead ends: 651 [2019-10-03 02:38:21,119 INFO L226 Difference]: Without dead ends: 637 [2019-10-03 02:38:21,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-03 02:38:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-03 02:38:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-03 02:38:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 768 transitions. [2019-10-03 02:38:21,130 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 768 transitions. Word has length 76 [2019-10-03 02:38:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:21,130 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 768 transitions. [2019-10-03 02:38:21,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 768 transitions. [2019-10-03 02:38:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:38:21,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:21,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:21,132 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-10-03 02:38:21,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:21,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:21,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:21,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:21,211 INFO L87 Difference]: Start difference. First operand 637 states and 768 transitions. Second operand 9 states. [2019-10-03 02:38:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:21,259 INFO L93 Difference]: Finished difference Result 627 states and 754 transitions. [2019-10-03 02:38:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:21,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-03 02:38:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:21,262 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:38:21,262 INFO L226 Difference]: Without dead ends: 591 [2019-10-03 02:38:21,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-03 02:38:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2019-10-03 02:38:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:38:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2019-10-03 02:38:21,272 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 76 [2019-10-03 02:38:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:21,272 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2019-10-03 02:38:21,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2019-10-03 02:38:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 02:38:21,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:21,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:21,274 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:21,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-10-03 02:38:21,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:21,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:21,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:21,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:21,362 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2019-10-03 02:38:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:21,402 INFO L93 Difference]: Finished difference Result 648 states and 809 transitions. [2019-10-03 02:38:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:21,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 02:38:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:21,404 INFO L225 Difference]: With dead ends: 648 [2019-10-03 02:38:21,404 INFO L226 Difference]: Without dead ends: 648 [2019-10-03 02:38:21,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-03 02:38:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 553. [2019-10-03 02:38:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:38:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 659 transitions. [2019-10-03 02:38:21,416 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 659 transitions. Word has length 83 [2019-10-03 02:38:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:21,416 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 659 transitions. [2019-10-03 02:38:21,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 659 transitions. [2019-10-03 02:38:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 02:38:21,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:21,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:21,420 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash -433541091, now seen corresponding path program 1 times [2019-10-03 02:38:21,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:21,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:21,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:21,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:21,471 INFO L87 Difference]: Start difference. First operand 553 states and 659 transitions. Second operand 5 states. [2019-10-03 02:38:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:21,911 INFO L93 Difference]: Finished difference Result 651 states and 757 transitions. [2019-10-03 02:38:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:21,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-03 02:38:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:21,914 INFO L225 Difference]: With dead ends: 651 [2019-10-03 02:38:21,914 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:38:21,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:38:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 628. [2019-10-03 02:38:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-03 02:38:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 735 transitions. [2019-10-03 02:38:21,927 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 735 transitions. Word has length 78 [2019-10-03 02:38:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:21,928 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 735 transitions. [2019-10-03 02:38:21,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2019-10-03 02:38:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 02:38:21,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:21,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:21,932 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1570342342, now seen corresponding path program 1 times [2019-10-03 02:38:21,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:21,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:22,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:22,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:22,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:22,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:22,034 INFO L87 Difference]: Start difference. First operand 628 states and 735 transitions. Second operand 9 states. [2019-10-03 02:38:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:22,152 INFO L93 Difference]: Finished difference Result 627 states and 733 transitions. [2019-10-03 02:38:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:22,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-10-03 02:38:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:22,154 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:38:22,154 INFO L226 Difference]: Without dead ends: 449 [2019-10-03 02:38:22,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-03 02:38:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-03 02:38:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-03 02:38:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-10-03 02:38:22,166 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 79 [2019-10-03 02:38:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:22,167 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-10-03 02:38:22,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-10-03 02:38:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:38:22,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:22,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:22,169 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-10-03 02:38:22,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:22,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:22,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:22,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:22,257 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-10-03 02:38:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:22,370 INFO L93 Difference]: Finished difference Result 467 states and 551 transitions. [2019-10-03 02:38:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:22,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-03 02:38:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:22,372 INFO L225 Difference]: With dead ends: 467 [2019-10-03 02:38:22,372 INFO L226 Difference]: Without dead ends: 449 [2019-10-03 02:38:22,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:38:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-03 02:38:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-03 02:38:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-03 02:38:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-10-03 02:38:22,379 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-10-03 02:38:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:22,379 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-10-03 02:38:22,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-10-03 02:38:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:38:22,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:22,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:22,381 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-10-03 02:38:22,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:22,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:22,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:22,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:22,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:22,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:22,458 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-10-03 02:38:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:22,565 INFO L93 Difference]: Finished difference Result 844 states and 1004 transitions. [2019-10-03 02:38:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:22,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-03 02:38:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:22,573 INFO L225 Difference]: With dead ends: 844 [2019-10-03 02:38:22,573 INFO L226 Difference]: Without dead ends: 792 [2019-10-03 02:38:22,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-03 02:38:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-10-03 02:38:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-03 02:38:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-10-03 02:38:22,581 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-10-03 02:38:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:22,581 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-10-03 02:38:22,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-10-03 02:38:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 02:38:22,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:22,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:22,583 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-10-03 02:38:22,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:22,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:38:22,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:22,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:38:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:38:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:22,729 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-10-03 02:38:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:22,821 INFO L93 Difference]: Finished difference Result 398 states and 460 transitions. [2019-10-03 02:38:22,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:38:22,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-10-03 02:38:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:22,823 INFO L225 Difference]: With dead ends: 398 [2019-10-03 02:38:22,824 INFO L226 Difference]: Without dead ends: 366 [2019-10-03 02:38:22,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:38:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-03 02:38:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-10-03 02:38:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-03 02:38:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-10-03 02:38:22,829 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-10-03 02:38:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:22,830 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-10-03 02:38:22,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:38:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-10-03 02:38:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:38:22,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:22,832 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:22,832 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-10-03 02:38:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 02:38:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:22,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:22,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:22,915 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-10-03 02:38:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:22,946 INFO L93 Difference]: Finished difference Result 305 states and 344 transitions. [2019-10-03 02:38:22,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:22,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-10-03 02:38:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:22,947 INFO L225 Difference]: With dead ends: 305 [2019-10-03 02:38:22,947 INFO L226 Difference]: Without dead ends: 305 [2019-10-03 02:38:22,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-03 02:38:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-10-03 02:38:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-03 02:38:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-10-03 02:38:22,952 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-10-03 02:38:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:22,952 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-10-03 02:38:22,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-10-03 02:38:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:38:22,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:22,955 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:22,955 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-10-03 02:38:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:22,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:22,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 02:38:23,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:23,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:38:23,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:23,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:38:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:38:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:38:23,071 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-10-03 02:38:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:23,158 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2019-10-03 02:38:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:23,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-03 02:38:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:23,160 INFO L225 Difference]: With dead ends: 287 [2019-10-03 02:38:23,160 INFO L226 Difference]: Without dead ends: 287 [2019-10-03 02:38:23,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-03 02:38:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-10-03 02:38:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-03 02:38:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-10-03 02:38:23,166 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-10-03 02:38:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:23,166 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-10-03 02:38:23,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:38:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-10-03 02:38:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:38:23,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:23,168 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:23,168 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-10-03 02:38:23,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 02:38:23,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:23,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:38:23,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:23,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:38:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:38:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:38:23,356 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-10-03 02:38:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:23,544 INFO L93 Difference]: Finished difference Result 298 states and 329 transitions. [2019-10-03 02:38:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:38:23,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-10-03 02:38:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:23,546 INFO L225 Difference]: With dead ends: 298 [2019-10-03 02:38:23,546 INFO L226 Difference]: Without dead ends: 271 [2019-10-03 02:38:23,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:38:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-03 02:38:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-10-03 02:38:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-03 02:38:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-03 02:38:23,554 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-10-03 02:38:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:23,555 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-03 02:38:23,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:38:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-03 02:38:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:38:23,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:23,558 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:23,559 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-10-03 02:38:23,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:23,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:23,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:38:23,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:23,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:23,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:23,638 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-10-03 02:38:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:23,662 INFO L93 Difference]: Finished difference Result 276 states and 310 transitions. [2019-10-03 02:38:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:23,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-03 02:38:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:23,664 INFO L225 Difference]: With dead ends: 276 [2019-10-03 02:38:23,664 INFO L226 Difference]: Without dead ends: 276 [2019-10-03 02:38:23,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-03 02:38:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-10-03 02:38:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-03 02:38:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-03 02:38:23,668 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-10-03 02:38:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:23,668 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-03 02:38:23,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-03 02:38:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:38:23,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:23,671 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:23,671 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-10-03 02:38:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:23,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:38:23,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:23,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:23,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:23,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:23,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:23,754 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-10-03 02:38:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:23,780 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2019-10-03 02:38:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:23,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:38:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:23,782 INFO L225 Difference]: With dead ends: 269 [2019-10-03 02:38:23,782 INFO L226 Difference]: Without dead ends: 269 [2019-10-03 02:38:23,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-03 02:38:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-10-03 02:38:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-03 02:38:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-10-03 02:38:23,788 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-10-03 02:38:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:23,788 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-10-03 02:38:23,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-10-03 02:38:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:38:23,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:23,791 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:23,791 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-10-03 02:38:23,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:23,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:38:24,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:24,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:38:24,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:24,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:38:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:38:24,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:38:24,016 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states. [2019-10-03 02:38:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,270 INFO L93 Difference]: Finished difference Result 307 states and 344 transitions. [2019-10-03 02:38:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:38:25,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-10-03 02:38:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,272 INFO L225 Difference]: With dead ends: 307 [2019-10-03 02:38:25,272 INFO L226 Difference]: Without dead ends: 273 [2019-10-03 02:38:25,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:38:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-03 02:38:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2019-10-03 02:38:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-03 02:38:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2019-10-03 02:38:25,278 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 145 [2019-10-03 02:38:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2019-10-03 02:38:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:38:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2019-10-03 02:38:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:38:25,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,281 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,282 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -659068543, now seen corresponding path program 1 times [2019-10-03 02:38:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:38:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:25,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:25,384 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand 6 states. [2019-10-03 02:38:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,448 INFO L93 Difference]: Finished difference Result 292 states and 327 transitions. [2019-10-03 02:38:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:38:25,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 02:38:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,450 INFO L225 Difference]: With dead ends: 292 [2019-10-03 02:38:25,450 INFO L226 Difference]: Without dead ends: 292 [2019-10-03 02:38:25,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-03 02:38:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2019-10-03 02:38:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-03 02:38:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 296 transitions. [2019-10-03 02:38:25,456 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 296 transitions. Word has length 148 [2019-10-03 02:38:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,456 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 296 transitions. [2019-10-03 02:38:25,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 296 transitions. [2019-10-03 02:38:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:38:25,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,459 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,459 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2021606810, now seen corresponding path program 1 times [2019-10-03 02:38:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:38:25,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:25,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:25,546 INFO L87 Difference]: Start difference. First operand 269 states and 296 transitions. Second operand 5 states. [2019-10-03 02:38:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,558 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2019-10-03 02:38:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:25,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 02:38:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,559 INFO L225 Difference]: With dead ends: 275 [2019-10-03 02:38:25,559 INFO L226 Difference]: Without dead ends: 275 [2019-10-03 02:38:25,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-03 02:38:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-10-03 02:38:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-03 02:38:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2019-10-03 02:38:25,564 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 150 [2019-10-03 02:38:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,564 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2019-10-03 02:38:25,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2019-10-03 02:38:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:38:25,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,566 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,566 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2091873989, now seen corresponding path program 1 times [2019-10-03 02:38:25,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:38:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:38:25,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:38:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:38:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:38:25,767 INFO L87 Difference]: Start difference. First operand 273 states and 300 transitions. Second operand 15 states. [2019-10-03 02:38:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,999 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2019-10-03 02:38:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:38:25,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-10-03 02:38:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:26,000 INFO L225 Difference]: With dead ends: 316 [2019-10-03 02:38:26,001 INFO L226 Difference]: Without dead ends: 283 [2019-10-03 02:38:26,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:38:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-03 02:38:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2019-10-03 02:38:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-03 02:38:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 280 transitions. [2019-10-03 02:38:26,006 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 280 transitions. Word has length 150 [2019-10-03 02:38:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:26,006 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 280 transitions. [2019-10-03 02:38:26,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:38:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 280 transitions. [2019-10-03 02:38:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 02:38:26,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:26,008 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:26,008 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1666371012, now seen corresponding path program 1 times [2019-10-03 02:38:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:26,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:26,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:26,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:38:26,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:26,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:26,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-10-03 02:38:26,240 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [481], [484], [486], [489], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [974], [975], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1101], [1102], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-10-03 02:38:26,297 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:38:26,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:38:26,529 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:38:26,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:38:26,656 INFO L272 AbstractInterpreter]: Visited 126 different actions 151 times. Never merged. Never widened. Performed 1226 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-10-03 02:38:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:26,662 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:38:27,016 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.66% of their original sizes. [2019-10-03 02:38:27,016 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:38:43,515 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-10-03 02:38:43,515 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:38:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:38:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [110] imperfect sequences [12] total 120 [2019-10-03 02:38:43,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:43,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-10-03 02:38:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-10-03 02:38:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=11501, Unknown=0, NotChecked=0, Total=11990 [2019-10-03 02:38:43,519 INFO L87 Difference]: Start difference. First operand 259 states and 280 transitions. Second operand 110 states. [2019-10-03 02:39:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:43,808 INFO L93 Difference]: Finished difference Result 575 states and 647 transitions. [2019-10-03 02:39:43,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-10-03 02:39:43,809 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 153 [2019-10-03 02:39:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:43,811 INFO L225 Difference]: With dead ends: 575 [2019-10-03 02:39:43,811 INFO L226 Difference]: Without dead ends: 516 [2019-10-03 02:39:43,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=828, Invalid=20634, Unknown=0, NotChecked=0, Total=21462 [2019-10-03 02:39:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-03 02:39:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 450. [2019-10-03 02:39:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-03 02:39:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 493 transitions. [2019-10-03 02:39:43,822 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 493 transitions. Word has length 153 [2019-10-03 02:39:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:43,822 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 493 transitions. [2019-10-03 02:39:43,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-10-03 02:39:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 493 transitions. [2019-10-03 02:39:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 02:39:43,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:43,825 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:43,825 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 862297435, now seen corresponding path program 1 times [2019-10-03 02:39:43,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:39:43,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:43,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:43,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:43,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:43,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:43,976 INFO L87 Difference]: Start difference. First operand 450 states and 493 transitions. Second operand 12 states. [2019-10-03 02:39:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:44,121 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2019-10-03 02:39:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:39:44,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-10-03 02:39:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:44,127 INFO L225 Difference]: With dead ends: 498 [2019-10-03 02:39:44,127 INFO L226 Difference]: Without dead ends: 460 [2019-10-03 02:39:44,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 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-10-03 02:39:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-03 02:39:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2019-10-03 02:39:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-10-03 02:39:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 485 transitions. [2019-10-03 02:39:44,137 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 485 transitions. Word has length 164 [2019-10-03 02:39:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:44,137 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 485 transitions. [2019-10-03 02:39:44,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 485 transitions. [2019-10-03 02:39:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:39:44,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:44,140 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:44,140 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:44,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1416389275, now seen corresponding path program 1 times [2019-10-03 02:39:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:39:44,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:44,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:44,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:39:44,285 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [520], [522], [525], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [991], [994], [999], [1002], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1103], [1104], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-10-03 02:39:44,291 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:44,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:44,329 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:39:44,360 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:44,360 INFO L272 AbstractInterpreter]: Visited 86 different actions 111 times. Never merged. Never widened. Performed 964 root evaluator evaluations with a maximum evaluation depth of 10. Performed 964 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-10-03 02:39:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:44,361 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:44,508 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.21% of their original sizes. [2019-10-03 02:39:44,509 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:56,230 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:39:56,230 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:56,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:56,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [82] imperfect sequences [12] total 92 [2019-10-03 02:39:56,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:56,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-03 02:39:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-03 02:39:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=6327, Unknown=0, NotChecked=0, Total=6642 [2019-10-03 02:39:56,233 INFO L87 Difference]: Start difference. First operand 444 states and 485 transitions. Second operand 82 states. [2019-10-03 02:40:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:25,271 INFO L93 Difference]: Finished difference Result 459 states and 503 transitions. [2019-10-03 02:40:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-03 02:40:25,271 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2019-10-03 02:40:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:25,273 INFO L225 Difference]: With dead ends: 459 [2019-10-03 02:40:25,273 INFO L226 Difference]: Without dead ends: 394 [2019-10-03 02:40:25,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=479, Invalid=10233, Unknown=0, NotChecked=0, Total=10712 [2019-10-03 02:40:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-03 02:40:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 357. [2019-10-03 02:40:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-03 02:40:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 386 transitions. [2019-10-03 02:40:25,280 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 386 transitions. Word has length 158 [2019-10-03 02:40:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:25,280 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 386 transitions. [2019-10-03 02:40:25,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-03 02:40:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 386 transitions. [2019-10-03 02:40:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:40:25,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:25,282 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:25,283 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -947452387, now seen corresponding path program 1 times [2019-10-03 02:40:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:40:25,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:25,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:25,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:40:25,432 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [520], [522], [525], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [991], [994], [999], [1002], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1103], [1104], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-10-03 02:40:25,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:40:25,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:40:25,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:40:25,498 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:40:25,498 INFO L272 AbstractInterpreter]: Visited 86 different actions 111 times. Never merged. Never widened. Performed 996 root evaluator evaluations with a maximum evaluation depth of 10. Performed 996 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-10-03 02:40:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:25,499 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:40:25,636 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.21% of their original sizes. [2019-10-03 02:40:25,636 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:40:36,723 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:40:36,723 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:40:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:40:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [82] imperfect sequences [12] total 92 [2019-10-03 02:40:36,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:36,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-03 02:40:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-03 02:40:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6321, Unknown=0, NotChecked=0, Total=6642 [2019-10-03 02:40:36,725 INFO L87 Difference]: Start difference. First operand 357 states and 386 transitions. Second operand 82 states. [2019-10-03 02:41:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:23,354 INFO L93 Difference]: Finished difference Result 501 states and 548 transitions. [2019-10-03 02:41:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-03 02:41:23,354 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2019-10-03 02:41:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:23,356 INFO L225 Difference]: With dead ends: 501 [2019-10-03 02:41:23,356 INFO L226 Difference]: Without dead ends: 436 [2019-10-03 02:41:23,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=485, Invalid=10227, Unknown=0, NotChecked=0, Total=10712 [2019-10-03 02:41:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-03 02:41:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 295. [2019-10-03 02:41:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-03 02:41:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 317 transitions. [2019-10-03 02:41:23,363 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 317 transitions. Word has length 158 [2019-10-03 02:41:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:23,363 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 317 transitions. [2019-10-03 02:41:23,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-03 02:41:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 317 transitions. [2019-10-03 02:41:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-03 02:41:23,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:23,365 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:23,365 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash -64679204, now seen corresponding path program 1 times [2019-10-03 02:41:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:41:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:41:23,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:23,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:41:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:41:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:23,574 INFO L87 Difference]: Start difference. First operand 295 states and 317 transitions. Second operand 12 states. [2019-10-03 02:41:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:23,808 INFO L93 Difference]: Finished difference Result 332 states and 361 transitions. [2019-10-03 02:41:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:41:23,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 169 [2019-10-03 02:41:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:23,811 INFO L225 Difference]: With dead ends: 332 [2019-10-03 02:41:23,811 INFO L226 Difference]: Without dead ends: 294 [2019-10-03 02:41:23,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:41:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-03 02:41:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-10-03 02:41:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-03 02:41:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 311 transitions. [2019-10-03 02:41:23,818 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 311 transitions. Word has length 169 [2019-10-03 02:41:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:23,819 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 311 transitions. [2019-10-03 02:41:23,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:41:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 311 transitions. [2019-10-03 02:41:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-03 02:41:23,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:23,822 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:23,822 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -195886787, now seen corresponding path program 1 times [2019-10-03 02:41:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:41:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:24,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:24,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:24,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:24,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:24,024 INFO L87 Difference]: Start difference. First operand 290 states and 311 transitions. Second operand 11 states. [2019-10-03 02:41:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:24,088 INFO L93 Difference]: Finished difference Result 241 states and 259 transitions. [2019-10-03 02:41:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:24,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-10-03 02:41:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:24,090 INFO L225 Difference]: With dead ends: 241 [2019-10-03 02:41:24,090 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:41:24,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:41:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:41:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:41:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:41:24,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2019-10-03 02:41:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:24,092 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:41:24,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:41:24,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:41:24,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:41:24 BoogieIcfgContainer [2019-10-03 02:41:24,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:41:24,102 INFO L168 Benchmark]: Toolchain (without parser) took 205511.79 ms. Allocated memory was 133.2 MB in the beginning and 667.9 MB in the end (delta: 534.8 MB). Free memory was 86.3 MB in the beginning and 438.6 MB in the end (delta: -352.4 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,104 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.78 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 86.1 MB in the beginning and 161.9 MB in the end (delta: -75.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,107 INFO L168 Benchmark]: Boogie Preprocessor took 95.21 ms. Allocated memory is still 200.8 MB. Free memory was 161.9 MB in the beginning and 157.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,114 INFO L168 Benchmark]: RCFGBuilder took 1314.50 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 157.5 MB in the beginning and 156.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,115 INFO L168 Benchmark]: TraceAbstraction took 203316.90 ms. Allocated memory was 226.0 MB in the beginning and 667.9 MB in the end (delta: 442.0 MB). Free memory was 155.2 MB in the beginning and 438.6 MB in the end (delta: -283.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:24,125 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.78 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 86.1 MB in the beginning and 161.9 MB in the end (delta: -75.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.21 ms. Allocated memory is still 200.8 MB. Free memory was 161.9 MB in the beginning and 157.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1314.50 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 157.5 MB in the beginning and 156.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203316.90 ms. Allocated memory was 226.0 MB in the beginning and 667.9 MB in the end (delta: 442.0 MB). Free memory was 155.2 MB in the beginning and 438.6 MB in the end (delta: -283.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 392 locations, 1 error locations. SAFE Result, 203.2s OverallTime, 70 OverallIterations, 2 TraceHistogramMax, 154.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27378 SDtfs, 13277 SDslu, 100675 SDs, 0 SdLazy, 26203 SolverSat, 2284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 368 SyntacticMatches, 10 SemanticMatches, 815 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11107 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=915occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9680219559625404 AbsIntWeakeningRatio, 2.2103004291845494 AbsIntAvgWeakeningVarsNumRemoved, 25.13519313304721 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 70 MinimizatonAttempts, 2454 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5362 NumberOfCodeBlocks, 5362 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 5292 ConstructedInterpolants, 0 QuantifiedInterpolants, 864158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 67 PerfectInterpolantSequences, 375/384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...